Sciweavers

48 search results - page 4 / 10
» Tail-robust scheduling via limited processor sharing
Sort
View
PDP
2005
IEEE
15 years 3 months ago
Memory Bandwidth Aware Scheduling for SMP Cluster Nodes
Clusters of SMPs are becoming increasingly common. However, the shared memory design of SMPs and the consequential contention between system processors for access to main memory c...
Evangelos Koukis, Nectarios Koziris
97
Voted
SOCA
2010
IEEE
14 years 8 months ago
Weighted fair share scheduling for loosely controlled concurrent event systems
In asynchronous event systems, the production of an event is decoupled from its consumption via an event queue. The loose coupling of such systems allows great flexibility as to ...
Sean Rooney, Luis Garcés-Erice, Kristijan D...
ASPLOS
2010
ACM
15 years 2 months ago
Probabilistic job symbiosis modeling for SMT processor scheduling
Symbiotic job scheduling boosts simultaneous multithreading (SMT) processor performance by co-scheduling jobs that have ‘compatible’ demands on the processor’s shared resour...
Stijn Eyerman, Lieven Eeckhout
HOTOS
2007
IEEE
15 years 1 months ago
Processor Hardware Counter Statistics as a First-Class System Resource
Today's processors provide a rich source of statistical information on program execution characteristics through hardware counters. However, traditionally, operating system (...
Xiao Zhang, Sandhya Dwarkadas, Girts Folkmanis, Ka...
IPPS
2003
IEEE
15 years 2 months ago
Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tas...
Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andre...