Results 1  10
of
77
A Survey of Adaptive Sorting Algorithms
, 1992
"... Introduction and Survey; F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems  Sorting and Searching; E.5 [Data]: Files  Sorting/searching; G.3 [Mathematics of Computing]: Probability and Statistics  Probabilistic algorithms; E.2 [Data Storage Represe ..."
Abstract

Cited by 65 (3 self)
 Add to MetaCart
Introduction and Survey; F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems  Sorting and Searching; E.5 [Data]: Files  Sorting/searching; G.3 [Mathematics of Computing]: Probability and Statistics  Probabilistic algorithms; E.2 [Data Storage Representation]: Composite structures, linked representations. General Terms: Algorithms, Theory. Additional Key Words and Phrases: Adaptive sorting algorithms, Comparison trees, Measures of disorder, Nearly sorted sequences, Randomized algorithms. A Survey of Adaptive Sorting Algorithms 2 CONTENTS INTRODUCTION I.1 Optimal adaptivity I.2 Measures of disorder I.3 Organization of the paper 1.WORSTCASE ADAPTIVE (INTERNAL) SORTING ALGORITHMS 1.1 Generic Sort 1.2 CookKim division 1.3 Partition Sort 1.4 Exponential Search 1.5 Adaptive Merging 2.EXPECTEDCASE ADAPTIV
Concurrent Access of Priority Queues
 IEEE Transactions on Computers
, 1988
"... The heap is an important data structure used as a priority queue in a wide variety of parallel algorithms (e.g., multiprocessor scheduling, branchandbound). In these algorithms, contention for the shared heap limits the obtainable speedup. This paper presents an approach to allow concurrent insert ..."
Abstract

Cited by 50 (2 self)
 Add to MetaCart
The heap is an important data structure used as a priority queue in a wide variety of parallel algorithms (e.g., multiprocessor scheduling, branchandbound). In these algorithms, contention for the shared heap limits the obtainable speedup. This paper presents an approach to allow concurrent insertions and deletions on the heap in a sharedmemory multiprocessor. The scheme also retains the strict priority ordering of the serialaccess heap algorithms; i.e., a delete operation returns the best key of all keys that have been inserted or are being inserted at the time delete is started. Our experimental results on the BBN Butterfly parallel processor demonstrate that the use of the concurrentheap algorithms in parallel branchandbound improves its performance substantially. Index Terms: concurrent data structures, priority queues, insertions, deletions, branchand bound, speedup. 1 Introduction The heap is an important data structure used as a priority queue in a wide variety of paral...
Parallel Programming using Functional Languages
, 1991
"... I am greatly indebted to Simon Peyton Jones, my supervisor, for his encouragement and technical assistance. His overwhelming enthusiasm was of great support to me. I particularly want to thank Simon and Geoff Burn for commenting on earlier drafts of this thesis. Through his excellent lecturing Cohn ..."
Abstract

Cited by 48 (3 self)
 Add to MetaCart
I am greatly indebted to Simon Peyton Jones, my supervisor, for his encouragement and technical assistance. His overwhelming enthusiasm was of great support to me. I particularly want to thank Simon and Geoff Burn for commenting on earlier drafts of this thesis. Through his excellent lecturing Cohn Runciman initiated my interest in functional programming. I am grateful to Phil Trinder for his simulator, on which mine is based, and Will Partain for his help with LaTex and graphs. I would like to thank the Science and Engineering Research Council of Great Britain for their financial support. Finally, I would like to thank Michelle, whose culinary skills supported me whilst I was writingup.The Imagination the only nation worth defending a nation without alienation a nation whose flag is invisible and whose borders are forever beyond the horizon a nation whose motto is why have one or the other when you can have one the other and both
Parallel Depth First Search, Part II: Analysis
 International Journal of Parallel Programming
"... This paper presents the analysis of a parallel formulation of depthfirst search. At the heart of this parallel formulation is a dynamic workdistribution scheme that divides the work between different processors. The effectiveness of the parallel formulation is strongly influenced by the workdistr ..."
Abstract

