default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWang Yi 0001
- > Home > Persons > Wang Yi 0001
Publications
- 2015
[j33]Pontus Ekberg, Nan Guan
, Martin Stigge, Wang Yi:
An optimal resource sharing protocol for generalized multiframe tasks. J. Log. Algebraic Methods Program. 84(1): 92-105 (2015)- [j32]Martin Stigge, Wang Yi:
Graph-based models for real-time workload: a survey. Real Time Syst. 51(5): 602-636 (2015) - [j31]Martin Stigge, Wang Yi:
Combinatorial abstraction refinement for feasibility analysis of static priorities. Real Time Syst. 51(6): 639-674 (2015) - [c103]Nan Guan, Yue Tang, Jakaria Abdullah, Martin Stigge, Wang Yi:
Scalable Timing Analysis with Refinement. TACAS 2015: 3-18 - 2014
- [c99]Martin Stigge, Nan Guan, Wang Yi:
Refinement-Based Exact Response-Time Analysis. ECRTS 2014: 143-152 - [c94]Nan Guan, Chuancai Gu, Martin Stigge, Qingxu Deng, Wang Yi:
Approximate Response Time Analysis of Real-Time Task Graphs. RTSS 2014: 304-313 - 2013
- [j24]Martin Stigge, Pontus Ekberg, Wang Yi:
The fork-join real-time task model. SIGBED Rev. 10(2): 20 (2013) - [c86]Martin Stigge, Wang Yi:
Combinatorial Abstraction Refinement for Feasibility Analysis. RTSS 2013: 340-349 - 2012
- [c84]Martin Stigge, Wang Yi:
Hardness Results for Static Priority Real-Time Scheduling. ECRTS 2012: 189-198 - [c83]Nan Guan, Martin Stigge, Wang Yi, Ge Yu:
Parametric Utilization Bounds for Fixed-Priority Multiprocessor Scheduling. IPDPS 2012: 261-272 - 2011
- [c77]Martin Stigge, Pontus Ekberg, Nan Guan, Wang Yi:
On the Tractability of Digraph-Based Task Models. ECRTS 2011: 162-171 - [c76]Nan Guan, Pontus Ekberg, Martin Stigge, Wang Yi:
Resource Sharing Protocols for Real-Time Task Graph Systems. ECRTS 2011: 272-281 - [c74]Martin Stigge, Pontus Ekberg, Nan Guan, Wang Yi:
The Digraph Real-Time Task Model. IEEE Real-Time and Embedded Technology and Applications Symposium 2011: 71-80 - [c72]Nan Guan, Pontus Ekberg, Martin Stigge, Wang Yi:
Effective and Efficient Scheduling of Certifiable Mixed-Criticality Sporadic Task Systems. RTSS 2011: 13-23 - 2010
- [c67]Nan Guan, Martin Stigge, Wang Yi, Ge Yu:
Fixed-Priority Multiprocessor Scheduling with Liu and Layland's Utilization Bound. IEEE Real-Time and Embedded Technology and Applications Symposium 2010: 165-174 - 2009
- [c63]Nan Guan, Martin Stigge, Wang Yi, Ge Yu:
Cache-aware scheduling and analysis for multicores. EMSOFT 2009: 245-254 - [c60]Nan Guan, Martin Stigge, Wang Yi, Ge Yu:
New Response Time Bounds for Fixed Priority Multiprocessor Scheduling. RTSS 2009: 387-397 - 2007
- [c53]Pavel Krcál, Martin Stigge, Wang Yi:
Multi-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times. FORMATS 2007: 274-289
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-04-15 02:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
