Sciweavers

737 search results - page 11 / 148
» Group Priority Scheduling
Sort
View
MICRO
2011
IEEE
407views Hardware» more  MICRO 2011»
13 years 2 months ago
Thread Cluster Memory Scheduling
In a modern chip-multiprocessor system, memory is a shared resource among multiple concurrently executing threads. The memory scheduling algorithm should resolve memory contention...
Yoongu Kim, Michael Papamichael, Onur Mutlu, Mor H...
SCHEDULING
2010
116views more  SCHEDULING 2010»
13 years 5 months ago
Characterizing sets of jobs that admit optimal greedy-like algorithms
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
Periklis A. Papakonstantinou, Charles Rackoff
RTAS
2011
IEEE
12 years 11 months ago
End-to-End Delay Analysis for Fixed Priority Scheduling in WirelessHART Networks
—The WirelessHART standard has been specifically designed for real-time communication between sensor and actuator devices for industrial process monitoring and control. End-toen...
Abusayeed Saifullah, You Xu, Chenyang Lu, Yixin Ch...
RTSS
2008
IEEE
14 years 1 months ago
Priority Assignment for Real-Time Wormhole Communication in On-Chip Networks
—Wormhole switching with fixed priority preemption has been proposed as a possible solution for real-time on-chip communication. However, none of current priority assignment pol...
Zheng Shi, Alan Burns
MFCS
2009
Springer
14 years 2 months ago
On the Structure of Optimal Greedy Computation (for Job Scheduling)
We consider Priority Algorithm [BNR03] as a syntactic model of formulating the concept of greedy algorithm for Job Scheduling, and we study the computation of optimal priority alg...
Periklis A. Papakonstantinou