Robert Cypher

Proceedings of the 11th IEEE International On-Line Testing Symposium (IOLTS 2005), 2005

2000

On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks.

[BibT_eX]

[DOI]

Ambrose Kofi Laing

Christian A. Duncan

Theory Comput. Syst., 2000

1998

Deadlock-Free Routing in Arbitrary Networks via the Flattest Common Supersequence Method.

[BibT_eX]

[DOI]

Ambrose Kofi Laing

Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

1997

Fault-Tolerant Meshes with Small Degree.

[BibT_eX]

[DOI]

SIAM J. Comput., 1997

Gracefully Degradable Pipeline Networks.

[BibT_eX]

[DOI]

Ambrose Kofi Laing

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

1996

A quantitative study of parallel scientific applications with explicit communication.

[BibT_eX]

[DOI]

Alex Ho

Paul Messina

J. Supercomput., 1996

Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers.

[BibT_eX]

[DOI]

SIAM J. Comput., 1996

Universal Algorithms for Store-and-Forward and Wormhole Routing.

[BibT_eX]

[DOI]

Friedhelm Meyer auf der Heide

Christian Scheideler

Berthold Vöcking

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995

CCL: A Portable and Tunable Collective Communication Library for Scalable Parallel Computers.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1995

Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hypercubes.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1995

On the Construction of Fault-Tolerant Cube-Connected Cycles Networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1995

Efficient race detection for message-passing programs with nonblocking sends and receives.

[BibT_eX]

[DOI]

Eric Leu

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

Minimal, deadlock-free routing in hypercubic and arbitrary networks.

[BibT_eX]

[DOI]

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

The Communication Requirements of Mutual Exclusion.

[BibT_eX]

[DOI]

Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995

1994

Fault-Tolerant de Bruijn and Shuffle-Exchange Networks.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1994

Tolerating Faults in a Mesh with a Row of Spare Nodes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Storage-Efficient, Deadlock-Free Packet Routing Algorithms for Torus Networks.

[BibT_eX]

[DOI]

Luis Gravano

IEEE Trans. Computers, 1994

Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1994

Requirements for Deadlock-Free, Adaptive Packet Routing.

[BibT_eX]

[DOI]

Luis Gravano

SIAM J. Comput., 1994

The IBM External User Interface for Scalable Parallel Systems.

[BibT_eX]

[DOI]

Parallel Comput., 1994

Repeatable and Portable Message-Passing Programs.

[BibT_eX]

[DOI]

Eric Leu

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

The Semantics of Blocking and Nonblocking Send and Receive Primitives.

[BibT_eX]

[DOI]

Eric Leu

Proceedings of the 8th International Symposium on Parallel Processing, 1994

The SIMD Model of parallel computation.

[BibT_eX]

Springer, ISBN: 978-0-387-94139-4, 1994

1993

Generalized trace-back techniques for survivor memory management in the Viterbi algorithm.

[BibT_eX]

[DOI]

C. Bernard Shung

J. VLSI Signal Process., 1993

Area-efficient architectures for the Viterbi algorithm II. Applications.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1993

Area-efficient architectures for the Viterbi algorithm. I. Theory.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1993

Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1993

Theoretical Aspects of VLSI Pin Limitations.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

A Lower Bound on the Size of Shellsort Sorting Networks.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers.

[BibT_eX]

[DOI]

C. Greg Plaxton

J. Comput. Syst. Sci., 1993

Architectural Requirements of Parallel Scientific Applications with Explicit Communication.

[BibT_eX]

[DOI]

Alex Ho

Paul Messina

Proceedings of the 20th Annual International Symposium on Computer Architecture, 1993

Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hybercubes.

[BibT_eX]

[DOI]

Proceedings of the Digest of Papers: FTCS-23, 1993

1992

Tolerating Faults in Hypercubes Using Subcube Partitioning.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1992

Cubesort: A Parallel Algorithm for Sorting N Data Items with S-Sorters.

[BibT_eX]

[DOI]

J. Algorithms, 1992

Data Reduction and Fast Routing: A Strategy for Efficient Algorithms for Message-Passing Parallel Computers.

[BibT_eX]

[DOI]

Algorithmica, 1992

Fault-Tolerant Embeddings of Rings, Meshes, and Tori in Hypercubes.

[BibT_eX]

[DOI]

Alexander Wang

Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

Hierarchical Shuffle-Exchange and de Bruijn Networks.

[BibT_eX]

[DOI]

Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

Multiple Message Broadcasting wiht Generalized Fibonacci Trees.

[BibT_eX]

[DOI]

Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

Adaptive, Deadlock-Free Packet Routing in Torus Networks with Minimal Storage.

[BibT_eX]

Luis Gravano

Proceedings of the 1992 International Conference on Parallel Processing, 1992

Efficient Fault-Tolerant Mesh and Hypercube Architectures.

[BibT_eX]

[DOI]

Proceedings of the Digest of Papers: FTCS-22, 1992

Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Running algorithms efficiently on faulty hypercubes (extended abstract).

[BibT_eX]

[DOI]

SIGARCH Comput. Archit. News, 1991

Embedding complete binary trees in faulty hypercubes.

[BibT_eX]

[DOI]

Alexander Wang

Ernst W. Mayr

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Fault-tolerant meshes with minimal numbers of spares.

[BibT_eX]

[DOI]

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

A Comparison of SIMD Hypercube Routing Strategies.

[BibT_eX]

Melanie L. Fulgham

Proceedings of the International Conference on Parallel Processing, 1991

1990

Algorithms for Image Component Labeling on SIMD Mesh-Connected Computers.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1990

The Hough Transform has O(N) Complexity on N x N Mesh Connected Computers.

[BibT_eX]

[DOI]

SIAM J. Comput., 1990

Running Algorithms Efficiently on Faulty Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

1989

Apex: two architectures for generating parametric curves and surfaces.

[BibT_eX]

[DOI]

Larry McMurchie

Haim Mizrahi

Bill Yost

Vis. Comput., 1989

SIMD architectures and algorithms for image processing and computer vision.

[BibT_eX]

[DOI]

IEEE Trans. Acoust. Speech Signal Process., 1989

An EREW PRAM Algorithm for Image Component Labeling.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 1989

Hypercube and Shuffle-Exchange Algorithms for Image Component Labeling.

[BibT_eX]

[DOI]

J. Algorithms, 1989

A Lower Bound on the Size of Shellsort Networks.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

1988

Algorithms for massively parallel image processing architectures.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Pattern Recognition, 1988

Cubesort: An Optimal Sorting Algorithm for Feasible Parallel Computers.

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

Practical Algorithms for Image Component Labeling on SIMD Mesh Connected Computers.

[BibT_eX]