Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleJuly 2001
- ArticleJuly 2001
A work-optimal CGM algorithm for the LIS problem
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesJuly 2001, Pages 330–331https://doi.org/10.1145/378580.378756This paper presents a work-optimal CGM algorithm that solves the Longest Increasing Subsequence Problem. It can be implemented in the CGM with P processors in O(N2 ÷P) time and O(P) communication steps. It is the first CGM algorithm for this problem and ...
- ArticleJuly 2001
Eventually consistent failure detectors
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesJuly 2001, Pages 326–327https://doi.org/10.1145/378580.378747The concept of unreliable failure detecto was introduced by Chandra and Toueg [2] as a mechanism that provides (possibly incorrect) information about process failures. This mechanism has been used to solve different problems in async hronous systems, in ...
- ArticleJuly 2001
Scheduling tasks with small communication delays for clusters of processors
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesJuly 2001, Pages 314–315https://doi.org/10.1145/378580.378726Until recently, the standard communication model for scheduling the task of a parallel program has been the homogeneous communication model (also known as the delay model) introduced by Rayward-Smith for unit-execution-times, unit-communication times (...
-
- ArticleJuly 2001
A note on cycle covering
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesJuly 2001, Pages 310–311https://doi.org/10.1145/378580.378716This study considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other.
- ArticleJuly 2001
D-CAT: A distributed channel allocation strategy based on a threshold scheme for cellular mobile networks
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesJuly 2001, Pages 308–309https://doi.org/10.1145/378580.378699We propose a distributed channel allocation algorithm based on a threshold scheme, called D-CAT, for cellular mobile networks. The D-CAT algorithm employs two thresholds: (i) a heavy threshold used for determining whether a cell is heavy, i.e., ...
- ArticleJuly 2001
Periodic, random-fault-tolerant correction networks
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesJuly 2001, Pages 298–305https://doi.org/10.1145/378580.378697We study the problem of sorting sequences of N-keys that can be obtained from sorted ones by changing values of s, 0 < s ⪇ N, keys at unknown positions. Such s-disturbed sequences can appear as outputs of a sorting network that contains faulty ...
- ArticleJuly 2001
Randomized k-set agreement
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesJuly 2001, Pages 291–297https://doi.org/10.1145/378580.378690The k-Set Agreement problem generalizes the consensus problem (which corresponds to the case k = 1). The processes propose values and each correct process has to decide a value such that (1) a decided value is a proposed value, and (2) no more than k ...
- ArticleJuly 2001
A data tracking scheme for general networks
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesJuly 2001, Pages 247–254https://doi.org/10.1145/378580.378670Consider an arbitrary distributed network in which large numbers of objects are continuously being created, replicated, and destroyed. A basic problem arising in such an environment is that of organizing a data tracking scheme for locating object ...
- ArticleJuly 2001
Approximation algorithms for data management in networks
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesJuly 2001, Pages 237–246https://doi.org/10.1145/378580.378651This paper deals with static data management in computer systems connected by networks. A basic functionality in these systems is the interactive use of shared data objects that can be accessed from each computer in the system. Examples for these ...
- ArticleJuly 2001
Ordering disks for double erasure codes
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesJuly 2001, Pages 229–236https://doi.org/10.1145/378580.378650Dish arrays have been designed with two competing goals in mind, the ability to reconstruct erased disks (reliability), and the speed with which information can be read, written, and reconstructed (performance). The substantial loss in performance of ...
- ArticleJuly 2001
Scheduling best-effort and real-time pipelined applications on time-shared clusters
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesJuly 2001, Pages 209–219https://doi.org/10.1145/378580.378646Two important emerging trends are influencing the design, implementation and deployment of high performance parallel systems. The first is on the architectural end, where both economic and technological factors are compelling the use of off-the-shelf ...
- ArticleJuly 2001
Scheduling on hierarchical clusters using malleable tasks
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesJuly 2001, Pages 199–208https://doi.org/10.1145/378580.378640The model of malleable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application at a larger level of granularity than in other models (corresponding ...
- ArticleJuly 2001
Optimal semi-oblique tiling
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesJuly 2001, Pages 153–162https://doi.org/10.1145/378580.378619For 2-D iteration space tiling, we address the problem of determining the tile parameters that minimize the total execution time under the BSP model. We consider uniform dependency computations, tiled so that (at least) one of the tile boundaries is ...
- ArticleJuly 2001
Computational power of pipelined memory hierarchies
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesJuly 2001, Pages 144–152https://doi.org/10.1145/378580.378615We define a model of computation, called the Pipelined Hierarchical Random Access Machine with access function a (x), denoted the a(x)-PH-RAM. In this model, a processor interacts with a memory which can accept requests at a constant rate and satisfy ...
- ArticleJuly 2001
A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesJuly 2001, Pages 134–143https://doi.org/10.1145/378580.378611A non-blocking FIFO queue algorithm for multiprocessor shared memory systems is presented in this paper. The algorithm is very simple, fast and scales very well in both symmetric and non-symmetric multiprocessor shared memory systems. Experiments on a ...
- ArticleJuly 2001
Room synchronizations
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesJuly 2001, Pages 122–133https://doi.org/10.1145/378580.378605We present a class of synchronization called room synchronizations and show how this class can be used to implement asynchronous parallel queues and stacks with constant time access (assuming a fetch-and-add operation). The room synchronization problem ...
- ArticleJuly 2001
Automatable verification of sequential consistency
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesJuly 2001, Pages 113–121https://doi.org/10.1145/378580.378604Sequential consistency is a multiprocessor memory model of both practical and theoretical importance. Designing and implementing a memory system that efficiently provides a given memory model is a challenging and error-prone task, so automated ...
- ArticleJuly 2001
A cost effective architecture for vectorizable numerical and multimedia applications
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesJuly 2001, Pages 103–112https://doi.org/10.1145/378580.378602This paper analyzes the performance of vector-dominated regions of code in numerical and multimedia applications in a superscalar+vector architecture and compares it to an 8-way superscalar processor. The ability to split a program's execution into ...