Sciweavers

2110 search results - page 281 / 422
» What is the complexity of a distributed computing system
Sort
View
EDOC
2007
IEEE
15 years 11 months ago
An Analysis Framework for Mobile Workforce Automation
In this paper we introduce an analysis framework for mobile workforce automation. The framework is based on the findings from earlier research as well as on an analysis of 27 rec...
Volker Gruhn, André Köhler
EUROPAR
2007
Springer
15 years 10 months ago
Negotiation Strategies Considering Opportunity Functions for Grid Scheduling
In Grid systems, nontrivial qualities of service have to be provided to users by the resource providers. However, resource management in a decentralized infrastructure is a complex...
Jiadao Li, Kwang Mong Sim, Ramin Yahyapour
GCC
2003
Springer
15 years 9 months ago
P2P Overlay Networks of Constant Degree
This paper proposes an abstract and generic topological model that captures the essence of P2P architecture. Such model should in return facilitate the exploitation of the new desi...
Guihai Chen, Cheng-Zhong Xu, Haiying Shen, Daoxu C...
WDAG
1995
Springer
109views Algorithms» more  WDAG 1995»
15 years 8 months ago
Faster Possibility Detection by Combining Two Approaches
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
Scott D. Stoller, Fred B. Schneider
138
Voted
WSC
2007
15 years 7 months ago
Controlled sequential bifurcation for software reliability study
Computer simulation is an appealing approach for the reliability analysis of structure-based software systems as it can accommodate important complexities present in realistic sys...
Jun Xu, Feng Yang, Hong Wan