Sciweavers

2438 search results - page 339 / 488
» Scheduling problems for parallel and distributed systems
Sort
View
ICALP
1992
Springer
15 years 9 months ago
Near-perfect Token Distribution
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli ...
IPPS
2006
IEEE
15 years 11 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch
159
Voted
IEEEPACT
2005
IEEE
15 years 10 months ago
A Distributed Control Path Architecture for VLIW Processors
VLIW architectures are popular in embedded systems because they offer high-performance processing at low cost and energy. The major problem with traditional VLIW designs is that t...
Hongtao Zhong, Kevin Fan, Scott A. Mahlke, Michael...
134
Voted
JGAA
2006
120views more  JGAA 2006»
15 years 5 months ago
Distributing Unit Size Workload Packages in Heterogeneous Networks
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of neares...
Robert Elsässer, Burkhard Monien, Stefan Scha...
COLCOM
2007
IEEE
15 years 11 months ago
Kademlia for data storage and retrieval in enterprise networks
— Centralized organization of current enterprise networks doesn’t represent an ideal solution in terms of information security and reliability. Denial of service, packet filter...
Natalya Fedotova, Stefano Fanti, Luca Veltri