Hypercube Multiprocessors, 1987: Proceedings of the Second Conference on Hypercube Multiprocessors, Knoxville, Tennessee, September 29-October 1, 1986Michael T. Heath SIAM, 1987. gada 1. janv. - 761 lappuses Proceedings -- Parallel Computing. |
Saturs
David W Walker Concurrent Computation Project California Institute of Technology Pasadena | 3 |
Alison A Brown Cornell Theory Center Cornell University Ithaca New York 14853 | 5 |
x | 10 |
Kevin Gates Department of Applied Mathematics University of Washington Seattle Washington | 17 |
A Cellular Automata Interface to Hypercube Multiprocessors | 28 |
VeryHighLevel Parallel Programming in Crystal | 39 |
A Hypercube Implementation of Flat Concurrent Prolog | 48 |
Distributed Data Structures for Scientific Computation 55 | 55 |
Implementing BestFirst BranchandBound Algorithms on Hypercube | 318 |
Genetic Algorithms on a Hypercube Multiprocessor | 333 |
The Caltech Concurrent Computation Program | 353 |
Hypercube Applications at Oak Ridge National Laboratory | 395 |
Some Graph and ImageProcessing Algorithms for the Hypercube | 418 |
Parallel Implementation of an Algorithm for ThreeDimensional Reconstruction of | 438 |
Monte Carlo Photon Transport on the NCUBE | 454 |
Density Functional Theory and Parallel Processing | 473 |
CommunicationEfficient Distributed Data Structures on Hypercube Machines | 67 |
A Fast MessageBased Tagless Marking | 78 |
A R Larrabee Department of Computer Science and Engineering Oregon Graduate Center | 85 |
A High Performance Operating System for the NCUBE | 90 |
Christopher J Catherasoo AMETEK Computer Research Division Arcadia California 91006 | 100 |
Williams Concurrent Processor Systems Group Jet Propulsion Laboratory Pasadena | 108 |
Embedding of Interacting Task Modules into a Hypercube | 122 |
N Bauman Department of Computer and Information Science Ohio State University Columbus | 141 |
S Y Lee Computer and Vision Research Center College of Engineering University of Texas | 151 |
Hypercube Software Performance Metrics 155 15 | 155 |
Adam Beguelin Computer Science Department University of Colorado at Boulder Boulder | 162 |
Grunwald Department of Computer Science University of Illinois at Urbana Urbana | 169 |
A Cisneros California Institute of Technology Pasadena California 91125 | 193 |
A Comparison of the Performance of the Caltech Mark II Hypercube and the Elxsi | 210 |
ChingTien Ho Department of Computer Science Yale University New Haven Connecticut 06520 | 223 |
Switching between Interrupt Driven and Polled Communication Systems on a | 239 |
Doug Poland Department of Nuclear Engineering University of Michigan Ann Arbor Michigan | 251 |
Incomplete Hypercubes | 258 |
Tait Cyrus Department of Electrical and Computer Engineering University of New Mexico Albu | 271 |
F Ipsen Department of Computer Science Yale University New Haven Connecticut 06520 | 285 |
Multiprocessor Algorithms to Schedule Jobs | 300 |
Elizabeth R Jessup Department of Computer Science Yale University New Haven Connecticut | 309 |
An Implementation of a 24Section Root Finding Method for the FPS TSeries | 495 |
Implementation of Two Control System Design Algorithms on a MessagePassing | 512 |
Performance of the OneDimensional Fast Fourier Transform on the Hypercube | 530 |
The Parallel Solution of Triangular Systems on a Hypercube | 552 |
An Alternative View of LU Factorization with Partial Pivoting on a Hypercube | 569 |
Maurice W Benson Department of Mathematical Sciences Lakehead University Thunder Bay | 576 |
Somesh Jha Department of Electrical Engineering Pennsylvania State University University Park | 587 |
On Using the Jacobi Method on the Hypercube | 605 |
G J Davis Department of Mathematics and Computer Science Georgia State University Atlanta | 619 |
| 626 | |
S Lennart Johnsson Department of Computer Science Yale University New Haven Connecticut | 627 |
A Divide and Conquer Algorithm for the Unitary Eigenproblem | 639 |
J R Einstein Center for Engineering Systems Advanced Research Oak Ridge National Labora | 656 |
Donna Bergmark Department of Computer Services Cornell University Ithaca New York 14853 | 662 |
Fox Concurrent Computation Program California Institute of Technology Pasadena | 674 |
The SSOR Preconditioned Conjugate Gradient on a Hypercube | 692 |
Numerical Computation on Massively Parallel Hypercubes | 706 |
Shlomo Taasan Institute for Computer Application in Science and Engineering NASA Langley | 720 |
Hypercube Implementation of DomainDecomposed Fast Poisson Solvers | 738 |
The Vortex Method on a Hypercube Concurrent Processor | 756 |
Citi izdevumi - Skatīt visu
Bieži izmantoti vārdi un frāzes
Ametek application architecture assigned benchmarks binary bitonic sort branch-and-bound broadcast buffer bytes calculation Caltech channel column communication compiler complete Computer Science concurrent Cosmic Cube cost CUBIX data structures decomposition defined described developed dimension distributed dynamic efficient eigenvalues entries environment equations evaluation execution Figure finite element floating point Fortran function given global graph Gray code grid hardware host hypercube Hypercube Multiprocessors IEEE implementation input Intel iPSC iteration linear load balancing machine mapping matrix megaflops message passing method multiprocessor Ncube neighbor node_id number of nodes number of processors operating system optimal overhead parallel algorithms parallel computer Parallel Processing partitioning performance phase Poker problem processors protocol queue quicksort R-tree receive scheme sequence sequential serial shared memory simulation solution solving speed speedup step subcube subproblem synchronization T-Series task techniques tion tree tuple values variable vector Vertex
Populāri fragmenti
x. lappuse - Laboratory Department of Electrical Engineering and Computer Science University of Michigan, Ann Arbor, Michigan 48109 ABSTRACT In this paper, we present a novel sequence generator based on a Markov chain model.
viii. lappuse - Advanced Computer Architecture Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor, MI 48109-2122 Abstract We present design for balance testability (DFBT), a systematic signature-based method for enhancing the testability of logic circuits.