800 search results - page 3 / 160 » Understanding Algorithm Performance on an Oversubscribed Sch... |
INFOCOM
2008
IEEE
14 years 20 days ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
PVM
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
ISPDC
2008
IEEE
14 years 20 days ago
2008
IEEE
This paper presents a new approach for analyzing the performance of grid scheduling algorithms for tasks with dependencies. Finding the optimal procedures for DAG scheduling in Gr...
CCGRID
2007
IEEE
14 years 18 days ago
2007
IEEE
Abstract— Effective scheduling is critical for the performance of an application launched onto the Grid environment [11], [12]. Finding effective scheduling algorithms for this...
WORDS
2005
IEEE
13 years 12 months ago
2005
IEEE
Writing a new scheduler and integrating it into an existing OS is a daunting task, requiring the understanding of multiple low-level kernel mechanisms. Indeed, implementing a new ...