Sciweavers

5831 search results - page 816 / 1167
» Distributed Dynamic Backtracking
Sort
View
183
Voted
WDAG
2001
Springer
107views Algorithms» more  WDAG 2001»
15 years 11 months ago
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
Lisa Higham, Zhiying Liang
199
Voted
WOMPAT
2001
Springer
15 years 11 months ago
OmniRPC: A Grid RPC Facility for Cluster and Global Computing in OpenMP
d Abstract) Mitsuhisa Sato1 , Motonari Hirano2 , Yoshio Tanaka2 , and Satoshi Sekiguchi2 1 Real World Computing Partnership, Tsukuba, Japan 2 Software Research Associates, Inc 3 El...
Mitsuhisa Sato, Motonori Hirano, Yoshio Tanaka, Sa...
HCW
2000
IEEE
15 years 11 months ago
Fast and Effective Task Scheduling in Heterogeneous Systems
Recently, we presented two very low-cost approaches to compile-time list scheduling where the tasks’ priorities are computed statically or dynamically, respectively. For homogen...
Andrei Radulescu, Arjan J. C. van Gemund
HPCA
2000
IEEE
15 years 11 months ago
Modified LRU Policies for Improving Second-Level Cache Behavior
Main memory accesses continue to be a significant bottleneck for applications whose working sets do not fit in second-level caches. With the trend of greater associativity in seco...
Wayne A. Wong, Jean-Loup Baer
182
Voted
IEEEPACT
2000
IEEE
15 years 11 months ago
Exploring the Limits of Sub-Word Level Parallelism
Multimedia instruction set extensions have become a prominent feature in desktop microprocessor platforms, promising superior performance on a wide range of floating-point and int...
Kevin Scott, Jack W. Davidson