Cited by 48 (16 self)
 Add to MetaCart
This paper presents the analysis of a parallel formulation of depthfirst search. At the heart of this parallel formulation is a dynamic workdistribution scheme that divides the work between different processors. The effectiveness of the parallel formulation is strongly influenced by the workdistribution scheme and the target architecture. We introduce the concept of isoefficiency function to characterize the effectiveness of different architectures and workdistribution schemes. Many researchers considered the ring architecture to be quite suitable for parallel depthfirst search. Our analytical and experimental results show that hypercube and sharedmemory architectures are significantly better. The analysis of previously known workdistribution schemes motivated the design of substantially improved schemes for ring and sharedmemory architectures. In particular, we present a workdistribution algorithm which guarantees close to optimal performance on a sharedmemory/!networkwith...
Parallel BestFirst Search of StateSpace Graphs: A Summary of Results
 in Proc. 10th Nat. Conf. AI, AAAI
, 1988
"... This paper presents many different parallel formulations of the A*/BranchandBound search algorithm. The parallel formulations primarily differ in the data structures used. Some formulations are suited only for sharedmemory architectures, whereas others are suited for distributedmemory architectur ..."
Abstract

Cited by 42 (4 self)
 Add to MetaCart
This paper presents many different parallel formulations of the A*/BranchandBound search algorithm. The parallel formulations primarily differ in the data structures used. Some formulations are suited only for sharedmemory architectures, whereas others are suited for distributedmemory architectures as well. These parallel formulations have been implemented to solve the vertex cover problem and the TSP problem on the BBN Butterfly parallel processor. Using appropriate data structures, we are able to obtain fairly linear speedups for as many as 100 processors. We also discovered problem characteristics that make certain formulations more (or less) suitable for some search problems. Since the bestfirst search paradigm of A*/BranchandBound is very commonly used, we expect these parallel formulations to be effective for a variety of problems. Concurrent and distributed priority queues used in these parallel formulations can be used in many parallel algorithms other than parallel A*/bra...
Programming a Hypercube Multicomputer
, 1988
"... We describe those features of distributed memory MIMD hypercube multicomputers that are necessary to obtain efficient programs. Several examples are developed. These illustrate the effectiveness of different programming strategies. ..."
Abstract

Cited by 33 (4 self)
 Add to MetaCart
We describe those features of distributed memory MIMD hypercube multicomputers that are necessary to obtain efficient programs. Several examples are developed. These illustrate the effectiveness of different programming strategies.
An improved Newton iteration for the generalized inverse of a matrix, with applications
 SIAM J. Sci. Stat. Comput
, 1991
"... 94035. An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications _" ..."
Abstract

Cited by 27 (14 self)
 Add to MetaCart
94035. An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications _"
Performance Evaluation of the CM5 Interconnection Network
 In Proceedings of CompCon Spring'93
, 1993
"... This paper presents performance characteristics of the CM5 data network with respect to bandwidth and latency. We present the maximum effective network bandwidth as a function of (1) message size, (2) varying data path through different levels of the network hierarchy, and (3) system load. We al ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
This paper presents performance characteristics of the CM5 data network with respect to bandwidth and latency. We present the maximum effective network bandwidth as a function of (1) message size, (2) varying data path through different levels of the network hierarchy, and (3) system load. We also present latency as a function of message size and network hierarchy. In the second part of our evaluation, we present the maximum effective network bandwidth as a function of data flow pattern (2d and 3d mesh, stencils, ring, tree, and hypercube) using several variant embedding schemes. Measurements were obtained using CMMD V 1.3.1, Thinking Machine Corporation's messagepassing library, and CMNF V 1.1, a fast messagepassing library developed by the Minnesota Supercomputer Center (MSC) for the Army High Performance Research Center (AHPCRC). Using CMNF we were able to observe measurements which were very close to actual hardware capabilities. 1 Research supported in part by the...