Results 1  10
of
239,865
A Comparison of Sorting Algorithms for the Connection Machine CM2
"... We have implemented three parallel sorting algorithms on the Connection Machine Supercomputer model CM2: Batcher's bitonic sort, a parallel radix sort, and a sample sort similar to Reif and Valiant's flashsort. We have also evaluated the implementation of many other sorting algorithms pro ..."
Abstract

Cited by 190 (7 self)
 Add to MetaCart
We have implemented three parallel sorting algorithms on the Connection Machine Supercomputer model CM2: Batcher's bitonic sort, a parallel radix sort, and a sample sort similar to Reif and Valiant's flashsort. We have also evaluated the implementation of many other sorting algorithms
DataParallel Implementations of Dense Simplex Methods on the Connection Machine CM2
, 1995
"... We describe three dataparallel implementations of the simplex method for dense linear programming problems. The first implementation uses a full tableau and the mostnegative reduced cost pivot rule, the second uses a tableau and the steepestedge pivot rule, and the third is a revised method with ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
with explicit inverse. All are implemented on a Connection Machine CM2 massively parallel computer system, using a variant of Fortran 90. Using special data structures called stripe arrays, we produce efficient implementations. We compare the implementations to one another, and to MINOS 5.4 on a Sun
A Comparative Study of Gauge Fixing Procedures on the Connection Machines CM2 and CM5
, 1993
"... Gauge fixing is a frequent task encountered in practical lattice gauge theory calculations. We review the performance characteristics of some standard gauging procedures for nonAbelian gauge theories, implemented on the parallel machines CM2 and CM5. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Gauge fixing is a frequent task encountered in practical lattice gauge theory calculations. We review the performance characteristics of some standard gauging procedures for nonAbelian gauge theories, implemented on the parallel machines CM2 and CM5.
A Comparison of Sorting Algorithms for the Connection Machine CM2
, 1991
"... We have implemented three parallel sorting algorithms on the Connection Machine Supercomputer model CM2: Batcher's bitonic sort, a parallel radix sort, and a sample sort similar to Reif and Valiant's flashsort. We have also evaluated the implementation of many other sorting algorithms pro ..."
Abstract
 Add to MetaCart
We have implemented three parallel sorting algorithms on the Connection Machine Supercomputer model CM2: Batcher's bitonic sort, a parallel radix sort, and a sample sort similar to Reif and Valiant's flashsort. We have also evaluated the implementation of many other sorting algorithms
Abstract A Comparison of Sorting Algorithms for the Connection Machine CM2
"... We have implemented three parallel sorting algorithms on the Connection Machine Supercomputer model CM2: B atcher’s bitonic sort, a parallel radix sor ~ and a sample sort similar to Reif and Valiant’s flashsort. We have also evaluated the implementation of many other sorting algorithms proposed in ..."
Abstract
 Add to MetaCart
We have implemented three parallel sorting algorithms on the Connection Machine Supercomputer model CM2: B atcher’s bitonic sort, a parallel radix sor ~ and a sample sort similar to Reif and Valiant’s flashsort. We have also evaluated the implementation of many other sorting algorithms proposed
THE STATIC QUARKANTIQUARKPOTENTIAL: A `CLASSICAL ' EXPERIMENT ON THE CONNECTION MACHINE CM2
, 1993
"... This meeting produces another evidence that present parallel computers are (a) real instruments of computational physics, (b) largely in the hands of stillpioneers, (c) eciently promotedby basic research groupswith largescale computationalneeds. Progress in parallel computing is carried by two ty ..."
Abstract
 Add to MetaCart
in theoretical particle physics on the Connection Machine CM2: a high statistics computer experiment to determine the static quarkantiquark potential from quenched quantum chromodynamics.
PERFORMANCE MODELING FOR HIGHORDER FINITE DIFFERENCE METHODS ON THE CONNECTION MACHINE CM2
"... This paper is concerned with modeling the performance of highorder finitedifference schemes for hyperbolic problems on the Connection Machine CM2. Specifically, we would like to determine whether the higher communication cost of higherorder methods makes them less favorable in a parallel setti ..."
Abstract
 Add to MetaCart
This paper is concerned with modeling the performance of highorder finitedifference schemes for hyperbolic problems on the Connection Machine CM2. Specifically, we would like to determine whether the higher communication cost of higherorder methods makes them less favorable in a parallel
Knowledgebased Analysis of Microarray Gene Expression Data By Using Support Vector Machines
, 2000
"... We introduce a method of functionally classifying genes by using gene expression data from DNA microarray hybridization experiments. The method is based on the theory of support vector machines (SVMs). SVMs are considered a supervised computer learning method because they exploit prior knowledge of ..."
Abstract

Cited by 514 (8 self)
 Add to MetaCart
We introduce a method of functionally classifying genes by using gene expression data from DNA microarray hybridization experiments. The method is based on the theory of support vector machines (SVMs). SVMs are considered a supervised computer learning method because they exploit prior knowledge
Active Messages: a Mechanism for Integrated Communication and Computation
, 1992
"... The design challenge for largescale multiprocessors is (1) to minimize communication overhead, (2) allow communication to overlap computation, and (3) coordinate the two without sacrificing processor cost/performance. We show that existing message passing multiprocessors have unnecessarily high com ..."
Abstract

Cited by 1055 (75 self)
 Add to MetaCart
tremendous flexibility. Implementations on nCUBE/2 and CM5 are described and evaluated using a splitphase sharedmemory extension to C, SplitC. We further show that active messages are sufficient to implement the dynamically scheduled languages for which message driven machines were designed
Benchmarking Least Squares Support Vector Machine Classifiers
 NEURAL PROCESSING LETTERS
, 2001
"... In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LSSVMs), a least squares cost function is proposed so as to obtain a linear set of eq ..."
Abstract

Cited by 446 (46 self)
 Add to MetaCart
In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LSSVMs), a least squares cost function is proposed so as to obtain a linear set
Results 1  10
of
239,865