Sciweavers

461 search results - page 21 / 93
» Verifying parallel programs with dynamic communication struc...
Sort
View
IPPS
1996
IEEE
13 years 11 months ago
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
David A. Bader, Joseph JáJá
ICC
2007
IEEE
122views Communications» more  ICC 2007»
14 years 1 months ago
Dynamic Programming for Scheduling a Single Route in Wireless Networks
— Multi-slot resource scheduling in a general two dimensional wireless ad hoc network, is a hard problem with no known polynomial-time solution. Recent optimization theoretic ana...
Gyouhwan Kim, Rohit Negi
IEEEPACT
2003
IEEE
14 years 1 days ago
Compiler-Directed Content-Aware Prefetching for Dynamic Data Structures
This paper describes Compiler-Directed Content-Aware Prefetching (CDCAP), an integrated compiler and hardware approach for prefetching dynamic data structures. The approach utiliz...
Hassan Al-Sukhni, Ian Bratt, Daniel A. Connors
IPPS
2006
IEEE
14 years 23 days ago
Structural and algorithmic issues of dynamic protocol update
In this paper, we study dynamic protocol update (DPU). Contrary to local code updates on-the-fly, DPU requires global coordination of local code replacements. We propose a novel ...
Olivier Rütti, Pawel T. Wojciechowski, Andr&e...
HIPC
2005
Springer
14 years 8 days ago
Mobile Pipelines: Parallelizing Left-Looking Algorithms Using Navigational Programming
Abstract. Parallelizing a sequential algorithm—i.e., manually or automatically converting it into an equivalent parallel distributed algorithm—is an important problem. Ideally,...
Lei Pan, Ming Kin Lai, Michael B. Dillencourt, Lub...