Sciweavers

1901 search results - page 20 / 381
» Models and Scheduling Mechanisms for Global Computing Applic...
Sort
View
IPPS
1996
IEEE
15 years 3 months ago
Efficient Run-Time Support for Irregular Task Computations with Mixed Granularities
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...
Cong Fu, Tao Yang
84
Voted
IPPS
2000
IEEE
15 years 3 months ago
Buffered Coscheduling: A New Methodology for Multitasking Parallel Jobs on Distributed Systems
Buffered coscheduling is a scheduling methodology for time-sharing communicating processes in parallel and distributed systems. The methodology has two primary features: communica...
Fabrizio Petrini, Wu-chun Feng
CORR
2004
Springer
180views Education» more  CORR 2004»
14 years 11 months ago
Self-Organized Stigmergic Document Maps: Environment as a Mechanism for Context Learning
Social insect societies and more specifically ant colonies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organi...
Vitorino Ramos, Juan J. Merelo Guervós
CORR
2004
Springer
180views Education» more  CORR 2004»
14 years 11 months ago
Alchemi: A .NET-based Grid Computing Framework and its Integration into Global Grids
: Computational grids that couple geographically distributed resources are becoming the de-facto computing platform for solving large-scale problems in science, engineering, and co...
Akshay Luther, Rajkumar Buyya, Rajiv Ranjan, Sriku...
67
Voted
ATAL
2006
Springer
15 years 2 months ago
A comparison between mechanisms for sequential compute resource auctions
This paper describes simulations designed to test the relative efficiency of two different sequential auction mechanisms for allocating compute resources between users in a shared...
Andrew Byde