Sciweavers

1257 search results - page 154 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
ICPP
1993
IEEE
15 years 2 months ago
Activity Counter: New Optimization for the Dynamic Scheduling of SIMD Control Flow
SIMD or vector computers and collection-oriented languages, like C , are designed to perform the same computation on each data item or on just a subset of the data. Subsets of pro...
Ronan Keryell, Nicolas Paris
HPDC
1998
IEEE
15 years 2 months ago
Matchmaking: Distributed Resource Management for High Throughput Computing
Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not ada...
Rajesh Raman, Miron Livny, Marvin H. Solomon
VLSID
2002
IEEE
149views VLSI» more  VLSID 2002»
15 years 10 months ago
Functional Partitioning for Low Power Distributed Systems of Systems-on-a-Chip
In this paper, we present a functional partitioning method for low power real-time distributed embedded systems whose constituent nodes are systems-on-a-chip (SOCs). The systemlev...
Yunsi Fei, Niraj K. Jha
INFOCOM
2011
IEEE
14 years 1 months ago
Scheduling in mapreduce-like systems for fast completion time
Abstract—Large-scale data processing needs of enterprises today are primarily met with distributed and parallel computing in data centers. MapReduce has emerged as an important p...
Hyunseok Chang, Murali S. Kodialam, Ramana Rao Kom...
CLUSTER
2006
IEEE
15 years 4 months ago
Robust task scheduling in non-deterministic heterogeneous computing systems
The paper addresses the problem of matching and scheduling of DAG-structured application to both minimize the makespan and maximize the robustness in a heterogeneous computing sys...
Zhiao Shi, Emmanuel Jeannot, Jack Dongarra