Sciweavers

437 search results - page 30 / 88
» Quincy: fair scheduling for distributed computing clusters
Sort
View
HPCC
2007
Springer
15 years 6 months ago
FROCM: A Fair and Low-Overhead Method in SMT Processor
Simultaneous Multithreading (SMT)[1][2] and chip multiprocessors (CMP) processors [3] have emerged as the mainstream computing platform in major market segments, including PC, serv...
Shuming Chen, Pengyong Ma
IEEEPACT
2002
IEEE
15 years 4 months ago
Exploiting Pseudo-Schedules to Guide Data Dependence Graph Partitioning
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...
Alex Aletà, Josep M. Codina, F. Jesú...
ICPP
2007
IEEE
15 years 6 months ago
Energy-Efficient Scheduling for Parallel Applications Running on Heterogeneous Clusters
High performance clusters have been widely used to provide amazing computing capability for both commercial and scientific applications. However, huge power consumption has preven...
Ziliang Zong, Xiao Qin, Xiaojun Ruan, Kiranmai Bel...
EUROPAR
2005
Springer
15 years 5 months ago
A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
Erik G. Boman, Doruk Bozdag, Ümit V. Ç...
CCGRID
2010
IEEE
15 years 26 days ago
Towards Energy Aware Scheduling for Precedence Constrained Parallel Tasks in a Cluster with DVFS
Abstract--Reducing energy consumption for high end computing can bring various benefits such as, reduce operating costs, increase system reliability, and environment respect. This ...
Lizhe Wang, Gregor von Laszewski, Jai Dayal, Fugan...