Results 1  10
of
1,110,081
P.: Efficient parallel outofcore matrix transposition
 In: Proceedings of the International Conference on Cluster Computing, IEEE Computer Society Press
, 2003
"... This paper addresses the problem of parallel transposition of large outofcore arrays. Although algorithms for outofcore matrix transposition have been widely studied, previously proposed algorithms have sought to minimize the number of I/O operations and the inmemory permutation time. We propose ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
This paper addresses the problem of parallel transposition of large outofcore arrays. Although algorithms for outofcore matrix transposition have been widely studied, previously proposed algorithms have sought to minimize the number of I/O operations and the inmemory permutation time. We
On efficient outofcore matrix transposition
, 2003
"... This paper addresses the problem of transposition of large outofcore arrays. Although algorithms for outofcore matrix transposition have been widely studied, previously proposed algorithms have sought to minimize the number of I/O operations and the inmemory permutation time. We propose an alg ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
This paper addresses the problem of transposition of large outofcore arrays. Although algorithms for outofcore matrix transposition have been widely studied, previously proposed algorithms have sought to minimize the number of I/O operations and the inmemory permutation time. We propose
Outofcore problems
, 2005
"... ,,The only way to discover the limits of the possible is to go beyond them into the impossible.”[12] Arthur C. Clarke 1 In this paper we show outofcore problems and some issues connected with it. As the OOC is a very wide matter, we are concerning on only some problems. The main part of the paper ..."
Abstract
 Add to MetaCart
,,The only way to discover the limits of the possible is to go beyond them into the impossible.”[12] Arthur C. Clarke 1 In this paper we show outofcore problems and some issues connected with it. As the OOC is a very wide matter, we are concerning on only some problems. The main part of the paper
The nas parallel benchmarks
 The International Journal of Supercomputer Applications
, 1991
"... A new set of benchmarks has been developed for the performance evaluation of highly parallel supercomputers. These benchmarks consist of ve \parallel kernel " benchmarks and three \simulated application" benchmarks. Together they mimic the computation and data movement characterist ..."
Abstract

Cited by 686 (10 self)
 Add to MetaCart
A new set of benchmarks has been developed for the performance evaluation of highly parallel supercomputers. These benchmarks consist of ve \parallel kernel " benchmarks and three \simulated application" benchmarks. Together they mimic the computation and data movement
Parallel Numerical Linear Algebra
, 1993
"... We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We illust ..."
Abstract

Cited by 766 (23 self)
 Add to MetaCart
We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We
Fast Parallel Algorithms for ShortRange Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract

Cited by 622 (6 self)
 Add to MetaCart
dynamics models which can be difficult to parallelize efficiently  those with shortrange forces where the neighbors of each atom change rapidly. They can be implemented on any distributedmemory parallel machine which allows for messagepassing of data between independently executing processors
Performing OutofCore FFTs on Parallel
, 1996
"... Disk Systems The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering. Although most onedimensional FFT problems can be solved entirely in main memory, some important classes of applications require outofcore techniques. For these, use of parallel I ..."
Abstract
 Add to MetaCart
Disk Systems The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering. Although most onedimensional FFT problems can be solved entirely in main memory, some important classes of applications require outofcore techniques. For these, use of parallel
LogP: Towards a Realistic Model of Parallel Computation
, 1993
"... A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding developme ..."
Abstract

Cited by 562 (15 self)
 Add to MetaCart
the computing bandwidth, the communication bandwidth, the communication delay, and the efficiency of coupling communication and computation. Portable parallel algorithms typically adapt to the machine configuration, in terms of these parameters. The utility of the model is demonstrated through examples
Efficient and Effective Querying by Image Content
 Journal of Intelligent Information Systems
, 1994
"... In the QBIC (Query By Image Content) project we are studying methods to query large online image databases using the images' content as the basis of the queries. Examples of the content we use include color, texture, and shape of image objects and regions. Potential applications include med ..."
Abstract

Cited by 500 (13 self)
 Add to MetaCart
, and of images of airplane silhouettes. We also consider the efficient indexing of these features, specifically addre...
Dryad: Distributed DataParallel Programs from Sequential Building Blocks
 In EuroSys
, 2007
"... Dryad is a generalpurpose distributed execution engine for coarsegrain dataparallel applications. A Dryad application combines computational “vertices ” with communication “channels ” to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set of availa ..."
Abstract

Cited by 730 (27 self)
 Add to MetaCart
simultaneously on multiple computers, or on multiple CPU cores within a computer. The application can discover the size and placement of data at run time, and modify the graph as the computation progresses to make efficient use of the available resources. Dryad is designed to scale from powerful multicore sin
Results 1  10
of
1,110,081