Sciweavers

2110 search results - page 38 / 422
» What is the complexity of a distributed computing system
Sort
View
IPTPS
2005
Springer
15 years 9 months ago
Brushwood: Distributed Trees in Peer-to-Peer Systems
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...
Chi Zhang, Arvind Krishnamurthy, Randolph Y. Wang
154
Voted
ICPP
2007
IEEE
15 years 10 months ago
Improving Static Task Scheduling in Heterogeneous and Homogeneous Computing Systems
In this paper, we present a heuristic algorithm that improves the performance of static task scheduling. Our algorithm is based on the list-scheduling mechanism. For the listing p...
Chih-Hsueh Yang, PeiZong Lee, Yeh-Ching Chung
HCW
1999
IEEE
15 years 8 months ago
Simulation of Task Graph Systems in Heterogeneous Computing Environments
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...
Noé Lopez-Benitez, Ja-Young Hyon
CMG
1997
15 years 5 months ago
Capacity Planning in Distributed Environments
Capacity Planning has been a discipline practiced by IT since before the invention of the mainframe. It encompasses different measurement, analysis, modeling and reporting techniq...
Bernard Domanski
HPDC
2009
IEEE
15 years 10 months ago
Maintaining reference graphs of globally accessible objects in fully decentralized distributed systems
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...
Björn Saballus, Thomas Fuhrmann