Sciweavers

252 search results - page 33 / 51
» Task Assignment and Scheduling under Memory Constraints
Sort
View
RTSS
2002
IEEE
15 years 10 months ago
The Space of Rate Monotonic Schedulability
Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic ...
Enrico Bini, Giorgio C. Buttazzo
TII
2010
124views Education» more  TII 2010»
15 years 9 days ago
Address-Independent Estimation of the Worst-case Memory Performance
Abstract--Real-time systems are subject to temporal constraints and require a schedulability analysis to ensure that task execution finishes within lower and upper specified bounds...
Basilio B. Fraguela, Diego Andrade, Ramon Doallo
IEEEPACT
1997
IEEE
15 years 9 months ago
A Parallel Algorithm for Compile-Time Scheduling of Parallel Programs on Multiprocessors
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
Yu-Kwong Kwok, Ishfaq Ahmad
JSAC
2007
81views more  JSAC 2007»
15 years 5 months ago
Packet Prioritization in Multihop Latency Aware Scheduling for Delay Constrained Communication
— This paper addresses the problem of optimizing the packet transmission schedule in a multihop wireless network with end-to-end delay constraints. The emphasis is to determine t...
Ben Liang, Min Dong
MICRO
2002
IEEE
143views Hardware» more  MICRO 2002»
15 years 10 months ago
Effective instruction scheduling techniques for an interleaved cache clustered VLIW processor
Clustering is a common technique to overcome the wire delay problem incurred by the evolution of technology. Fully-distributed architectures, where the register file, the functio...
Enric Gibert, F. Jesús Sánchez, Anto...