Results 1  10
of
214,671
approaches to the classical NBody Problem: the BarnesHut
"... feasible implementation of these algorithms. The execution codes have been written in NESL, a parallel programming language developed at Carnegie Mellon University, and extensive experiments have been run on them. The goal of this project is to compare these three algorithms in terms of both the com ..."
Abstract
 Add to MetaCart
feasible implementation of these algorithms. The execution codes have been written in NESL, a parallel programming language developed at Carnegie Mellon University, and extensive experiments have been run on them. The goal of this project is to compare these three algorithms in terms of both
ABSTRACT ObjectOriented Parallel BarnesHut
, 2002
"... The naïve (NV) implementation of the nbody problem runs in O(n2) where all particle interactions are computed, while the BarnesHut (BH) algorithm runs on average O(n log n) floating point operations for a given accuracy and fixed distribution of particles. For an rms error of 103, BH takes close ..."
Abstract
 Add to MetaCart
The naïve (NV) implementation of the nbody problem runs in O(n2) where all particle interactions are computed, while the BarnesHut (BH) algorithm runs on average O(n log n) floating point operations for a given accuracy and fixed distribution of particles. For an rms error of 103, BH takes close
the BarnesHut tree code PEPC using PFASST, the Parallel Full
"... Approximation Scheme in Space and Time. The naive use of increasingly more processors for a fixedsize Nbody problem is prone to saturate as soon as the number of unknowns per core becomes too small. To overcome this intrinsic strongscaling limit, we introduce temporal parallelism on top of PEPC’s ..."
Abstract
 Add to MetaCart
’s existing hybrid MPI/PThreads spatial decomposition. Here, we use PFASST which is based on a combination of the iterations of the parallelintime algorithm parareal with the sweeps of spectral deferred correction (SDC) schemes. By combining these sweeps with multiple spacetime discretization
Scalable Parallel Formulations of the BarnesHut Method for nBody Simulations
 IN PROCEEDINGS OF SUPERCOMPUTING '94
, 1994
"... In this paper, we present two new parallel formulations of the BarnesHut method. These parallel formulations are especially suited for simulations with irregular particle densities. We first present a parallel formulation that uses a static partitioning of the domain and assignment of subdomains to ..."
Abstract

Cited by 46 (7 self)
 Add to MetaCart
on Morton ordering. This alleviates the load imbalance inherent in the first scheme. The second parallel formulation is inspired by two currently best known parallel algorithms for the BarnesHut method. We present an experimental evaluation of these schemes on a 256 processor nCUBE2 parallel computer
A CellCell BarnesHut Algorithm for Fast Particle Simulation
"... We describe two new algorithms for Nbody simulation which are generalisations of the BarnesHut algorithm capable of modelling interactions between the internal nodes of the octtree data structure representing a 3dimensional space of particles. The two algorithms, Cell Propagation and Mass Pa ..."
Abstract
 Add to MetaCart
We describe two new algorithms for Nbody simulation which are generalisations of the BarnesHut algorithm capable of modelling interactions between the internal nodes of the octtree data structure representing a 3dimensional space of particles. The two algorithms, Cell Propagation and Mass
Understanding Code Mobility
 IEEE COMPUTER SCIENCE PRESS
, 1998
"... The technologies, architectures, and methodologies traditionally used to develop distributed applications exhibit a variety of limitations and drawbacks when applied to large scale distributed settings (e.g., the Internet). In particular, they fail in providing the desired degree of configurability, ..."
Abstract

Cited by 549 (34 self)
 Add to MetaCart
, scalability, and customizability. To address these issues, researchers are investigating a variety of innovative approaches. The most promising and intriguing ones are those based on the ability of moving code across the nodes of a network, exploiting the notion of mobile code. As an emerging research field
Solving multiclass learning problems via errorcorrecting output codes
 JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
, 1995
"... Multiclass learning problems involve nding a de nition for an unknown function f(x) whose range is a discrete set containing k>2values (i.e., k \classes"). The de nition is acquired by studying collections of training examples of the form hx i;f(x i)i. Existing approaches to multiclass l ..."
Abstract

Cited by 730 (8 self)
 Add to MetaCart
learning problems include direct application of multiclass algorithms such as the decisiontree algorithms C4.5 and CART, application of binary concept learning algorithms to learn individual binary functions for each of the k classes, and application of binary concept learning algorithms with distributed
Network Coding for Large Scale Content Distribution
"... We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate and transmit encoded blocks of information. The randomization introduced by the coding process eases the scheduling of bloc ..."
Abstract

Cited by 497 (6 self)
 Add to MetaCart
riding are in place. We demonstrate through simulations of scenarios of practical interest that the expected file download time improves by more than 2030 % with network coding compared to coding at the server only and, by more than 23 times compared to sending unencoded information. Moreover, we show that network
An Efficient Boosting Algorithm for Combining Preferences
, 1999
"... The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new boosting ..."
Abstract

Cited by 707 (18 self)
 Add to MetaCart
The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new
Results 1  10
of
214,671