JPDC 2002 - PDF Preprint Papers

JPDC 2002

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JPDC-2002 Paper

click to vote

JPDC
2002

104views more JPDC 2002»

Fully dynamic distributed search trees can be balanced in O(lg2 N) time

13 years 4 months ago

Download www.mat.uniroma2.it

In this paper we consider the dictionary problem in a message-passing distributed environment. We introduce a new version, based on AVL-trees, of distributed search trees, the fir...

Fabio Barillari, Enrico Nardelli, Massimo Pepe

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	104	Fully dynamic distributed search trees can be balanced in O(lg2 N) time	claim
2	103	Adaptive Resource Management Algorithms for Periodic Tasks in Dynamic Real-Time Distributed Systems	claim
3	88	An Integrated Technique for Task Matching and Scheduling onto Distributed Heterogeneous Computing Systems	claim
4	71	A Border-based Coordination Language for Integrating Task and Data Parallelism	claim
5	63	Compiler-Optimized Simulation of Large-Scale Applications on High Performance Architectures	claim
6	54	Token-Based Self-Stabilizing Uniform Algorithms	claim
7	53	Generating Systems of Equations for Performance Evaluation of Multistage Interconnection Networks	claim
8	50	Adaptive Load-Balancing Algorithms Using Symmetric Broadcast Networks	claim
9	50	From Design Patterns to Parallel Architectural Skeletons	claim
10	49	Scheduler-Activated Dynamic Page Migration for Multiprogrammed DSM Multiprocessors	claim
11	46	Optimal and Efficient Algorithms for Summing and Prefix Summing on Parallel Machines	claim
12	46	Characterization of Deadlocks in Irregular Networks	claim
13	45	A Genetic Algorithm for Finding the Pagenumber of Interconnection Networks	claim
14	42	Tolerating Transient and Intermittent Failures	claim
15	42	Scalability versus Execution Time in Scalable Systems	claim
16	42	Stabilization-Preserving Atomicity Refinement	claim
17	38	Heterogeneous Computing and Parallel Genetic Algorithms	claim
18	38	Simulating Spatially Explicit Problems on High Performance Architectures	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers