Filters








89,378 Hits in 4.1 sec

The parallelization of a highway traffic flow simulation

C.M. Johnston, A.T. Chronopoulos
1999 Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation  
Tests with real traffic data collected from the freeway network in the metropolitan area of Minneapolis, MN were used to validate the accuracy and computation rate of the parallel simulation system.  ...  A traffic-flow simulation was developed and mapped onto a parallel computer architecture.  ...  This system could be used as a component of a real-time simulation system. This parallel system was implemented on the Cray T3E parallel computer.  ... 
doi:10.1109/fmpc.1999.750600 fatcat:vfyajunprnefblzmtdi4yu3ili

A data-parallel algorithm for iterative tomographic image reconstruction

C.A. Johnson, A. Sofer
1999 Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation  
Although numerous iterative methods have been proposed over the years, all of these methods can be shown to have a similar computational structure.  ...  Our parallelization scheme is based upon decomposition of the measurement-space vectors.  ...  Acknowledgments The computational work in this paper was performed on the IBM RS/6000 SP2 parallel computer at the Division of Computer Research and Technology, National Institutes of Health.  ... 
doi:10.1109/fmpc.1999.750592 fatcat:fh62lumuyfganp73plfnr6tdaq

Parallel rendering of 3D AMR data on the SGI/Cray T3E

Kwan-Liu Ma
1999 Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation  
In this work, we compare the performance and storage requirements of a parallel volume renderer for regular-mesh data with a new parallel renderer based on adaptive sampling.  ...  of local data items Disk Display  ...  The experiments described here were performed on the computer systems provided by NASA's HPCCP/CAS Project.  ... 
doi:10.1109/fmpc.1999.750593 fatcat:rbyx4kwirzftplfhdrhbk57nge

Neighborhood Parallel Simulated Annealing [chapter]

Keiko Ando, Mitsunori Miki, Tomoyuki Hiroyasu
2007 Frontiers of Computational Science  
Two, three, and five dimensions of these functions are used as test functions. The parameters are indicated in Table 1 . The number of both cooling cycles and parallel processors were set to 32.  ...  Parallel processing is performed. 2. A different neighborhood is assigned during in each process. 3. SA is excecuted in parallel in each processor. 4.  ... 
doi:10.1007/978-3-540-46375-7_21 fatcat:wl4flga4rncfhjujrsq5vvkvyq

The new landscape of parallel computer architecture

Shalf John
2008 Frontiers in Neuroinformatics  
The results of the discussions are documented in the University of California Berkeley Technical Report entitled "The Landscape of Parallel Computing Research: A View from Berkeley" [1] .  ...  The past few years has seen a sea change in computer architecture that will impact every facet of our society as every electronic device from cell phone to supercomputer will need to confront parallelism  ...  parallelism of unprecedented scale.  ... 
doi:10.3389/conf.neuro.11.2008.01.151 fatcat:mchfxavzv5gcxdsyrg2idnbjmm

Optimization of BWB Aircraft Using Parallel Computing

2018 Supercomputing Frontiers and Innovations  
An automatic structural computational mesh creation is realized for the effective optimization algorithm working.  ...  The optimization procedure is based on numerical calculations of the Reynolds-averaged Navier-Stokes equations.  ...  This paper is distributed under the terms of the Creative Commons Attribution-Non Commercial 3.0 License which permits non-commercial use, reproduction and distribution of the work without further permission  ... 
doi:10.14529/jsfi180317 fatcat:lwbzku3ixjbv7hnylmbtfcjqou

A perspective on the future of massively parallel computing

Predrag T. Tosic
2004 Proceedings of the first conference on computing frontiers on Computing frontiers - CF'04  
A great variety of parallel computation models has been proposed and studied, and different parallel and distributed architectures designed as some possible ways of harnessing parallelism and improving  ...  Models, architectures and languages for parallel computation have been of utmost research interest in computer science and engineering for several decades.  ...  Acknowledgments The author is greatly indebted to Gul Agha, Tom Anastasio, Alfred Hubler and Sylvian Ray, all at University of Illinois.  ... 
doi:10.1145/977091.977160 dblp:conf/cf/Tosic04 fatcat:5jhbmelpzndxno4447xbzs6sk4

Parallel algorithms on the rotation-exchange network-a trivalent variant of the star graph

Chi-Hsiang Yeh, E.A. Varvarigos
1999 Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation  
We also show that the performance of RE networks can be significantly improved for a variety of applications if the transmission rate of on-chip links is considerably higher than that of off-chip links  ...  Since the diameter of a k-RE network is Θk 2 , it is straightforward to show that the required number of steps Ok + 2!  ...  to be a promising approach for the construction of future massively parallel computers.  ... 
doi:10.1109/fmpc.1999.750613 fatcat:fyackuie2vebfhc7isphwvepya

