Sciweavers

500 search results - page 21 / 100
» Process Scheduling for the Parallel Desktop
Sort
View
HPDC
2007
IEEE
14 years 3 months ago
A fast topology inference: a building block for network-aware parallel processing
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
Tatsuya Shirai, Hideo Saito, Kenjiro Taura
HPDC
2010
IEEE
13 years 10 months ago
A hybrid Markov chain model for workload on parallel computers
This paper proposes a comprehensive modeling architecture for workloads on parallel computers using Markov chains in combination with state dependent empirical distribution functi...
Anne Krampe, Joachim Lepping, Wiebke Sieben
STOC
2005
ACM
156views Algorithms» more  STOC 2005»
14 years 9 months ago
Convex programming for scheduling unrelated parallel machines
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
Yossi Azar, Amir Epstein
ISCA
2008
IEEE
112views Hardware» more  ISCA 2008»
14 years 3 months ago
Parallelism-Aware Batch Scheduling: Enhancing both Performance and Fairness of Shared DRAM Systems
In a chip-multiprocessor (CMP) system, the DRAM system is shared among cores. In a shared DRAM system, requests from a thread can not only delay requests from other threads by cau...
Onur Mutlu, Thomas Moscibroda
JSSPP
2007
Springer
14 years 3 months ago
New Challenges of Parallel Job Scheduling
Abstract. The workshop on job scheduling strategies for parallel processing (JSSPP) studies the myriad aspects of managing resources on parallel and distributed computers. These st...
Eitan Frachtenberg, Uwe Schwiegelshohn