Sciweavers

2355 search results - page 46 / 471
» Scheduling in the Z-Polyhedral Model
Sort
View
CATA
2010
13 years 11 months ago
Mixed-criticality Scheduling: Improved Resource-augmentation Results
Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different c...
Sanjoy K. Baruah, Haohan Li, Leen Stougie
USENIX
2003
13 years 11 months ago
Robust, Portable I/O Scheduling with the Disk Mimic
We propose a new approach for I/O scheduling that performs on-line simulation of the underlying disk. When simulation is integrated within a system, three key challenges must be a...
Florentina I. Popovici, Andrea C. Arpaci-Dusseau, ...
JPDC
2007
86views more  JPDC 2007»
13 years 9 months ago
Performance evaluation of a new scheduling algorithm for distributed systems with security heterogeneity
High quality of security is increasingly critical for applications running on heterogeneous distributed systems. However, existing scheduling algorithms for heterogeneous distribu...
Tao Xie 0004, Xiao Qin
FLAIRS
2008
14 years 7 days ago
Recovering from Inconsistency in Distributed Simple Temporal Networks
Simple Temporal Networks (STNs) are frequently used in scheduling applications, as they provide a powerful and general tool for managing temporal constraints. One obstacle to thei...
Anthony Gallagher, Stephen F. Smith
IPPS
2007
IEEE
14 years 4 months ago
Scheduling in the Z-Polyhedral Model
The polyhedral model is extensively used for analyses and transformations of regular loop programs, one of the most important being automatic parallelization. The model, however, ...
Gautam Gupta, DaeGon Kim, Sanjay V. Rajopadhye