Results 1  10
of
174,445
A Parallel Symmetric BlockTridiagonal DivideandConquer Algorithm
 University of Tennessee
, 2007
"... We present a parallel implementation of the blocktridiagonal divideandconquer algorithm that computes eigensolutions of symmetric blocktridiagonal matrices to reduced accuracy. In our implementation, we use mixed data/task parallelism to achieve data distribution and workload balance. Numerical ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We present a parallel implementation of the blocktridiagonal divideandconquer algorithm that computes eigensolutions of symmetric blocktridiagonal matrices to reduced accuracy. In our implementation, we use mixed data/task parallelism to achieve data distribution and workload balance
Practical Parallel DivideandConquer Algorithms
, 1997
"... Nested data parallelism has been shown to be an important feature of parallel languages, allowing the concise expression of algorithms that operate on irregular data structures such as graphs and sparse matrices. However, previous nested dataparallel languages have relied on a vector PRAM impleme ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
implementation layer that cannot be efficiently mapped to MPPs with high interprocessor latency. This thesis shows that by restricting the problem set to that of dataparallel divideandconquer algorithms I can maintain the expressibility of full nested dataparallel languages while achieving good
The DivideandConquer Manifesto
 Proceedings of the Eleventh International Conference on Algorithmic Learning Theory
, 2000
"... . Existing machine learning theory and algorithms have focused on learning an unknown function from training examples, where the unknown function maps from a feature vector to one of a small number of classes. Emerging applications in science and industry require learning much more complex funct ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
applications. These systems all employ some form of divideandconquer, where the inputs and outputs are divided into smaller pieces (e.g., "windows"), classified, and then the results are merged to produce an overall solution. This paper defines the problem of divideandconquer learning
DivideandConquer Algorithms on the Hypercube
 Theoretical Computer Science
, 1993
"... We show how to implement divideandconquer algorithms without undue overhead on a wide class of networks. We give an optimal generic divideandconquer implementation on hypercubes for the class of divideandconquer algorithms for which the total size of the subproblems on any level of the recursi ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
We show how to implement divideandconquer algorithms without undue overhead on a wide class of networks. We give an optimal generic divideandconquer implementation on hypercubes for the class of divideandconquer algorithms for which the total size of the subproblems on any level
DivideandConquer Algorithms on the Hypercube
 Theoretical Computer Science
, 1993
"... We show how to implement divideandconquer algorithms without undue overhead on a wide class of networks. We give an optimal generic divideandconquer implementation on hypercubes for the class of divideandconquer algorithms for which the total size of the subproblems on any level of the recu ..."
Abstract
 Add to MetaCart
We show how to implement divideandconquer algorithms without undue overhead on a wide class of networks. We give an optimal generic divideandconquer implementation on hypercubes for the class of divideandconquer algorithms for which the total size of the subproblems on any level
The Architecture of Cognition
, 1983
"... Spanning seven orders of magnitude: a challenge for ..."
Abstract

Cited by 1580 (40 self)
 Add to MetaCart
Spanning seven orders of magnitude: a challenge for
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems
 IN PROCEEDINGS OF THE 1994 WINTER USENIX CONFERENCE
, 1994
"... TreadMarks is a distributed shared memory (DSM) system for standard Unix systems such as SunOS and Ultrix. This paper presents a performance evaluation of TreadMarks running on Ultrix using DECstation5000/240's that are connected by a 100Mbps switchbased ATM LAN and a 10Mbps Ethernet. Ou ..."
Abstract

Cited by 527 (17 self)
 Add to MetaCart
TreadMarks is a distributed shared memory (DSM) system for standard Unix systems such as SunOS and Ultrix. This paper presents a performance evaluation of TreadMarks running on Ultrix using DECstation5000/240's that are connected by a 100Mbps switchbased ATM LAN and a 10Mbps Ethernet
DISTRIBUTED SYSTEMS
, 1985
"... Growth of distributed systems has attained unstoppable momentum. If we better understood how to think about, analyze, and design distributed systems, we could direct their implementation with more confidence. ..."
Abstract

Cited by 755 (1 self)
 Add to MetaCart
Growth of distributed systems has attained unstoppable momentum. If we better understood how to think about, analyze, and design distributed systems, we could direct their implementation with more confidence.
Results 1  10
of
174,445