Sciweavers

2814 search results - page 68 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
PODC
2005
ACM
14 years 3 months ago
Stochastic analysis of distributed deadlock scheduling
Deadlock detection scheduling is an important, yet oft-overlooked problem that can significantly affect the overall performance of deadlock handling. An excessive initiation of ...
Shigang Chen, Yibei Ling
IADIS
2003
13 years 11 months ago
Scalability of Cooperative Algorithms for Distributed Architectures of Proxy Servers
Systems consisting of multiple proxy servers are a popular solution to deal with performance and network resource utilization problems related to the growth of the Web numbers. Af...
Riccardo Lancellotti, Francesca Mazzoni, Michele C...
IJES
2006
110views more  IJES 2006»
13 years 10 months ago
Partitioning bin-packing algorithms for distributed real-time systems
Embedded real-time systems must satisfy not only logical functional requirements but also para-functional properties such as timeliness, Quality of Service (QoS) and reliability. W...
Dionisio de Niz, Raj Rajkumar
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
13 years 7 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...
TPDS
2002
80views more  TPDS 2002»
13 years 9 months ago
Analysis of Transposition-Table-Driven Work Scheduling in Distributed Search
This paper discusses a new work-scheduling algorithm for parallel search of single-agent state spaces, called Transposition-Table-Driven Work Scheduling, that places the transposit...
John W. Romein, Henri E. Bal, Jonathan Schaeffer, ...