Sciweavers

181 search results - page 8 / 37
» tpds 2008
Sort
View
TPDS
1998
95views more  TPDS 1998»
14 years 9 months ago
Bound Performance Models of Heterogeneous Parallel Processing Systems
- Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to o...
Simonetta Balsamo, Lorenzo Donatiello, Nico M. van...
TPDS
1998
71views more  TPDS 1998»
14 years 9 months ago
Parallel Algorithms for Relational Coarsest Partition Problems
—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are 3-complete and hence it may not be possible to desig...
Sanguthevar Rajasekaran, Insup Lee
TPDS
2002
80views more  TPDS 2002»
14 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, ...
TPDS
2010
98views more  TPDS 2010»
14 years 8 months ago
Minimum Latency Gossiping in Radio Networks
—We studied the minimum latency gossiping (all-to-all broadcast) problem in multihop radio networks defined as follows: Each node in the network is preloaded with a message and t...
Scott C.-H. Huang, Peng-Jun Wan, Hongwei Du, E. K....
TPDS
2010
109views more  TPDS 2010»
14 years 8 months ago
Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa