Sciweavers

237 search results - page 14 / 48
» Policies for Dynamic Clock Scheduling
Sort
View
AIPS
2003
13 years 11 months ago
Quality and Utility - Towards a Generalization of Deadline and Anytime Scheduling
Scheduling algorithms for real-time systems can be characterized in various ways, one of the most important ones of which is the underlying task model. Many concepts of real-time ...
Thomas Schwarzfischer
TVLSI
2008
107views more  TVLSI 2008»
13 years 9 months ago
Static and Dynamic Temperature-Aware Scheduling for Multiprocessor SoCs
Thermal hot spots and high temperature gradients degrade reliability and performance, and increase cooling costs and leakage power. In this paper, we explore the benefits of temper...
Ayse Kivilcim Coskun, T. T. Rosing, Keith Whisnant...
ECRTS
2005
IEEE
14 years 3 months ago
Energy Aware Non-Preemptive Scheduling for Hard Real-Time Systems
Slowdown based on dynamic voltage scaling (DVS) provides the ability to perform an energy-delay tradeoff in the system. Non-preemptive scheduling becomes an integral part of syste...
Ravindra Jejurikar, Rajesh K. Gupta
ICPADS
2006
IEEE
14 years 4 months ago
Efficient Compile-Time Task scheduling for Heterogeneous Distributed Computing Systems
Efficient task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems (or HeDCSs). Because of its key importance, several scheduling...
Mohammad I. Daoud, Nawwaf N. Kharma
MOBISYS
2005
ACM
14 years 9 months ago
Horde: separating network striping policy from mechanism
Inverse multiplexing, or network striping, allows the construction of a high-bandwidth virtual channel from a collection of multiple low-bandwidth network channels. Striping syste...
Asfandyar Qureshi, John V. Guttag