Results 1  10
of
157,653
SCALLOP: A Highly Scalable Parallel Poisson Solver in Three Dimensions
, 2003
"... SCALLOP is a highly scalable solver and library for elliptic partial differential equations on regular blockstructured domains. SCALLOP avoids high communication overheads algorithmically by taking advantage of the locality properties inherent to solutions to elliptic PDEs. Communication costs are ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
SCALLOP is a highly scalable solver and library for elliptic partial differential equations on regular blockstructured domains. SCALLOP avoids high communication overheads algorithmically by taking advantage of the locality properties inherent to solutions to elliptic PDEs. Communication costs
SCALLOP: A Terascale Poisson Solver in Three Dimensions
, 2003
"... SCALLOP is a scalable solver and library for elliptic partial dierential equations on regular blockstructured domains. SCALLOP hides the latency of communication algorithmically by taking advantage of the locality properties of the solution. Communication costs are small, on the order of a few perce ..."
Abstract
 Add to MetaCart
SCALLOP is a scalable solver and library for elliptic partial dierential equations on regular blockstructured domains. SCALLOP hides the latency of communication algorithmically by taking advantage of the locality properties of the solution. Communication costs are small, on the order of a few
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
The Anatomy of the Grid  Enabling Scalable Virtual Organizations
 International Journal of Supercomputer Applications
, 2001
"... "Grid" computing has emerged as an important new field, distinguished from conventional distributed computing by its focus on largescale resource sharing, innovative applications, and, in some cases, highperformance orientation. In this article, we define this new field. First, we review ..."
Abstract

Cited by 2638 (87 self)
 Add to MetaCart
"Grid" computing has emerged as an important new field, distinguished from conventional distributed computing by its focus on largescale resource sharing, innovative applications, and, in some cases, highperformance orientation. In this article, we define this new field. First, 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
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
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
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
Pastry: Scalable, distributed object location and routing for largescale peertopeer systems
, 2001
"... This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for widearea peertopeer applications. Pastry provides applicationlevel routing and object location in a potentially very large overlay network of nodes connected via the Internet. ..."
Abstract

Cited by 2063 (50 self)
 Add to MetaCart
This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for widearea peertopeer applications. Pastry provides applicationlevel routing and object location in a potentially very large overlay network of nodes connected via the Internet
UNet: A UserLevel Network Interface for Parallel and Distributed Computing
 In Fifteenth ACM Symposium on Operating System Principles
, 1995
"... The UNet communication architecture provides processes with a virtual view of a network interface to enable userlevel access to highspeed communication devices. The architecture, implemented on standard workstations using offtheshelf ATM communication hardware, removes the kernel from the communi ..."
Abstract

Cited by 596 (17 self)
 Add to MetaCart
The UNet communication architecture provides processes with a virtual view of a network interface to enable userlevel access to highspeed communication devices. The architecture, implemented on standard workstations using offtheshelf ATM communication hardware, removes the kernel from
GloMoSim: A Library for Parallel Simulation of Largescale Wireless Networks
 in Workshop on Parallel and Distributed Simulation
, 1998
"... A number of librarybased parallel and sequential network simulators have been designed. This paper describes a library, called GloMoSim (for Global Mobile system Simulator), for parallel simulation of wireless networks. GloMoSim has been designed to be extensible and composable: the communication p ..."
Abstract

Cited by 645 (30 self)
 Add to MetaCart
A number of librarybased parallel and sequential network simulators have been designed. This paper describes a library, called GloMoSim (for Global Mobile system Simulator), for parallel simulation of wireless networks. GloMoSim has been designed to be extensible and composable: the communication
Estimating the Support of a HighDimensional Distribution
, 1999
"... Suppose you are given some dataset drawn from an underlying probability distribution P and you want to estimate a "simple" subset S of input space such that the probability that a test point drawn from P lies outside of S is bounded by some a priori specified between 0 and 1. We propo ..."
Abstract

Cited by 766 (29 self)
 Add to MetaCart
Suppose you are given some dataset drawn from an underlying probability distribution P and you want to estimate a "simple" subset S of input space such that the probability that a test point drawn from P lies outside of S is bounded by some a priori specified between 0 and 1. We
Results 1  10
of
157,653