Sciweavers

1205 search results - page 155 / 241
» On P Systems with Bounded Parallelism
Sort
View
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
14 years 1 months ago
Efficiency of Data Distribution in BitTorrent-Like Systems
BitTorrent (BT) in practice is a very efficient method to share data over a network of clients. In this paper we extend the recent work of Arthur and Panigrahy [1] on modelling the...
Ho-Leung Chan, Tak Wah Lam, Prudence W. H. Wong
IPPS
2007
IEEE
14 years 3 months ago
A Semi-Distributed Axiomatic Game Theoretical Mechanism for Replicating Data Objects in Large Distributed Computing Systems
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
Samee Ullah Khan, Ishfaq Ahmad
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
13 years 8 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
SPAA
2003
ACM
14 years 2 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
ASPLOS
1992
ACM
14 years 1 months ago
High Speed Switch Scheduling for Local Area Networks
Current technology trends make it possible to build communication networks that can support high performance distributed computing. This paper describes issues in the design of a ...
Thomas E. Anderson, Susan S. Owicki, James B. Saxe...