Results 11  20
of
6,856
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 762 (27 self)
 Add to MetaCart
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
Fast Folding and Comparison of RNA Secondary Structures (The Vienna RNA Package)
"... Computer codes for computation and comparison of RNA secondary structures, the Vienna RNA package, are presented, that are based on dynamic programming algorithms and aim at predictions of structures with minimum free energies as well as at computations of the equilibrium partition functions and bas ..."
Abstract

Cited by 809 (117 self)
 Add to MetaCart
implementations of modified algorithms on parallel computers with distributed memory. Performance analysis carried out on an Intel Hypercube shows that parallel computing becomes gradually more and more efficient the longer the sequences are.
Directed Diffusion for Wireless Sensor Networking
 IEEE/ACM Transactions on Networking
, 2003
"... Advances in processor, memory and radio technology will enable small and cheap nodes capable of sensing, communication and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. In this paper, we explore the directed diffusion paradigm for such ..."
Abstract

Cited by 675 (9 self)
 Add to MetaCart
Advances in processor, memory and radio technology will enable small and cheap nodes capable of sensing, communication and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. In this paper, we explore the directed diffusion paradigm
Random Key Predistribution Schemes for Sensor Networks”,
 IEEE Symposium on Security and Privacy,
, 2003
"... Abstract Efficient key distribution is the basis for providing secure communication, a necessary requirement for many emerging sensor network applications. Many applications require authentic and secret communication among neighboring sensor nodes. However, establishing keys for secure communicatio ..."
Abstract

Cited by 832 (12 self)
 Add to MetaCart
keys for all pairs of nodes is not viable due to the large number of sensors and the limited memory of sensor nodes. A new key distribution approach was proposed by Eschenauer and Gligor [11] to achieve secrecy for nodetonode communication: sensor nodes receive a random subset of keys from a key pool
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 653 (7 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
Utilising MIMD Parallelism in Modular Visualisation Environments.
 Proceedings of Eurographics UK `92
, 1992
"... Modular Visualisation Environments such as apE [1, 2, 3, 4] or Explorer [6, 7] are increasingly being used in the visualisation community. Such systems can already place compute intensive modules on supercomputers in order to utilise their power. This paper describes the problems that arise in u ..."
Abstract
 Add to MetaCart
in utilising distributed memory MIMD computers within this environment. The work presented here is driven by two goals, namely efficient use of the MIMD resource and ease of use by both programmer and end user. To achieve the first objective we consider the problems of synchronisation, data mapping
From Simd To Distributed Memory Mimd
"... his paper presents a technique that may be used to transform SIMD shared memory parallel s algorithms to MIMD distributed memory algorithms. This technique formulates a sequence of teps to help alter the the global view required of the programmer for SIMD processing to the  d more local one necessa ..."
Abstract
 Add to MetaCart
his paper presents a technique that may be used to transform SIMD shared memory parallel s algorithms to MIMD distributed memory algorithms. This technique formulates a sequence of teps to help alter the the global view required of the programmer for SIMD processing to the  d more local one
A Fully Parallel Condensation Method for Generalized Eigenvalue Problems on Distributed Memory Computers
 Parallel Computing
"... For largescale eigenvalue problems the authors introduced in [16] a coarse grained parallel algorithm for distributed memory computers based on substructuring and improved static condensation. It was observed that the load balancing may become unsatisfactory if the master problem and the problems c ..."
Abstract

Cited by 10 (9 self)
 Add to MetaCart
corresponding to the substructures are of significantly different size. In this paper we improve the load balancing of the processors considerably by incorporating a parallel eigensolver for dense problems. Keywords. eigenvalue problem, parallel algorithm, distributed memory MIMD computers, condensation
Partitioning of Unstructured Problems for Parallel Processing
, 1991
"... Many large scale computational problems are based on unstructured computational domains. Primary examples are unstructured grid calculations based on finite volume methods in computational fluid dynamics, or structural analysis problems based on finite element approximations. Here we will address th ..."
Abstract

Cited by 344 (16 self)
 Add to MetaCart
the question of how to distribute such unstructured computational domains over a large number of processors in a MIMD machine with distributed memory. A graph theoretical framework for these problems will be established. Based on this framework three decomposition algorithms will be introduced. In particular
Repartition dynamique de donnees regulieres pour des machines MIMD homogenes a memoire distribuee
"... . This paper reports a simple strategy for dynamically load balancing of regular data on homogeneous Distributed Memory MIMD computers with static interconnexion network. That is data in which each unit can be processed independently and requires the same time on each processor. This strategy is bas ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. This paper reports a simple strategy for dynamically load balancing of regular data on homogeneous Distributed Memory MIMD computers with static interconnexion network. That is data in which each unit can be processed independently and requires the same time on each processor. This strategy
Results 11  20
of
6,856