Sciweavers

307 search results - page 15 / 62
» The communication complexity of distributed task allocation
Sort
View
CLUSTER
2006
IEEE
14 years 12 months ago
A flexible multi-dimensional QoS performance measure framework for distributed heterogeneous systems
When users' tasks in a distributed heterogeneous computing environment (e.g., cluster of heterogeneous computers) are allocated resources, the total demand placed on some sys...
Jong-Kook Kim, Debra A. Hensgen, Taylor Kidd, Howa...
ICDT
2011
ACM
270views Database» more  ICDT 2011»
14 years 3 months ago
On the equivalence of distributed systems with queries and communication
Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study...
Serge Abiteboul, Balder ten Cate, Yannis Katsis
CF
2009
ACM
15 years 6 months ago
Strategies for dynamic memory allocation in hybrid architectures
Hybrid architectures combining the strengths of generalpurpose processors with application-specific hardware accelerators can lead to a significant performance improvement. Our ...
Peter Bertels, Wim Heirman, Dirk Stroobandt
CLUSTER
2001
IEEE
15 years 3 months ago
The Master-Slave Paradigm with Heterogeneous Processors
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
Olivier Beaumont, Arnaud Legrand, Yves Robert
NOMS
2010
IEEE
180views Communications» more  NOMS 2010»
14 years 10 months ago
Performance-driven task co-scheduling for MapReduce environments
—MapReduce is a data-driven programming model proposed by Google in 2004 which is especially well suited for distributed data analytics applications. We consider the management o...
Jorda Polo, David Carrera, Yolanda Becerra, Malgor...