TPDS
2002
13 years 11 months ago
2002
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
TPDS
2002
13 years 11 months ago
2002
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...
TPDS
2002
13 years 11 months ago
2002
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
TPDS
2002
13 years 11 months ago
2002
TPDS
2002
13 years 11 months ago
2002
This paper considers a technique for composing global (barrier-style) and local (channel scanning) synchronization protocols within a single parallel discrete-event simulation. Com...
TPDS
2002
13 years 11 months ago
2002
TPDS
2002
13 years 11 months ago
2002
TPDS
2002
13 years 11 months ago
2002
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is...
TPDS
2002
13 years 11 months ago
2002
This paper addresses the problem of reliably multicasting Web resources across wireless local area networks (WLANs) in support of collaborative computing applications. An adaptive ...
TPDS
2002
13 years 11 months ago
2002
Multiprocessor architectures demand efficient interprocessor communication to maximize system utilization and performance. To meet future demands, these interconnects must communic...