Analysis of 100 Mb/s Ethernet for the Whitney commodity computing testbed

S.A. Fineberg, K.T. Pedretti
1999 Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation  
The hub/switch combination tests indicate that the NAS parallel benchmarks are relatively insensitive to hub densities of less than 7 nodes per hub.  ...  We evaluate the performance of a Fast Ethernet network configured with a single large switch, a single hub, and a 4x4 2D torus topology in a testbed cluster of "commodity" Pentium Pro PCs.  ...  Combining a large number of systems into a high performance parallel computer requires the careful selection of both network technology and topology.  ... 
doi:10.1109/fmpc.1999.750610 fatcat:z3umeqwhzvfhticn2b5ewzor6y

Parallel Computing of Local Mesh Finite Element Method [chapter]

G. Yagawa
2001 Computational Mechanics–New Frontiers for the New Millennium  
As a numerical example of parallel computing with the FMM, large-scale cavity problem of incompressible flow is computed.  ...  In this computation, the parallel efficiency of more than 90% is achieved on time integration process, using a 101,381 DOF model and nine Alpha PCs.  ...  Parallelization The parallel computing of the problem described above is summarized here.  ... 
doi:10.1016/b978-0-08-043981-5.50008-0 fatcat:hxgd7lklbnaa3asffxonfwdvte

Parallel Quantum Computation of Vibrational Dynamics

Ksenia Komarova, Hugo Gattuso, R. D. Levine, F. Remacle
2020 Frontiers in Physics  
A realistic assessment of the inherent noise due to the inevitable size dispersion of colloidal quantum dots is taken into account and limits the time available for computation.  ...  The vibrational dynamics in a linear triatomic molecule is emulated by a quantum information processing device operating in parallel.  ...  We show how the read-out of the coherences engineered in the device following interaction with a sequence of the laser pulses enables parallel computation of the two conjugated variables, mean position  ... 
doi:10.3389/fphy.2020.590699 fatcat:7jembzi3brhdpcd4jsugjqeug4

Editor's Note: Special Issue on Computing Frontiers

2016 International journal of parallel programming  
Childers • Scaling Properties of Parallel Applications to Exascale, Giovanni Mariani, by Andreea Anghel, Rik Jongerius, Gero Dittmann • Exploring the Design Space of an Energy-Efficient Accelerator for  ...  Computations for Energy-Constrained Approximate Computing, Vassilis Vassiliadis, Charalampos Chalios, Konstantinos Parasyris, Christos D.  ... 
doi:10.1007/s10766-016-0446-1 fatcat:pv2xrke4sbharpgjt4ou6jtqn4

Guest Editorial: Computing Frontiers

Calin Cascaval, Pedro Trancoso, Viktor Prasanna
2013 International journal of parallel programming  
In "Efficient Stack Distance Computation for a Class of Priority Replacement Policies," Gianfranco Bilardi, Kattamuri Ekanadham, and Pratap Pattnaik present a comprehensive analysis and a new class of  ...  The authors evaluate the Min-Tree algorithm that achieves significantly better performance than the traditional Linear Scan algorithm and is amenable to parallelization.  ... 
doi:10.1007/s10766-013-0240-2 fatcat:5i72w7hmwfgatnooad3l255cvy

Efficient VLSI layouts of hypercubic networks

Chi-Hsiang Yeh, E.A. Varvarigos, B. Parhami
1999 Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation  
within a factor of 1:7 + o1.  ...  We introduce the multilayer grid model, and present efficient layouts of hypercubes that use more than 2 layers of wires.  ...  space and perform infinitely many computation steps if required.  ... 
doi:10.1109/fmpc.1999.750589 fatcat:j5bnhjac7jer7lfb2ub7bkbcba

New algorithms for efficient mining of association rules

Li Shen, Hong Shen, Ling Cheng
1999 Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation  
We observe that the parallelism in our parallel approach is developed more su ciently than in two of the best existing parallel algorithms.  ...  But they contains weaknesses such as often requiring high pre-processing cost to get a vertical database layout, containing much redundant computation in parallel cases, and so on.  ...  Parallelization Since mining frequent itemsets requires lots of computation power, memory and disk I O, it is not only interesting but also necessary to develop parallel algorithms for this data mining  ... 
doi:10.1109/fmpc.1999.750605 fatcat:l4yrl3wdxfcqbpyybmhxkm3sru
« Previous Showing results 1 — 15 out of 89,378 results