Sciweavers

235 search results - page 3 / 47
» Overview of a Performance Evaluation System for Global Compu...
Sort
View
ISHPC
2003
Springer
14 years 27 days ago
Evaluating Heuristic Scheduling Algorithms for High Performance Parallel Processing
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
Lars Lundberg, Magnus Broberg, Kamilla Klonowska
ICPPW
2007
IEEE
14 years 2 months ago
A Quality-Driven Algorithm for Resource Scheduling Based on Market Model on Grid
Several challenges about computational grid exist in integrating, coordinating and managing of resources and scheduling of applications, due to distributed resources at various le...
Lei Tang, Zhiyi Yang, Zhiwen Yu, Yunlan Wang
HPDC
2002
IEEE
14 years 20 days ago
Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications
In high energy physics, bioinformatics, and other disciplines, we encounter applications involving numerous, loosely coupled jobs that both access and generate large data sets. So...
Kavitha Ranganathan, Ian T. Foster
SOSP
2009
ACM
14 years 4 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
RTCSA
1998
IEEE
13 years 12 months ago
Wait-Free Snapshots in Real-Time Systems: Algorithms and Performance
Snap-shot mechanisms are used to read a globally consistent set of variable values. Such a mechanism can be used to solve a variety of communication and synchronization problems, ...
Andreas Ermedahl, Hans Hansson, Marina Papatrianta...