Sciweavers

10106 search results - page 56 / 2022
» Algorithm Selection and Scheduling
Sort
View
RTCSA
2007
IEEE
14 years 5 months ago
Real-Time Scheduling with Task Splitting on Multiprocessors
This paper presents a real-time scheduling algorithm with high schedulability and few preemptions for multiprocessor systems. The algorithm is based on an unorthodox method called...
Shinpei Kato, Nobuyuki Yamasaki
HPDC
2010
IEEE
14 years 1 days ago
Cluster-wide context switch of virtualized jobs
Clusters are mostly used through Resources Management Systems (RMS) with a static allocation of resources for a bounded amount of time. Those approaches are known to be insufficie...
Fabien Hermenier, Adrien Lebre, Jean-Marc Menaud
ICDCS
2009
IEEE
14 years 8 months ago
On the Impossibility of Maximal Scheduling for Strong Fairness with Interleaving
A strongly fair schedule is one in which tasks that are enabled infinitely often are also executed infinitely often. When tasks execute atomically, a strongly fair scheduler can...
Matthew Lang, Paolo A. G. Sivilotti
EPIA
2005
Springer
14 years 4 months ago
Learning to Select Negotiation Strategies in Multi-agent Meeting Scheduling
In this paper, we look at the Multi-Agent Meeting Scheduling problem where distributed agents negotiate meeting times on behalf of their users. While many negotiation approaches ha...
Elisabeth Crawford, Manuela M. Veloso
TWC
2008
91views more  TWC 2008»
13 years 10 months ago
Throughput and Channel Access Statistics of Generalized Selection Multiuser Scheduling
To provide a near-optimal low-complexity solution to parallel multiuser scheduling in code-division multiple-access (CDMA), we propose generalized selection multiuser diversity (GS...
Yao Ma, Jinghua Jin, Dongbo Zhang