Sciweavers

1243 search results - page 117 / 249
» FPZL Schedulability Analysis
Sort
View
RTAS
2002
IEEE
15 years 11 months ago
The Aperiodic Multiprocessor Utilization Bound for Liquid Tasks
Real-time scheduling theory has developed powerful tools for translating conditions on aggregate system utilization into per-task schedulability guarantees. The main breakthrough ...
Tarek F. Abdelzaher, Björn Andersson, Jan Jon...
ICCAD
1999
IEEE
153views Hardware» more  ICCAD 1999»
15 years 10 months ago
Cycle time and slack optimization for VLSI-chips
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
Christoph Albrecht, Bernhard Korte, Jürgen Sc...
SCHEDULING
2008
72views more  SCHEDULING 2008»
15 years 5 months ago
The impact of local policies on the quality of packet routing in paths, trees, and rings
We consider the packet routing problem in store-and-forward networks whose topologies are either paths, trees, or rings. We are interested by the quality of the solution produced,...
Eric Angel, Evripidis Bampis, Fanny Pascual
IFIP
2010
Springer
15 years 24 days ago
Model Checking of Concurrent Algorithms: From Java to C
Concurrent software is difficult to verify. Because the thread schedule is not controlled by the application, testing may miss defects that occur under specific thread schedules. T...
Cyrille Artho, Masami Hagiya, Watcharin Leungwatta...
INFOCOM
2009
IEEE
16 years 18 days ago
Delay-Optimal Opportunistic Scheduling and Approximations: The Log Rule
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...
Bilal Sadiq, Seung Jun Baek, Gustavo de Veciana