Sciweavers

157 search results - page 12 / 32
» The Case for Fair Multiprocessor Scheduling
Sort
View
IEEEPACT
1997
IEEE
13 years 12 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
RTAS
2002
IEEE
14 years 17 days 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...
EUROSYS
2006
ACM
14 years 4 months ago
Balancing power consumption in multiprocessor systems
Actions usually taken to prevent processors from overheating, such as decreasing the frequency or stopping the execution flow, also degrade performance. Multiprocessor systems, h...
Andreas Merkel, Frank Bellosa
WCNC
2008
IEEE
14 years 2 months ago
Proportional Fair Scheduling: Analytical Insight under Rayleigh Fading Environment
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...
Erwu Liu, Kin K. Leung
RTSS
2002
IEEE
14 years 17 days ago
Locking in Pfair-Scheduled Multiprocessor Systems
We present several locking synchronization protocols and associated schedulability conditions for Pfair-scheduled multiprocessor systems. We focus on two classes of protocols. The...
Philip Holman, James H. Anderson