**New Models, Architectures, and Technologies for Parallel Computation**- September 20-22, 1993
- Rutgers University
- Organizers: Phil Gibbons, AT&T Bell Labs, gibbons@research.att.com
- Richard Karp, UC Berkeley, karp@cs.berkeley.edu
- and Charles Leiserson, MIT, cel@theory.lcs.mit.edu
**Parallel Algorithms: From Solving Combinatorial Problems to Solving Grand Challenge Problems**- November 17-19, 1993
- Rutgers University
- Organizers: Jim Flanagan, CAIP-Rutgers, flanagan@caip.rutgers.edu
- Yossi Matias, AT&T Bell Labs, matias@research.att.com
- Vijaya Ramachandran, U. Texas, vlr@cs.utexas.edu
- Olof Widlund, NYU widlund@widlund.cs.nyu.edu
**Organizing and Moving Data in Parallel Machines**- January 26-28, 1994
- Princeton University
- Organizers: Christos Kaklamanis, DIMACS, kakl@dimacs.rutgers.edu
- Kai Li, Princeton, li@cs.princeton.edu
- Greg Plaxton, U. Texas, plaxton@cs.utexas.edu
- Abhiram Ranade (UC Berkeley) ranade@cs.berkeley.edu
**Interconnection Networks and Mapping and Scheduling Parallel Computations**- February 7 - 9, 1994
- Rutgers University
- Organizers: Frank Hsu, Fordham hsu@murray.fordham.edu
- Arnold Rosenberg, U. Mass. rsnbrg@cs.umass.edu
- Dominique Sotteau, McGill University
- Proceedings available through AMS (Volume 21 in the DIMACS Series):

Ordering information, preface and table of contents

**Parallel Processing of Discrete Optimization Problems**- April 28 - 29, 1994
- Rutgers University
- Organizers: Panos M. Pardalos, University of Florida
- Mauricio G. C. Resende, Bell Labs
- K.G. Ramakrishnan, Bell Labs
- Proceedings available through AMS (Volume 22 in the DIMACS Series):

Ordering Information, preface and table of contents

**Specification of Parallel Algorithms -- sponsored jointly with the Center for Research on Parallel Computation**- May 9 - 11, 1994
- Princeton University
- Organizers: Guy Blelloch, CMU, guyb@cs.cmu.edu
- Mani Chandy, Cal Tech, mani@vlsi.cs.caltech.edu
- Suresh Jagannathan, NEC suresh@research.nj.nec.com
- Proceedings available from AMS (Volume 18 in the DIMACS Series):

Ordering information, preface and table of contents

**3rd DIMACS Implementation Challenge: Effective Parallel Algorithms for Combinatorial Problems**- October 17 - 19, 1994
- Organizers: Sandeep Bhatt (coordinator), Bellcore, bhatt@bellcore.com
- David Culler, UC Berkeley, culler@cs.berkeley.edu
- John Dennis, Rice, dennis@cs.rice.edu
- David Johnson, AT&T, dsj@research.att.com
- Lennart Johnsson, Thinking Machines and Harvard, johnsson@endor.harvard.edu
- Charles Leiserson, MIT, cel@theory.lcs.mit.edu
- Proceedings available through AMS (Volume 30 of the DIMACS Series):

Ordering information, preface and table of contents

This workshop focuses on how to model state-of-the-art parallel computers, and will also examine the possible impact of new architectures (such as the KSR, CM-5, and others) and technologies (such as optics) on our models.

This workshop covers the whole spectrum of parallel algorithms.

This workshop covers topics including memory management in parallel computers, hierarchical memory systems, cache coherence, I/O, and algorithms for routing and sorting in parallel machines.

Index of Special Year on Massively Parallel Computing

DIMACS Homepage

Contacting the Center

Document last modified on October 19, 1998.