Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Leonardo Dagum

dblp:12/1928 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
0since 2021 · last 1993
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 7 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
5 papers
Performance modeling and evaluation · 60% High-performance computing · 37% Distributed systems · 3%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
benchmarking
0.021992
NAS Parallel Benchmark Results · SC 1992
The NAS parallel benchmarks - summary and preliminary results · SC 1991
Performance modeling and evaluation › benchmarking › parallel benchmark suites
NAS parallel benchmarks
0.021992
NAS Parallel Benchmark Results · SC 1992
The NAS parallel benchmarks - summary and preliminary results · SC 1991
Performance modeling and evaluation › benchmarking
parallel benchmark suites
0.021992
NAS Parallel Benchmark Results · SC 1992
The NAS parallel benchmarks - summary and preliminary results · SC 1991
High-performance computing
scientific computing systems
0.021993
Automatic partitioning of unstructured grids into connected components · SC 1993
Implementation of a hypersonic rarefied flow particle simulation on the connection machine · SC 1989
Graph algorithms and graph theory
graph partitioning
0.011993
Automatic partitioning of unstructured grids into connected components · SC 1993
High-performance computing
particle simulation
0.011992
Particle Simulation on Heterogeneous Distributed Supercomputers · HPDC 1992
Performance modeling and evaluation › simulation › parallel and distributed simulation
parallel simulation
0.011989
Implementation of a hypersonic rarefied flow particle simulation on the connection machine · SC 1989
High-performance computing › supercomputing
supercomputer performance evaluation
0.021992
NAS Parallel Benchmark Results · SC 1992
The NAS parallel benchmarks - summary and preliminary results · SC 1991
High-performance computing
domain decomposition
0.011993
Automatic partitioning of unstructured grids into connected components · SC 1993
Distributed systems › distributed management
distributed application deployment
0.011992
Particle Simulation on Heterogeneous Distributed Supercomputers · HPDC 1992
YearPublicationVenuePosition
1993 Automatic partitioning of unstructured grids into connected components
abstract
This paper presents two partitioning schemes that guarantee connected components given a connected initial grid.Connected components are import ant for convergence of methods such as domain decomposition or mrdtigrid.For many of the grids tested, the schemes produce partitions as good (in terms of n umber of cut edges) or better than spectral partitioning and require only modest computational resources.This paper describes the two schemes in detail and presents comparison results from a number of t wo and three dimensional unstructured grids.
Leonardo Dagum
SC1
1993 Particle simulation on heterogeneous distributed supercomputers
abstract
Abstract We describe the implementation and performance of a three dimensional particle simulation distributed between a Thinking Machines CM‐2 and a Cray Y‐MP. These are connected by a combination of two high‐speed networks: a high‐performance parallel Interface (HIPPI) and an optical network (UltraNct). This is the first application to use this configuration at NASA Ames Research Center. We describe our experience Implementing and using the application and report the results of several timing measurements. We show that the distribution of applications across disparate supcrcomputing platforms Is feasible and has reasonable performance. In addition, several practical aspects of the computing environment arc discussed.
Jeffrey C. Becker, Leonardo Dagum
Concurr. Pract. Exp.2
1992 Particle Simulation on Heterogeneous Distributed Supercomputers
abstract
The authors describe the implementation and performance of a three dimensional particle simulation distributed between a Thinking Machines CM-2 and a Cray Y-MP. These are connected by a combination of two high-speed networks; a high performance parallel interface (HIPPI) and an optical network (Ultra Net). This is the first application to use this configuration at NASA Ames Research Center. The authors describe their experience implementing and using the application and report the results of several timing measurements. They show that the distribution of applications across disparate supercomputing platforms is feasible and has reasonable performance. In addition, several practical aspects of the computing environment are discussed. >
Jeffrey C. Becker, Leonardo Dagum
HPDC2
1992 NAS Parallel Benchmark Results
abstract
The NAS (Numerical Aerodynamic Simulation) parallel benchmarks have been developed at NASA Ames Research Center to study the performance of parallel supercomputer. The eight benchmark problems are specified in a 'pencil and paper' fashion. The performance results of various systems using the NAS parallel benchmarks are presented. These results represent the best results that have been reported to the authors for the specific systems listed. They represent implementation efforts performed by personnel in both the NAS Applied Research Branch of NASA Ames Research Center and in other organizations.>
David H. Bailey, Leonardo Dagum, Eric Barszcz, Horst D. Simon
SC2
1992 Data parallel sorting for particle simulation
abstract
Abstract Sorting on a parallel architecture is a communications intensive event which can incur a high penalty in applications where it is required. In the case of particle simulation, only integer sorting is necessary, and sequential implementations easily attain the minimum performance bound of O(N) for N particles. Parallel implementations, however, have to cope with the parallel sorting problem which, in addition to incurring a heavy communications cost, can make the minimum performance bound difficult to attain. This paper demonstrates how the sorting problem in a particle simulation can be reduced to a merging problem, and describes an efficient data parallel algorithm to solve this merging problem in a particle simulation. The new algorithm is shown to be optimal under conditions usual for particle simulation, and its fieldwise implementation on the Connection Machine is analysed in detail. The new algorithm is about four times faster than a fieldwise implementation of radix sort on the Connection Machine.
Leonardo Dagum
Concurr. Pract. Exp.1
1991 The NAS parallel benchmarks - summary and preliminary results
abstract
Article Free Access Share on The NAS parallel benchmarks—summary and preliminary results Authors: D. H. Bailey Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CA Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CAView Profile , E. Barszcz Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CA Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CAView Profile , J. T. Barton Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CA Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CAView Profile , D. S. Browning Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CA Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CAView Profile , R. L. Carter Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CA Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CAView Profile , L. Dagum Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CA Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CAView Profile , R. A. Fatoohi Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CA Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CAView Profile , P. O. Frederickson Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CA Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CAView Profile , T. A. Lasinski Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CA Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CAView Profile , R. S. Schreiber Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CA Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CAView Profile , H. D. Simon Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CA Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CAView Profile , V. Venkatakrishnan Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CA Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CAView Profile , S. K. Weeratunga Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CA Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CAView Profile Authors Info & Claims Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on SupercomputingAugust 1991 Pages 158–165https://doi.org/10.1145/125826.125925Published:01 August 1991Publication History 405citation1,162DownloadsMetricsTotal Citations405Total Downloads1,162Last 12 Months161Last 6 weeks25 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
David H. Bailey, Eric Barszcz, John T. Barton, D. S. Browning, Robert L. Carter, Leonardo Dagum, Rod A. Fatoohi, Paul O. Frederickson, T. A. Lasinski, Robert Schreiber, Horst D. Simon, V. Venkatakrishnan, Sisira Weeratunga
SC6
1989 Implementation of a hypersonic rarefied flow particle simulation on the connection machine
abstract
A very efficient direct particle simulation algorithm for hypersonic rarefied flows is presented and its implementation on a Connection Machine is described. The implementation is capable of simulating up to 4 x 106 hard sphere diatomic molecules using 64k processors with a performance better than that of a similar, fully vectorized implementation using a single processor of the Cray 2. Results from flow calculations are presented to demonstrate both the validity of the implementation and the range afforded by the method in solving hypersonic rarefied flow problems. Finally, a breakdown of the calculation time is given to identify a bottleneck which must be resolved for further improvement in performance.
Leonardo Dagum
SC1