Jonathan C. Hardwick

According to our database, Jonathan C. Hardwick authored at least 7 papers between 1994 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2002

An optimization framework for web farm configuration.

David Bartholomew Stewart, Efstathios Papaefstathiou, Jonathan C. Hardwick

Proceedings of the Third International Workshop on Software and Performance, 2002

2001

An Assessment of MPI Environments for Windows NT.

Kenji Takeda, Nicholas K. Allsopp, Jonathan C. Hardwick, P. C. Macey, Denis A. Nicole, Simon J. Cox, David Lancaster

J. Supercomput., 2001

1999

Design and Implementation of a Practical Parallel Delaunay Algorithm.

Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Miller, Dafna Talmor

Algorithmica, 1999

1997

Interactive Simulations on the Web: Compiling NESL into Java.

Jonathan C. Hardwick, Girija J. Narlikar, Jay Sipelstein

Concurr. Pract. Exp., 1997

Implementation and Evaluation of an Efficient Parallel Delaunay Triangulation Algorithm.

Jonathan C. Hardwick

Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

1996

From AAPC Algorithms to High Performance Permutation Routing and Sorting.

Thomas Stricker, Jonathan C. Hardwick

Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

1994

Implementation of a Portable Nested Data-Parallel Language.

Guy E. Blelloch, Jonathan C. Hardwick, Jay Sipelstein, Marco Zagha, Siddhartha Chatterjee

J. Parallel Distributed Comput., 1994