Sciweavers

189 search results - page 28 / 38
» Scheduling Issues in Optimistic Parallelization
Sort
View
IPPS
2009
IEEE
15 years 4 months ago
Sparse collective operations for MPI
Abstract—We discuss issues in designing sparse (nearest neighbor) collective operations for communication and reduction operations in small neighborhoods for the Message Passing ...
Torsten Hoefler, Jesper Larsson Träff
IPPS
2000
IEEE
15 years 2 months ago
Deterministic Replay of Distributed Java Applications
Execution behavior of a Java application can be nondeterministic due to concurrent threads of execution, thread scheduling, and variable network delays. This nondeterminism in Jav...
Ravi B. Konuru, Harini Srinivasan, Jong-Deok Choi
CCGRID
2009
IEEE
14 years 10 months ago
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Han Zhao, Xiaolin Li
IPPS
2007
IEEE
15 years 3 months ago
Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
Deng Pan, Yuanyuan Yang
CCGRID
2006
IEEE
15 years 3 months ago
Imprecise Computation Grid Application Model for Flexible Market-Based Resource Allocation
Market-based resource management is becoming an emerging issue as the utilization of Grid computing is growing rapidly, particularly in the business field. In this paper, we prov...
Kyong Hoon Kim, Rajkumar Buyya, Jong Kim