Federated Computing Research Conference, FCRC’96, Which Is David Wise, Steering Being Held May 20 - 28, 1996 at the Philadelphia Downtown Marriott

Home , ACM Fellow, ACM SIGACT, ACM SIGOPS, Amos Fiat, Carsten Lund, Cynthia Dwork

CRA Workshop on Academic Careers Federated for Women in Computing Science 23rd Annual ACM/IEEE International Symposium on Computing Computer Architecture FCRC ‘96 ACM International Conference on Research Supercomputing ACM SIGMETRICS International Conference Conference on Measurement and Modeling of Computer Systems 28th Annual ACM Symposium on Theory of Computing 11th Annual IEEE Conference on Computational Complexity 15th Annual ACM Symposium on Principles of Distributed Computing

12th Annual ACM Symposium on Computational Geometry First ACM Workshop on Applied Computational Geometry ACM/UMIACS Workshop on Parallel Algorithms ACM SIGPLAN ‘96 Conference on Programming Language Design and Implementation ACM Workshop of Functional Languages in Introductory Computing Philadelphia Skyline SIGPLAN International Conference on Functional Programming 10th ACM Workshop on Parallel and Distributed Simulation Invited Speakers Wm. A. Wulf ACM SIGMETRICS Symposium on Burton Smith Parallel and Distributed Tools Cynthia Dwork 4th Annual ACM/IEEE Workshop on Robin Milner I/O in Parallel and Distributed Systems Randy Katz SIAM Symposium on Networks and Information Management

Sponsors ACM CRA IEEE NSF May 20-28, 1996 SIAM Philadelphia, PA FCRC WELCOME

Organizing Committee Mary Jane Irwin, Chair Penn State University Steve Mahaney, Vice Chair Rutgers University Alan Berenbaum, Treasurer AT&T Bell Laboratories Frank Friedman, Exhibits Temple University Sampath Kannan, Student Coordinator Univ. of Pennsylvania Welcome to the second Federated Computing Research Conference, FCRC’96, which is David Wise, Steering being held May 20 - 28, 1996 at the Philadelphia downtown Marriott. This second Indiana University FCRC follows the same model of the highly successful first conference, FCRC’93, in Janice Cuny, Careers which nine constituent conferences participated. FCRC’96 includes seventeen constit- University of Oregon uent conferences - almost twice the size of FCRC’93! The FCRC model is one that Allan Gottlieb, ISCA New York University assembles a number of existing, specialized, research conferences into a coordinated meeting held at a common time in a common place. This model retains the advantages Doug DeGroot, ICS Texas Instruments of the smaller conferences, while at the same time, facilitating communication among Daniel Reed, METRICS researchers in different subfields in computer science and engineering. We have University of Illinois arranged a number of venues for attendee interaction including common breakfasts David Johnson, STOC and coffee breaks throughout the week. And, of course, due to its size, FCRC’96 also AT&T Bell Laboratories provides great visibility for the field as a whole. Steven Homer, Complexity Boston University The technical program for each constituent conference is independently administered, Cynthia Dwork, PODC with each responsible for its own meeting’s structure, content, and proceedings. The IBM, Almaden constituent conference committees are to be commended for putting together excep- Michael Goodrich, SCG tionally strong, interlinking technical programs. To the extent facilities allow, attendees Johns Hopkins University are free to attend technical sessions of other constituent conferences being held at the Ming Lin, WACG same time as their “home” conference. Proceedings from other constituent conferences U.S. Army Research Office & Univ. of N. Carolina, Chapel Hill will be available for purchase on-site. Dinesh Manocha, WACG Univ. of N. Carolina, Chapel Hill Five mornings of FCRC’96 week will start with a plenary talk on a topic of broad appeal Uzi Vishkin, WOPA to the CS&E community. We think you will find the talks presented by our outstanding University of Maryland slate of plenary speakers both inspiring and thought-provoking. The plenaries are Charles Fischer, PLDI open to anyone registered for a constituent conference meeting that day. FCRC week University of Wisconsin also features two exciting evening excursions, one Wednesday and one Saturday Robert Harper, ICFP evening, and an informative Friday evening Panel organized by CRA. Almost all constit- Carnegie Mellon University uent conferences meeting on Wednesday or Saturday have included the excursion in Matthias Felleisen, FLIC their registration package. The CRA Panel is open to all registrants. Exhibits, consist- Rice University ing of books and educational software displays and demonstrations, will be open Mary Bailey, PADS Wednesday through Sunday of FCRC week. University of Arizona Barton Miller, SPDT University of Wisconsin You have probably noticed that FCRC week spans a U.S. holiday, Memorial Day. The David Kotz, IOPADS Organizing Committee encourages you to consider bringing your family along to Phila- Dartmouth College delphia. They can have fun (while you work!). Philadelphia boasts world famous art Sampath Kannan, NIM exhibits and museums, a lively and colorful historic district, exciting arts and enter- University of Pennsylvania tainment venues, and fantastic restaurants. Steering Committee David Wise, Chair In planning FCRC’96, the Organizing Committee is grateful for support and assistance Indiana University from the sponsoring organizations (ACM, CRA, The IEEE Computer Society, and SIAM) Mary Jane Irwin as well as the National Science Foundation. ACM, The Association for Computing, was Penn State University notably active in providing support and planning expertise. In particular, the Commit- Gwen Bell tee would like to extend a warm thanks to Debbie Hall of ACM SIG Services for her Boston Computer Museum help with budgets, schedules, printings and mailings, and for putting up with our Frank Friedman naiveté about society policies and procedures. Rod Abraham and the staff of R.E. Temple University Abraham Associates provided outstanding conference management services. Finally, David Johnson the Committee would like to thank James Haines of the Computer Science Depart- AT&T Bell Laboratories ment at Purdue University, who formatted this Advance Program with much patience, Dave Patterson professionalism, and humor. The computing resources provided by Purdue’s Com- University of California, Berkeley puter Science Department for its production are also gratefully acknowledged. Paul Young CISE, NSF 1 CONTENTS

Highlights Committees...... 1 Invited Speakers ...... 3 FCRC Town Hall Meeting ...... 3 Overview Program at a Glance ...... 23 & 24 CRA Workshop on Academic Careers for Women in Computing Science (Careers) Sessions ...... 4 23rd Annual ACM/IEEE International Symposium on Computer Architecture (ISCA) Tutorials/Sessions/Papers...... 5 ACM International Conference on Supercomputing (ICS) Tutorial/Sessions/Papers ...... 7 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (METRICS) Tutorials/Sessions/Papers...... 10 28th Annual ACM Symposium on Theory of Computing (STOC) Sessions/Papers ...... 13 11th Annual IEEE Conference on Computational Complexity (Complexity, formerly Structures) Sessions/Papers ...... 17 15th Annual ACM Symposium on Principles of Distributed Computing (PODC) Sessions/Papers ...... 19 12th Annual ACM Symposium on Computational Geometry (SCG) Sessions/Papers ...... 22 First ACM Workshop on Applied Computational Geometry (WACG) Sessions/Papers ...... 26 ACM/UMIACS Workshop on Parallel Algorithms (WOPA) Sessions/Papers ...... 27 ACM SIGPLAN ‘96 Conference on Programming Language Design and Implementation (PLDI) Tutorials/Sessions/Papers...... 28 ACM Workshop of Functional Languages in Introductory Computing (FLIC) Sessions ...... 31 SIGPLAN International Conference on Functional Programming (ICFP) Sessions/Papers ...... 31 10th ACM Workshop on Parallel and Distributed Simulation (PADS) Tutorials/Sessions/Papers...... 33 ACM SIGMETRICS Symposium on Parallel and Distributed Tools (SPDT) Sessions/Papers ...... 35 4th Annual ACM/IEEE Workshop on I/O in Parallel and Distributed Systems (IOPADS) Sessions/Papers ...... 36 SIAM Symposium on Networks and Information Management (NIM) Sessions ...... 37 Information & Forms Advance Conference Registration ...... 40 Multiple Conference Registration...... 40 Hotel & Area Information ...... 38 Hotel Registration ...... 39 Cancellations ...... 41 Excursions & Exhibits ...... 42 Transportation...... 42 Hotel Maps ...... 43 & 44

2 CONFERENCE HIGHLIGHTS

Invited Speakers

Chief Scientist of Tera Computer architecture of the Almaden Dis- P1 Company. He received the tributed Digital Library System P5 Wm. A. Wulf BSEE from the University of New (both collaborative efforts). Randy Katz Mexico in 1967 and the Sc.D. University of Virginia from MIT in 1972. From 1985 to UC - Berkeley Wednesday, May 22, 1996 1988 he was Fellow at the P4 Sunday, May 26, 1996 8:00 – 9:00 am Supercomputing Research Cen- 8:00 – 9:00 am Room: Salon F, Grand Ballroom ter of the Institute for Defense Robin Milner Room: Salon F, Grand Ballroom Information Technology Is The Analyses in Maryland. Before University of Cambridge UK The Case for Wireless Over- Lever, But Where Shall We that, he was Vice President, Saturday, May 25, 1996 lay Networks Stand? Research and Development at 8:00 – 9:00 am Randy H. Katz is a leading Denelcor, Inc. and was chief Bill Wulf is AT&T Professor of Room: Salon F, Grand Ballroom researcher in computer system architect of the HEP computer design and implementation. He Engineering at the University of system. Dr. Smith is a Fellow of Computing is Interaction Virginia. He formerly was a Pro- Robin Milner is Professor of has written over 120 technical the ACM and a Fellow of the publications on CAD, database fessor of Computer Science at IEEE, and winner of the IEEE- Computation Theory at Cam- Carnegie-Mellon, founded and bridge UK, since January 1995; management, multiprocessor ACM Eckert-Mauchly award in architectures, high performance was CEO of Tartan Laborato- 1991. His main interest is gen- from January 1996 he is Head of ries, and was Assistant Director the Computer Laboratory there. storage systems, and video eral purpose parallel computer server architectures. of NSF. His research interests architecture. Previously he was at the Univer- have spanned programming lan- sity of Edinburgh for 22 years; in He led the implementation of the guages, optimizing compilers, 1986, with colleagues, he SPUR (Symbolic Processing computer architecture, and com- P3 founded there the Laboratory for Using RISCs) multiprocessor puter security. Foundation of Computer Sci- memory system, the first such His current activities include Cynthia Dwork ence. In 1991 gained the A.M. system to integrate coherent multiprocessor cache memories research into memory systems IBM Almaden Turing Award. with efficient virtual memory architecture, steering a funda- Friday, May 24, 1996 He has worked on computer- management. He was responsi- mental rethinking of the under- 8:00 – 9:00 am assisted reasoning; his system ble for co-developing the concept graduate CS curriculum, Room: Salon F, Grand Ballroom LCF (Logic for Computable assisting scholars in the human- Functions) was a model for sev- of Redundant Arrays of Inexpen- TBA ities exploit information technol- eral later systems. He led a team sive Disks (RAID). He led the ogy, and chairing the Computer Cynthia Dwork has been a mem- which designed and defined implementation of the first large- Science and Telecommunica- ber and occasional manager of Standard ML, a widely used pro- scale RAID file server for high tions Board at the National the Systems Fundamentals gramming language; this is one performance applications. From Research Council. Dr. Wulf is a group at the IBM Almaden of the first industry-scale lan- January 1993 through Decem- member of the National Academy Research Center since 1985. Her guages whose semantic defini- ber 1994, Katz was a program of Engineering, a Fellow of the principal areas of research are tion is fully formal. His main manager and deputy director of American Academy of Arts and distributed computing and cryp- contribution has been to the the- the Computing Systems Tech- Sciences, and a Fellow of the tography, with particular ory of concurrent computation. nology Office of ARPA. ACM, IEEE, and AAAS. emphasis on applications of the Some of this work is widely Katz’s recent research has latter to the former. For several accessible through his book focused on wireless communica- years she has worked both to Communication and Concur- tions and mobile computing. His P2 gain theoretical understanding rency (1989); also, around that current work involves providing of the sui generis cryptographic time he devised (with two col- seamless roaming across hetero- Burton Smith requirements of distributed com- leagues) the pi calculus, a basic geneous wireless networks. In Tera Computer puting aggregates, such as the model for mobile communicating collaboration with several service Thursday, May 23, 1996 Internet, and to develop practical systems. A continuing purpose providers and wireless technol- 8:00 – 9:00 am primitives for these and more of this work is to unite the theo- ogy companies, he is developing Room: Salon F, Grand Ballroom structured environments. This ries which underlie computation a wireless communications test- work has ranged from the inven- and communication. bed in the San Francisco Bay Designing your own multi- tion of non-malleable cryptogra- threaded processor Area called BARWAN (Bay Area phy to the design of the security Research Wireless Access Net- Burton Smith is Chairman and work).

FCRC Town Meeting

TH Exhibits Continental Breakfast Town Hall Meeting Wednesday – Sunday Daily 9:00 am – 6:00 pm 7:15 am – 8:00 am Friday, May 24, 1996 Room: Franklin Hall Room: Franklin Hall 6:00 pm – 7:30 pm Room: Salon F, Grand Ballroom Our Precarious Future: Who Will Fund Computing Research and Why? The Computing Research Association presents a discussion among inﬂuential policy makers from industry, academia and government concerning the funding future of computing research. At a time of signiﬁcant threats to government funding sources and industrial focus on product-relevant research, this issue affects us all. Find out where your research funding will (or won’t) come from! Government: The Honorable Robert S. Walker (R PA, 16th District). Chair, House Committee on Science (invited) Industry: (to be announced) Academia: Professor Dave Patterson (Moderator) University of California, Berkeley. Chair, Computing Research Association 3 CRA Workshop on Academic Careers for Women (Careers)

Registration for the CRA Workshop on Academic Careers for Women in Computer Science includes continen- Continental Breakfast tal breakfasts, coffee breaks, lunch on May 20th, and a reception on the evening of May 20th. The workshop Daily is sponsored by the Computing Research Association with support from the National Science Foundation. 7:15 am – 8:00 am Room: Franklin Hall

Sessions Committee

Introduction and Welcome S3 R Janice Cuny Monday, May 20, 1996 University of Oregon 8:15 am – 8:30 am Teaching Reception Organizer and General Chair Janice Cuny, general chair Monday, May 20, 1996 Monday, May 20, 1996 University of Oregon 11:30 am – 12:30 am 6:30 pm Francine Berman University of California at San This is the fifth in a series of Joan Francioni, chair CRA-sponsored Workshops on University of Southwestern Diego Academic Careers for Women in Louisiana S7 Computer Science. The work- How to be a good teacher. Com- Networking Ruzena Bajcsy shop is primarily intended for mon mistakes of new teachers. University of Pennsylvania Tuesday, May 21, 1996 women who are beginning aca- What should you be teaching. 8:30 am – 9:30 am demic careers -- either in the Dealing with problem students. final stages of finishing a Ph.D. Carla Brodley Special problems facing women Susan Eggers, chair Purdue University or newly hired as faculty. Partici- faculty. Documenting your University of Washington pants will meet with women who accomplishments. are already established in their The importance of networking. Sheila Castaneda fields. The established profes- Attending conferences. Describ- Clarke College sionals will share their own ing your work. Being part of the experiences, providing practical L “young girls’ network.” Susan Eggers information, advice, and support University of Washington to their younger colleagues. The 12:30 pm – 1:30 pm workshop will impart basic infor- Luncheon S8 mation that new faculty mem- Joan Fiegenbaum AT&T bers need for success. S4 The Perspective From the Smaller Schools Getting a Job Tuesday, May 21, 1996 Joan Francioni S1 University of Southwestern Monday, May 20, 1996 9:30 am – 10:30 am Louisiana The Tenure Decision 1:30 pm – 2:30 pm Sheila Castaneda, chair Monday, May 20, 1996 Francine Berman, chair Clarke College 8:30 am – 9:45 am University of California at San Helen Gill How do requirements and expec- National Science Foundation Mary Jane Irwin, chair Diego tations differ at smaller schools Pennsylvania State University How to develop a marketable and four year institutions. vita. Options after grad school. Research with fewer resources. Mary Jane Irwin What’s needed and what’s not Rewards. Pennsylvania State University needed. Writing a good tenure Interviewing. The Offer. dossier. Choosing references. 10:30 am Coffee Break Eileen Kraemer Typical successful cases. Com- S5 mon pitfalls and mistakes. Washington University First Year Surprises S9 Andrea LaPaugh Monday, May 20, 1996 Princeton University S2 2:30 pm – 3:30 pm Time Management Eileen Kraemer, chair Building a Research Pro- Tuesday, May 21, 1996 Nancy Leveson Washington University gram 11:00 am – 12:30 pm University of Washington Monday, May 20, 1996 The first few years. How to estab- Janice Cuny, chair 9:45 am – 11:00 am lish yourself. Tips for getting University of Oregon started. Dian Rae Lopez Nancy Leveson, chair How can you get this all done? University of Minnesota at Morris University of Washington How hard do you have to work? 3:30 pm Coffee Break Life outside of work. Balancing Going beyond your thesis. Advis- family life with a career. Two Donna Reese Mississippi State University ing graduate students. Collabo- career familes. rating. Journal versus S6 conference publications. What Mary Vernon referees look for. What to do Funding Mini-Workshop University of Wisconsin when a paper is rejected. Monday, May 20, 1996 11:00 am Coffee Break 4:00 pm – 6:00 pm Caroline Wardle Caroline Wardle, chair National Science Foundation National Science Foundation Writing an NSF proposal.

4 23rd Annual International Symposium On Computer Architecture (ISCA)

Registration for the 23rd Annual International Symposium On Computer Architecture includes a SIGARCH/ Plenary Invited Speaker TCCA business meeting, a reception, an evening excursion, Eckert-Mauchly Award Lunch, continental break- Daily fasts, coffee breaks, and conference proceedings. Student registration includes all of the above except the 8:00 — 9:00 am evening excursion. The conference is sponsored by the ACM Special Interest Group on Computer Architecture Room: Salon F and the IEEE Computer Society Technical Committee on Computer Architecture. Grand Ballroom

Sessions and Tutorials

ISCA ‘96 This tutorial will be an introduc- Exploiting instruction level par- Nicolas Gloy, Cliff Young, J. Bra- Student Travel Grants tion to DSM concepts and algo- allelism continues to be a hot dley Chen and Michael D. Smith Harvard University A limited number of Student Travel rithms. We will cover memory topic in computer architecture. Grants will be available for ISCA ‘96 consistency models with exam- We will focus on what you can student attendees. To apply for a ples; classification criteria and accomplish at run time, along Correlation and Aliasing in grant, please contact (preferably by parameters; hardware imple- with how the compiler can help. Dynamic Branch Predictors e-mail); mentations (e.g., DASH, SCI, Compile time vs. run time, Stuart Sechrest, Chih-Chieh Lee Prof. Jean-Loup Baer KSR, DDM, Merlin, RMS, and superscalar vs. VLIW, and the and Trevor N. Mudge Dept. of Computer Science state-of-the-art research); soft- various design decisions affect- University of Michigan and Engineering ware implementations (e.g., ing the microarchitecture Box 352350 Munin, IVY, Linda, Mirage, (instruction supply mechanisms, University of Washington Clouds, Orca, and state-of-the- branch prediction, multi-wide S2 Seattle, WA 98195-2350 art research); and hybrid imple- decode/issue, static or dynamic B [email protected] mentations (e.g., Alewife, Para- scheduling, multiple functional Shared Memory digm, Galactica, Plus, Flash, units and distribution buses, T1 Wednesday, May 22, 1996 A Shrimp, and state-of-the-art and various state maintenance research). Examples and case mechanisms) will be covered. 11:00 am – 12:30 pm Pradip Bose studies will be presented. Recent announcements of wide- Per Stenstrom, chair IBM T. J. Watson Research Center issue processors, most using Decoupled Hardware Support S. Surya T2 out-of-order execution, will be discussed. Finally, what to for Distributed Shared Mem- IBM Corp., Somerset Design Cen- A ory ter expect in the near future, espe- Peter Steenkiste cially in light of these recent Steven K. Reinhardt, Robert W. Pfile and David A. Wood Tuesday, May 21, 1996 Carnegie Mellon University announcements, coupled with 8:30 am – 12:30 pm University of Wisconsin Tuesday, May 21, 1996 renewed interest in VLIW. Pre-Silicon Performance 1:30 pm – 5:30 pm Analysis and Verification MGS: A Multi-Grain Shared Methodology High-Performance Communi- R Memory System cation on Loosely-Coupled Donald Yeung, John Kubiatow- A significant portion of this tuto- Systems: Architecture and rial will be devoted to the prob- Reception icz and Anant Agarwal Software MIT lem of validation and formal Application-level communica- Tuesday, May 21, 1996 verification of processor timer tion performance often is limited 7:00 pm – 10:00 pm COMA: an Opportunity for models, based on latest research by the interface between the at IBM and elsewhere. We will Building Fault-Tolerant Scal- compute node and the network able Shared Memory Multipro- cover: (a) early estimation models or interconnect. In this tutorial S1 for use during processor design cessors we will describe hardware and Christine Morin, Alain Gefflaut, definition; (b) cycle-by-cycle sim- software techniques that can be Welcome ulation models for CPU-memory Michel Banâtre and Anne-Marie used to improve communication Wednesday, May 22, 1996 Kermarrec subsystems; (c) model validation performance on loosely-coupled 9:20 am – 9:30 am IRISA and application performance systems. We will draw from our Keynote Address verification; (d) generation of rep- experience in the Nectar, Gigabit resentative traces from user and Nectar, and Credit Net high- 9:30 am – 10:30 am benchmark source code; (e) pro- speed networking projects, and S3 jection of benchmark suite per- from lessons learned by the 10:30 am Coffee Break formance using the target architecture community in opti- Processor/Memory Trade- processor simulation model; mizing communication on offs and (f) compiler tuning basics for tightly-coupled systems. The Wednesday, May 22, 1996 performance enhancement of S2 tutorial will be based on a “verti- A 2:00 pm – 3:30 pm processor-memory subsystems. cal slice” approach where we Dave Patterson, chair Extensions to cover SMP perfor- look at system issues from the Branch Prediction mance also will be described Application Programming Inter- Wednesday, May 22, 1996 Evaluation of Design Alterna- briefly. face all the way down to the com- 11:00 am – 12:30 pm tives for a Multiprocessor munication hardware. Joel Emer, chair Microprocessor T1 Basem A. Nayfeh, Lance Ham- Using Hybrid Branch Predic- B T2 mond and Kunle Olukotun tors to Improve Branch Predic- Stanford University Jelica Protic, Milo Tomasevic B tion Accuracy in the Presence and Veljko Milutinovic Yale N. Patt of Context Switches Institute for Advanced Computer Memory Bandwidth Limita- University of Michigan Technology, Belgrade, Yugoslavia Marius Evers, Po-Yung Chang tions of Future Microproces- Tuesday, May 21, 1996 and Yale N. Patt sors Tuesday, May 21, 1996 1:30 pm – 5:30 pm University of Michigan Doug Burger, Alain Kägi and 8:30 am – 12:30 pm James R. Goodman Continuing to Exploit Distributed Shared Mem- An Analysis of Dynamic University of Wisconsin Instruction Level Parallel- Branch Prediction Schemes on ory: Concepts and Systems ism: Issues, Bottlenecks, and Enabling Conditions System Workloads 5 23rd Annual International Symposium On Computer Architecture (ISCA)

Sessions

Missing the Memory Wall: The 10:30 am Coffee Break Dean M. Tullsen, Susan J. Egg- Mark Horowitz Case for Processor/Memory ers, Henry M. Levy and Jack L. Stanford University Integration Lo Margaret Martonosi University of Washington Ashley Saulsbury S6 Princeton University Swedish Institute of Computer A Joel S. Emer and Rebecca L. Todd C. Mowry Stamm Science University of Toronto Superscalar Memory Sys- Digital Equipment Corporation Fong Pong and Andreas Michael D. Smith Nowatzyk tems Harvard University Sun Microsystems Computer Cor- Thursday, May 23, 1996 Evaluation of Multithreaded poration 11:00 am – 12:00 pm Uniprocessors for Commercial Instruction Prefetching of Sys- Application Environments Matt Farrens, chair tems Codes With Layout Opti- 3:30 pm Coffee Break Rick J. Eickmeyer, Ross E. mized for Reduced Cache Increasing Cache Port Effi- Johnson, Steve R. Kunkel, Shi- Misses ciency for Dynamic Supersca- afun Liu and Mark S. Squillante IBM Chun Xia and Josep Torrellas lar Microprocessors University of Illinois at Urbana- S4 Kenneth M. Wilson, Kunle Champaign Olukotun and Mendel Rosen- Performance Comparison of Panel Discussion: blum ILP Machines with Cycle Time Compiler and Hardware Sup- Stanford University Evaluation Research Opportunities port for Cache Coherence in Tetsuya Hara, Hideki Ando, and Critiques: An Indus- Large-Scale Multiprocessors: trial Perspective High-Bandwidth Address Chikako Nakanishi and Masao Nakaya Design Considerations and Translation for Multiple-Issue Performance Evaluation Wednesday, May 22, 1996 Processors Mitsubishi Electric Corporation 4:00 pm – 5:30 pm Lynn Choi Todd M. Austin and Gurindar S. University of Illinois Dave Patterson, Organizer Sohi University of Wisconsin S7 Pen-Chung Yew B University of Minnesota S5 Networks A S6 B Thursday, May 23, 1996 M Cache Organization 2:00 pm – 3:30 pm I/O and Interrupts Thursday, May 23, 1996 Kai Li, chair SIGARCH/TCCA 9:30 am – 10:30 pm Thursday, May 23, 1996 Business Meeting 11:00 am – 12:00 pm Rotating Combined Queueing Corinna Lee, chair (RCQ): Bandwidth and Thursday, May 23, 1996 Jai Menon, chair Don’t use the page number, Latency Guarantees in Low- 6:00 pm but a pointer on it DCD-Disk Caching Disk: Cost, High-Performance Net- André Seznec A New Approach for Boosting works IRISA I/O Performance Jae H. Kim and Andrew A. Chien S9 Yiming Hu and Qing Yang University of Illinois at Urbana- The Difference-bit Cache University of Rhode Island Champaign Systems Toni Juan and Juan J. Navarro Friday, May 24, 1996 Universitat Politecnica de Catalu- Polling Watchdog: Combining A Router Architecture for 9:30 am – 10:30 am Real-Time Point-to-Point Net- nya Polling and Interrupts for Effi- Steve Scott, chair Tomas Lang cient Message Handling works UC Irvine Olivier Maquelin, Guang R. Gao, Jennifer Rexford, John Hall and Early Experience with Mes- Kevin Theobald and Xinmin Tian Kang G. Shin sage-Passing on the SHRIMP McGill University University of Michigan Multicomputer S5 Herbert H. J. Hum Richard D. Alpert, Angelos B Concordia University Coherent Network Interfaces Bilas, Matthias A. Blumrich, for Fine-Grain Communication Douglas W. Clark, Stefanos Application Implications Shubhendu S. Mukherjee, Damianakis, Cezary Dubnicki, for MP Systems Babak Falsafi, Mark D. Hill and Edward W. Felten, Liviu Iftode L and Kai Li Thursday, May 23, 1996 David A. Wood University of Wisconsin Princeton University 9:30 am – 10:30 pm 12:30 pm – 2:00 pm Thomes Gross, chair E-M Award Luncheon 3:30 pm Coffee Break STiNG: A CC-NUMA Computer System for the Commercial Understanding the Perfor- Marketplace mance of Shared Virtual Mem- S7 Tom Lovett and Russell Clapp ory from an Applications A S8 Sequent Computer Systems Perspective Processor Microarchitec- Liviu Iftode, Jaswinder Pal Singh ture Performance Evaluation 10:30 am Coffee Break and Kai Li and Optimization Princeton University Thursday, May 23, 1996 2:00 pm – 3:30 pm Thursday, May 23, 1996 Application and Architectural Jim Smith, chair 4:00 pm – 5:30 pm S10 Bottlenecks in Large Scale Dis- Exploiting Choice: Instruction Patricia Teller, chair tributed Shared Memory Fetch and Issue on an Imple- Joint ISCA/PODC Panel Machines Informing Memory Opera- mentable Simultaneous Multi- tions: Providing Memory Per- and Discussion Chris Holt and John Hennessy Threading Processor formance Feedback in Modern Friday, May 24, 1996 Stanford University Processors 11:00 am – 12:30 pm Jaswinder Pal Singh Princeton University 6 23rd Annual International Symposium On Computer Architecture (ISCA)

Committees

Allan Gottlieb Bill Dally Joel Emer Dave Patterson New York University MIT DEC UC Berkeley General Chair Jim Goodman Matt Farrens Shuichi Sakai Norm Jouppi Univ. of Wisconsin UC Davis Real World Computing Partner- Digital Equipment Corporation ship Yale Patt Thomas Gross Program Chair Univ. of Michigan ETH Zurich / CMU Steve Scott Cray Research Patricia Teller Alan J. Smith Anoop Gupta New Mexico State University UC Berkeley Stanford University André Seznec Tutorials Chair IRISA-INRIA Jim Smith Martin Hopkins IBM Mike Smith Ed Felton Univ. of Wisconsin Princeton University Jerry Huck Harvard Publicity & Publications Chair PROGRAM COMMITTEE HP Guri Sohi Kai Li Don Alpert Corinna Lee Univ. of Wisconsin Princeton University Intel Univ. of Toronto Per Stenstrom Finance Chair Forest Baskett Jai Menon Lund University Silicon Graphics IBM Patricia Teller ADVISORY COMMITTEE Andrew Chien Trevor Mudge New Mexico State Univ. Jean-Loup Baer Univ. of Illinois University of Michigan Mateo Valero University of Washington Michel Dubois Greg Papadopoulos Univ. of Catalonia Alan Berenbaum USC Sun Microsystems AT&T Bell Labs

International Conference on Supercomputing (ICS)

Plenary Invited Speaker Registration for the 1996 International Conference on Supercomputing includes an excursion, a reception, a luncheon, continental breakfasts, coffee breaks, and conference proceedings. Student registration includes Daily all of the above except the evening excursion. The conference is sponsored by the ACM Special Interest Group 8:00 — 9:00 am on Computer Architecture. Room: Salon F Grand Ballroom

Tutorial and Sessions

11:00 am Coffee Break T ers, researchers and students Detection and Global Optimi- who want a fast-paced, compre- zation of Reduction Opera- Dr. Michael Wolfe hensive introduction to the wide tions for Distributed parallel The Portland Group, Inc., and variety of supercomputer archi- Machines S2 Oregon Graduate Institute tectures available. This includes Toshio Suganuma, Hideaki system software and hardware Komatsu and Toshio Nakatani Invited Talk Friday, May 24, 1996 developers, as well as application IBM Japan Tokyo Research Labo- 9:30 am – 5:00 pm writers. ratory, Kanagawa, Japan Saturday, May 25, 1996 Supercomputer Architec- 11:30 am – 12:30 pm ture: Hardware and Software S1 Trade-offs A S1 S3 Michael Wolfe is a leader in the B A Distributed Memory Com- development of optimizing and Memory Systems (I) parallelizing compilers. Since pilers Distribution of Data and Computations 1988, he has been Associate Pro- Saturday, May 25, 1996 Saturday, May 25, 1996 fessor at the Oregon Graduate 9:30 am – 11:00 am 9:30 am – 11:00 am Saturday, May 25, 1996 Institute. In 1996, he joins the Memory Organization in Multi- 2:00 pm – 4:00 pm Portland Group, Inc., the leading Compiler Support for Hybrid Irregular Accesses on Multi- Channel Optical Networks: Minimizing Communication supplier of optimizing High Per- NUMA and COMA Revisited while Preserving Parallelism formance Fortran compilers. computers Antonio Lain and Prithviraj Ban- John K. Bennett and Y. Y. Xaio Wayne Kelly and William Pugh This full day tutorial will cover erjee Rice University University of Maryland modern supercomputer archi- University of Illinois at Urbana- tectures, ranging from pipelined Champaign The GLOW Cache Coherence Data-Localization for Fortran superscalar and vector proces- Protocol Extensions for Widely Macro-Dataﬂow Computation sors to moderately and massively Analysis of Local Enumera- Shared Data Using Partial Static Task- parallel systems. Of particular tion and Storage Schemes in Stefanos Kaxiras and James R. Assignment interest are the trade-offs HPF Goodman Akimasa Yoshida, Kenichi Koshi- University of Wisconsin-Madison between capabilities imple- H.J. Sips and C. van Reeuwijk zuka and Hironori Kasahara mented in hardware vs. soft- Delft University of Technology, Waseda University, Tokyo, Japan ware, such as parallelism Delft, the Netherlands A Cost-Comparison Approach detection and exploitation, mem- W. Denissen for Adaptive Distributed Mapping Performance Data ory locality, and so on. TNO-TPD, Delft, the Netherlands Shared Memory for High-Level and Data Views This tutorial is aimed at develop- Jai-Hoon Kim and Nitin H. of Parallel Program Perfor- Vaidya mance Texas A&M University 7 International Conference on Supercomputing (ICS)

Sessions

R. Bruce Irvin Raffaele Perego Jerome Galtier Satisfiability Test with Syn- Informix Software Inc. Istituto CNUCE, Consiglio Nazion- Universite de Versailles Saint- chronous Simulated Annealing Barton P. Miller ale delle Ricerche (CNR), Pisa, Quentin, France on the Fujitsu AP1000 Mas- University of Wisconsin-Madison Italy sively-Parallel Multiprocessor Profile Driven Weighted Andrew Sohn Experimental Evaluation of Decomposition New Jersey Institute of Technol- Efficient Sparse Matrix Distri- S5 Karen A. Tomko ogy butions Wright State University Manuel Ujaldon and Emilio L. Invited Session Edward S. Davidson Zapata University of Michigan University of Malaga, Spain Sunday, May 26, 1996 R Shamik D. Sharma and Joel 9:30 am – 12:30 pm 3:30 pm Coffee Break Reception Saltz Dennis Gannon, Organizer University of Maryland Indiana University Sunday, May 26, 1996 S7 7:00 pm – 10:00 pm MetaComputing: Progress and A S3 New Directions in Parallel and B Message Passing Optimi- S8 Distributed Computing zations A Physical and Mathemati- Runtime Optimizations cal Computations Sunday, May 26, 1996 S6 4:00 pm – 5:30 pm Monday, May 27, 1996 Saturday, May 25, 1996 A 9:30 am – 11:00 am 2:00 pm – 3:30 pm Evaluating the Limits of Mes- Memory Systems (II) sage Passing via the Shared Automating Parallel Runtime A Generator of Multi-Platform Attraction Memory on CC- Optimizations Using Post-Mor- High Performance Codes for Sunday, May 26, 1996 2:00 pm – 3:30 pm COMA Machines: Experiences tem Analysis PDE-based Scientific Applica- with TCGMSG and PVM Sanjeev Krishnan and Laxmi- tions Evaluation of Dynamic Access Kaushik Ghosh kant V.Kale Robert vanEngelen, Lex Wolters Ordering Hardware Georgia Institute of Technology University of Illinois at Urbana- and Gerard Cats Sally McKee, C.W. Oliver, W.A. Steve Breit Champaign Leiden University, the Nether- Wulf, K.L. Wright and J.H. Taylor Dragon Systems lands University of Virgina Runtime Coupling of Data-par- Hybrid Algorithms for Com- allel Programs A Performance Study of Cos- Examination of a Memory plete Exchange in 2D Meshes M.Ranganathan, A.Acharya, mological Simulations on Mes- Access Classification Scheme N.S.Sundar, D.N.Jayasimha, G.Edjlali, A.Sussman and sage-Passing and Shared- for Pointer-intensive and D.K.Panda and P.Sadayappan J.Saltz Memory Multiprocessors Numeric Programs Ohio State University University of Maryland Marios D. Dikaiakos and Sharad Mehrotra and Luddy Joachim Stadel Harrison The Effect of Interrupts on Run-time Compilation for Par- University of Washington University of Illinois at Urbana- Software Pipeline Execution allel Sparse Matrix Computa- Champaign on Message-passing Architec- tions Parallel Additive Lagged tures Cong Fu and Tao Yang Fibonacci Random Number Optimizing the Primary Cache Rob F. Van der Wijngaart, University of California Generators for Parallel Scientific Applica- Sekhar R. Sarukkai and Pankaj Srinivas Aluru tions: The Pool Buffer Mehra Syracuse University Approach NASA Ames Research Center S8 Josep Torrellas and Liuxi Yang B 3:30 pm Coffee Break University of Illinois at Urbana- Champaign S7 Analysis of Multi-Node B Systems S4 Combinatorial Problems Monday, May 27, 1996 S6 9:30 am – 11:00 am B Sunday, May 26, 1996 Data Prefetching 4:00 pm – 5:30 pm Synchronization Hardware for Saturday, May 25, 1996 Load Balance Issues in Networks of Workstations: Per- Amon2: A Parallel Wire Rout- 4:30 pm – 5:30 pm Unstructured Applica- formance vs. Cost tions ing Algorithm on a Torus Net- Rahmat S. Hyder and David A. Data Prefetching and Multi- work Parallel Computer Wood level Blocking for Linear Alge- Sunday, May 26, 1996 Hesham Keshk, Shin-ichiro University of Wisconsin-Madison bra Operations 2:00 pm – 3:30 pm Mori, Hiroshi Nakashima and Juan J. Navarro, Elena Gracia- ParInt: A Software Package for Shinji Tomita Are There Advantages to High- Diego and Jose R. Herrero Parallel Integration Kyoto University, Kyoto, Japan Dimension Architectures?: Universitat Politecnica de Catalu- Elise de Doncker, Ajay Gupta, Analysis of k-ary n-cubes for nya, Barcelona, Spain Jay Ball, Patricia Ealy and Alan Parallel Construction of Multi- the Class of Parallel Divide- Genz Dimensional Binary Search and-Conquer Algorithms A Template for Non-uniform Western Michigan University Trees Shantanu Dutt and Nam Trinh Parallel Loops Based on Ibraheem Al-furaih, Srinivas Univ. of Minnesota Dynamic Scheduling and Automatic Partitioning Tech- Aluru and Sanjay Goil Syracuse University Prefetching Techniques niques for Solving Partial Dif- Evaluating Virtual Channels Sanjay Ranka Salvatore Orlando ferential Equations on for Cache-Coherent Shared- University of Florida Universita’ Ca’ Foscari Venezia, Irregular Adaptive Meshes Memory Multiprocessors Venezia Mestre, Italy Akhilesh Kumar and Laxmi Bhuyan Texas A&M University 8 International Conference on Supercomputing (ICS)

Sessions Committees

11:00 am Coffee Break Juan J. Navarro, Elena Garcia, Gagan Agrawal, Anurag Efstratis Gallopoulos Josep-L. Larriba-Pey and Toni Acharya and Joel Saltz University of Patras, Greece Juan University of Maryland Dennis Gannon Universitat Politecnica de Catalu- Indiana University S9 nya, Spain Automatic Optimization of Hans Michael Gerndt Communication in Compiling Invited Talk 3:30 pm Coffee Break Central Institute for Applied Mathe- Out-of-core Stencil Codes matics Research Center, Juelich, Ger- Monday, May 27, 1996 Rajesh Bordawekar and Alok many 11:30 am – 12:30 pm Choudhary Elana Granston S11 Syracuse University GMD, Germany A J.Ramanujam L Louisiana State University Mary Hall Programming Models California Institute of Technology 12:30 pm – 2:00 pm Monday, May 27, 1996 The Galley Parallel File System Siamak Hassanzadeh ICS Luncheon 4:00 pm – 5:30 pm Nils Nieuwejaar and David Kotz Sun Microsystems Inference Mechanism for Fast Dartmouth College Kei Hiraki S10 Array Language Computation University of Tokyo, Japan A Luiz De Rose and David Padua 11:00 am Coffee Break Chris Jesshope Compilation Techniques University of Illinois at Urbana- University of Surrey, England Champaign Monday, May 27, 1996 Sachio Kamiya 2:00 pm – 3:30 pm S13 Fujitsu Limited, Japan Integrating Task and Data Par- A New Guaranteed Heuristic allelism Using Shared Objects Sumio Kikuchi Vector Memory Systems Hitachi, Ltd., Japan for the Software Pipelining Saniya Ben Hassen and Henri Problem Bal Tuesday, May 28, 1996 Peter Kogge Pierre-Yves Calland, Alain Darte Vrije Universiteit, Amsterdam, 11:30 am – 12:30 pm University of Notre Dame and Yves Robert the Netherlands Reducing Inter-Vector-Con- David Lilja Ecole Normale Superieure de flicts in Complex Memory Sys- University of Minnesota Lyon, France Eliminating Redundant Bar- tems John Mellor-Crummey rier Synchronizations in Rule- Anna del Corral and J. Llaberia Rice University A Register Allocation Tech- based Programs Universitat Politecnica de Catalu- nique Using Guarded PDG Shigeo Nagashima Anurag Acharya nya, Barcelona, Spain Hitachi, Ltd., Japan Akira Koseki and Yoshiaki Fuka- University of Maryland Hiroshi Nakashima zawa Performance of the Vectorial Kyoto University, Japan Waseda University, Tokyo, Japan Processor VEC-SM2 Using Hideaki Komatsu S11 Serial Multiport Memory Matt O’Keefe IBM Japan Tokyo Research Labo- B Jacques Jorda, A. Mzoughi and University of Minnesota ratory, Kanagawa, Japan Performance Evaluation D. litaize Yoshio Oyanagi IRIT/UPS, Toulouse, France University of Tokyo, Japan Counting Solutions to Linear Monday, May 27, 1996 Umakishore Ramachandran and Nonlinear Constraints 4:00 pm – 5:30 pm Georgia Institute of Technology Through Ehrhart polynomials: Benchmark Tests on the Digi- Committees Applications to Analyze and David Schneider tal Equipment Corporation Transform Scientific Programs Cornell University Alpha AXP 21164-Based Doug DeGroot Henk Sips Philippe Clauss AlphaServer 8400 Texas Instrument Universite Louis Pasteur, France General Chair Delft University of Technology, The Harvey Wasserman Netherlands Los Alamos National Laboratory Pen-Chung Yew University of Minnesota at Twin Cities Peiyi Tang S10 Program Chair The University of Southern Queen- B Fine Grain Parallel Communi- land, Australia cation on General Purpose Kenichi Miura Olivier Telman Linear Algebra LANs Fujitsu America, Inc. Universite de Versailles, France T. Mummert, C. Losak, P. Steen- Vice-Chair (Application) Monday, May 27, 1996 Clemens Thole kiste and A. Fisher David Snelling 2:00 pm – 3:30 pm GMD - German National Research Carnegie Mellon University University of Manchester, England An Efficient Steepest-Edge Center for Information Technology Vice-Chair (Architecture) Simplex Algorithm for SIMD Improving Single-Process Per- Josep Torrellas Hironori Kasahara Computers formance with Multithreaded University of Illinois at Urbana-Cham- Waseda University, Japan Michael E. Thomadakis and Jyh- Processors paign Vice-Chair (Software) Charn Liu Olivier Teman and A. Farcy Harvey Wasserman Texas A&M University University of Versailles, France John Sopka Los Alamos National Laboratory Sequent Computer Systems, Inc. Harry Wijshoff Parallel Implementation of the Finance Chair Leiden University, The Netherlands Lanczos Method for Sparse Matrices: Analysis of Data Dis- S12 PROGRAM COMMITTEE Michael Wolfe tributions Francois Bodin Oregon Graduate Institute of Science IRISA, France & Technology E.M. Garzon and I. Garcia Input/Output Systems Universidad de Almeria, Spain Tuesday, May 28, 1996 Ding-Kai Chen Yoshinori Yamaguchi 9:30 am – 11:00 am Silicon Graphic Inc. Electrotechnical Laboratory, Japan Block Algorithms for Sparse Gregory K. Egan Xiaodong Zhang An Interprocedural Framework Matrix Computations on High Monash University, Australia University of Texas at San Antonio for Placement of Asynchro- Performance Workstations nous I/O operations Rudolf Eigenmann Hans P. Zima Purdue University University of Vienna, Austria 9 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (METRICS)

Plenary Invited Speaker Registration for the 1996 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Sys- tems includes one lunch, a reception, an evening excursion, continental breakfasts, coffee breaks, and the Daily conference proceedings. The student registration includes all of the above except the evening excursion. The 8:00 — 9:00 am conference is sponsored by the ACM Special Interest Group on Measurement and Modeling of Computer Sys- Room: Salon F tems. Grand Ballroom

Tutorials

T1 mentation architecture are widely accepted methods for overhead and without perturbing A described. The implications of building workload models. The the system being measured), Larry Dowdy recent system directions for basic issues involved in parallel focusing mainly on parallel code Vanderbilt University instrumentation are discussed. workload modeling will also be and the memory system. Hard- We close with a brief review of introduced and some of the pro- ware monitoring support can be Thursday, May 23, 1996 available standards in the area posed approaches will be dis- crucial in gathering accurate 8:30 am – 9:30 am of systems performance instru- cussed. program information. The tuto- Performance Evaluation 101: mentation. rial provides a survey of existing Basic Modeling Techniques T3 performance monitoring hard- This tutorial is aimed at novice T1 A ware and software, and dis- performance modelers. The con- C cusses the challenges in text and motivating examples Brian Carlson extending current approaches. focus on performance prediction. Carey Williamson Dakota State University University of Saskatchewan Given a computer system with Thursday, May 23, 1996 T3 several options for possible Thursday, May 23, 1996 11:00 am– 12:00 pm C improvement, a performance 8:30 am – 10:00 am Performance Evaluation 103: prediction model can be used to Asit Dan Introduction to ATM Net- Basic Applications to Parallel Dinkar Sitaram evaluate each option. The option works Systems with the best predicted perfor- IBM Research Asynchronous Transfer Mode Parallel programs have proper- mance, relative to the implemen- Thursday, May 23, 1996 (ATM) offers the potential for effi- ties that are quite different from tation cost, is judged to be the 10:30 am – 12:00 pm cient statistical multiplexing of their sequential counterparts. best alternative. Topics include: multiple traffic types (e.g., data, Thus, basic performance model- Resource Management in measurement, workload charac- voice, video, image) on a single ing techniques differ consider- Distributed Video Server terization, model construction, high speed integrated services ably from the modeling and Environments model solution, calibration, pre- network. ATM is basically the workload characterization of This tutorial provides an over- diction, and validation. The pre- concept of connection-oriented sequential programs. This tuto- view of resource management in sentation is example oriented packet switching, using small rial will examine basic issues in a distributed video server clus- and intuition driven. Basic mod- fixed size packets called cells. the performance evaluation of ter consisting of many intercon- eling techniques using Mark- parallel programs. Characteriza- nected processing and storage ovian analysis, convolution, This beginner-level tutorial will provide an overview of the con- tions of parallel programs nodes. While admission control, mean value analysis, Petri net include Amdahl’s Law, average CPU and I/O scheduling ensure models, bounding techniques, cepts and motivation behind ATM, define a number of the parallelism, speedup, efficiency, QoS guarantees, distributed decomposition, and approxi- parallelism profiles, execution resource management issues mate analysis are covered. terms from the “ATM dictionary”, and then discuss a number of signatures, and task graphs. include data placement, performance-related issues in Often, obtaining the character- dynamic load balancing, cache T1 ization information is difficult management, etc. Efficient B high speed ATM networks (e.g., switching, call admission con- and requires additional tools. resource management algo- Robert Berry trol, traffic management, QOS). One such tool that will be rithms can make an order of IBM No background knowledge of described in detail is PICL. A magnitude difference in terms of ATM is required. series of case studies will show cost-effectiveness. Thursday, May 23, 1996 how the algorithm works. 8:30 am – 11:00 am This tutorial will give casual par- ticipants an overview of the video Systems Performance Instru- T2 T3 server design issues, as well as mentation: Techniques, B provide sophisticated designers Trade-offs, and Implications Tommy Wagner for Analysis with new and timely information US Military Academy Margaret Martonosi Thursday, May 23, 1996 about this rapidly evolving area. System performance developers/ Case studies of commercial serv- analysts make performance-ori- Thursday, May 23, 1996 10:30 am – 12:00 pm 9:45 am – 10:45 am ers will be of interest to both ented design and tuning deci- Hardware and Software Sup- groups. sions based on the Performance Evaluation 102: port for Performance Moni- instrumentation available on Workload Characterization toring their systems. Analysts must Techniques Obtaining good performance on T4 understand the nature of this In order to model the perfor- current computers often A instrumentation: the techniques, mance of a computer system, requires performance monitor- Christoph Lindemann the trade-offs and the resulting two models are required: a model ing systems that allow program- GMD Research Institute, Berlin implications for analysis. of the system itself, and a model mers, compiler writers, and Thursday, May 23, 1996 of the workload that runs on the We start with typical system system designers to identify and 1:30 pm – 4:30 pm instrumentation guidelines for system (as input to the system tune the portions of their design Numerical Methods for Per- large, complex systems. Next, we model). The process of workload that are limiting applications characterization is the process of and system performance. formance Modeling of Com- introduce basic instrumentation puter Architectures techniques and discuss the building those workload models. This tutorial examines the issues While measurement is an attrac- trade-offs that motivate the use This tutorial will survey the field and challenges inherent in mak- tive option for assessing an exist- of one technique over another. of workload characterization focusing on some of the most ing fine-grained observations ing system or a prototype, it is The key elements of an instru- about system behavior (with low

10 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (METRICS)

Sessions and Tutorials not a feasible option during the Thursday, May 23, 1996 12:15 pm R system design and implementa- 1:30 pm – 3:00 pm Coordinated Allocation of tion phases. Model-based evalu- An Introduction to Multivari- Reception Memory and Processors in ation has proven to be an ate Statistics: Their Geome- Multiprocessors attractive alternative in these try and Application Thursday, May 23, 1996 Eric Parsons and Kenneth cases. The most appropriate type Multivariate statistical analysis 7:00 pm – 10:00 pm Sevcik of model depends upon the com- is an invaluable tool in the study University of Toronto plexity of the system, the ques- of performance data, especially S1 tions to be studied, the accuracy for testing hypotheses, estimat- required, and the resources ing parameters, and predicting Scheduling L available for the study. Deter- future observations. This tutorial ministic and stochastic Petri provides an introduction to sev- Friday, May 24, 1996 12:45 pm – 2:15 pm nets (DSPNs), for example, are a eral multivariate statistical tech- 9:15 am – 10:45 am modeling formalism well suited Luncheon niques. Ken Sevcik, Chair to modeling distributed comput- University of Toronto ing systems and communication Key to multivariate statistical S3 networks. techniques are the concepts of 9:15 am multi-dimensional means, vari- Bringing Real-time Schedul- Simulation This tutorial is particularly ances, and covariances. All three intended for researchers and ing Theory and Practice Closer can be described using geomet- for Multimedia Computing Friday, May 24, 1996 practitioners interested in mod- ric notions of distances, angles, 2:15 pm – 3:45 pm eling the performance of com- R. Gopalakrishnan and G.M. and volumes. The tutorial illus- Phil Heidelberger, Chair puter systems. The background Parulkar trates these relationships and Washington University IBM TJ Watson Research Center is elementary probability and the mathematics underlying statistics. multivariate analysis. 9:45 am 2:15 pm With these concepts in hand, Exploiting Process Lifetime Embra: Fast and Flexible T4 several multivariate statistical Distributions for Dynamic Machine Simulation B techniques are studied (e.g., Load Balancing Emmett Witchel Sivaram Chelluri multivariate estimates of Mor Harchol-Balter and Allen MIT AT&T Global Information Solu- descriptive statistics; using mul- Downey Mendel Rosenblum tions tivariate analysis to reduce the University of California, Berkeley Stanford University dimensionality of data; and Danny Chen /dev/counsel, Inc. using multivariate least-squares 10:15 am 2:45 pm regression for predicting future Effective Local Scheduling of Experiences with Network David Glover observations). Parallel Jobs Simulation Hewlett Packard Company, Inc. Andrea C. Dusseau, Remzi Lawrence Brakmo and Larry L. Thursday, May 23, 1996 Arpaci and David Culler Peterson 1:30 pm – 4:30 pm T5 University of California, Berkeley The University of Arizona Performance Measurement, Randy Nelson 10:45 am Coffee Break 3:15 pm Management, and Capacity OTA Limited Partnership Planning of UNIX Systems Asynchronous Updates in This tutorial provides an intro- Thursday, May 23, 1996 Large Parallel Systems duction to the performance mea- 3:30 pm – 5:00 pm S2 Albert Greenberg surement and analysis tools Mathematical Techniques in AT&T Bell Laboratories available on several variants of Financial Engineering Parallel Systems Scott Shenker the UNIX system. We will present There are a surprising number of Xerox PARC Friday, May 24, 1996 these tools primarily in the con- similarities between the mathe- Alexander Stolyar 11:15 am – 12:45 pm text of bottleneck analysis, sys- matical techniques used in the Motorola tem tuning, and resource fields of performance modeling Margaret Martonosi, Chair utilization. We will also survey and financial engineering. These Princeton University 3:45 pm Coffee Break some of the commercially avail- similarities arise because finan- able performance measurement cial markets are inherently 11:15 am and analysis packages and their unpredictable and are thus ana- Limits on the Performance S4 role in performance analysis and lyzed using probabilistic models. Benefits of Multithreading capacity planning. This includes As with performance modeling, and Prefetching Poster Session an in-depth survey of available when problems are not mathe- Beng-Hong Lim benchmarking technology from matically tractable, solutions IBM T.J. Watson Research Center Friday, May 24, 1996 third parties and industry stan- are obtained from approxima- Ricardo Bianchini 4:15 pm – 5:45 pm dards groups. We will also dis- tions or simulations. Federal University of Rio de Jan- Practical Algorithms for Self cuss the current state of the art This tutorial explores the simi- eiro Scaling Histograms or Better and future trends in perfor- larity of the two disciplines by than Average Data Collection mance measurement and man- analyzing a selection of problems 11:45 am Michael Greenwald agement, including that are encountered in practice Fast Message Assembly Using Stanford University standardized interfaces. (e.g., pricing of financial instru- Compact Address Relations ments; optimal portfolios). The Peter Dinda and David O’Hal- Integrating Parallel Prefetch- T4 models and solutions discussed laron ing and Caching C provide a broad view of financial Carnegie Mellon University Tracy Kimbrel Joe Hellerstein engineering, and reveal several University of Washington IBM Research complementary views of how to Pei Cao model random price movements. University of Wisconsin, Madison

11 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (METRICS)

Sessions

Edward Felten 10:15 am Odysseas Ioannis Pentakalos S10 Princeton University Web Server Workload Charac- and Yelena Yesha Anna Karlin terization: The Search for University of Maryland Baltimore University of Washington Invariants County, CESDIS Modeling and Analysis II Kai Li Martin Arlitt and Carey L. Will- Sunday, May 26, 1996 Princeton University iamson 3:15 pm 11:15 am – 12:45 pm University of Saskatchewan An Approximate Analysis of Alois Ferscha, Chair A Buffer Model for Evaluating Waiting Time in Multi-classes Univ. of Vienna the Performance of R-tree 10:45 am Coffee Break M/G/1/./EDF Queues Packing Algorithms Ken Chen and Laurent 11:15 am Scott Leutenegger and Mario A. Decreusefond Analysis of Balanced Fork-Join Lopez S6 ENST Networks University of Denver Elizabeth Varki and Lawrence W. 3:45 pm Coffee Break Measurement and Moni- Dowdy An Approach to Selecting Met- Vanderbilt University rics for Detecting Performance toring Problems in Information Sys- Saturday, May 25, 1996 S8 11:45 am tems 11:15 am – 12:45 pm Efficient Exploration of Avail- Joseph Hellerstein Ed Gehringer, Chair Work In Progress ability Models Guided by Fail- IBM T.J. Watson Research Center North Carolina State University Saturday, May 25, 1996 ure Distances 4:15 pm – 5:45 pm Juan Carrasco, Javier Escriba RAIDframe: Rapid Prototyp- 11:15 am and Angel Calderon ing for Disk Arrays Integrating Performance Moni- Larry Dowdy, Chair Departament d’Enginyeria Elec- Garth Gibson, William toring and Communication in Vanderbilt University tronica, UPC Courtright II, Mark Holland and Parallel Computers Jim Zelenka 12:15 pm Carnegie Mellon University Margaret Martonosi Princeton University S9 Minimizing Completion Time Quantifying Achievable Rout- David Ofelt and Mark Heinrich of a Program by Checkpointing ing Performance in Multipro- Stanford University Video and Rejuvenation cessor Interconnection Sunday, May 26, 1996 Kishor Trivedi, Sachin Garg, Networks 11:45 am Yennun Huang and Chandra 9:15 am – 10:45 am Kintala Swaminathan Ramany Micro-architecture Evaluation Using Performance Vectors Joe Hellerstein, Chair Duke University Digital Equipment Corporation IBM TJ Watson Research Center Derek Eager Umesh Krishnaswamy and Isaac University of Saskatchewan D. Scherson University of California, Irvine 9:15 am On Optimal Piggyback Merging Committees Analysis of the Early Workload Policies for Video-on-Demand on the Cornell Theory Center 12:15 pm Systems Daniel A. Reed IBM SP2 Explaining World Wide Web University of Illinois Joel Wolf Steven Hotovy, David Schneider Traffic Self Similarity General Chair Mark Crovella and Azer IBM TJ Watson Research Center and Timothy O’Donnell David Nicol Cornell Theory Center Bestavros Charu Aggarwal Boston University MIT College of William and Mary Philip S. Yu Program Chair IBM TJ Watson Research Cente Carey Williamson S5 University of Saskatchewan S7 9:45 am Tutorials Chair Networks Experiments with Digital Modeling and Analysis I Mark Holiday Saturday, May 25, 1996 Video Playback Western Carolina University 9:15 am – 10:45 am Saturday, May 25, 1996 Ladan Gharai and Richard Ger- Proceedings Editor 2:15 pm – 3:45 pm ber Daniel A. Reed Will Leland, Chair University of Maryland Bellcore Spencer Ng, Chair University of Illinois IBM Research, Almaden Finance Chair 10:15 am 9:15 am Supporting Stored Video: ADVISORY COMMITTEE Design and Analysis of Frame- 2:15 pm Reducing Rate Variability and Larry Dowdy based Fair Queing: A New Traf- On the Modeling and Perfor- End-to-End Resource Require- Chair fic Scheduling Algorithm for mance Characteristics of a ments through Optimal Packet Switched Networks Serpentine Tape Drive Murray Woodside Smoothing Vice-chair Anujan Varma and Dimitrios Bruce Hillyer and Avi Silber- Stiliadis schatz James Salehi, Zhi-Li Zhang, Scott Leutenegger AT&T Bell Laboratories James F. Kurose and Don Tows- Secretary/treasurer University of California, Santa ley Cruz Mary Vernon 2:45 pm University of Massachusetts, Amherst Board of Directors An Analytic Model of Hierachi- 9:45 am Richard Muntz cal Mass Storage Systems with Networking Support for Large 10:45 am Coffee Break Board of Directors Scale Multiprocessor Servers Network-Attached Storage Devices Don Towsley David J. Yates, Erich M. Nahum, Board of Directors James F. Kurose and Don Tows- Daniel Menasce’ ley George Mason University Linda Wright University of Massachusetts, Board of Directors Amherst 12 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (METRICS)

Committees

PROGRAM COMMITTEE Bruno Gaujal Robert Jump Sanjeev Setia Scott Baden INRIA Rice University George Mason University University of California at San Diego Ed Gehringer Harry Jordan Ken Sevcik University of Colorado University of Toronto Gianfranco Ciardo North Carolina State University College of William and Mary Robert Geist David Kotz Rahul Simha Dartmouth College College of William and Mary Chita Das Clemson University Pennsylvania State University Garth Gibson Will Leland Billy Stewart Bell Communications Research North Carolina State University Peter Danzig Carnegie Mellon University University of Southern California Albert Greenberg Scott Leutenegger Mark Squillante University of Denver IBM Research David DeWitt AT&T Bell Laboratories University of Wisconsin Anoop Gupta Miron Livny Xian-He Sun University of Wisconson Louisana State University Carla Ellis Stanford University Dick Muntz Don Towsley Duke University Peter Harrison University of Calfornia at Los Angles University of Massachusetts Alois Ferscha Imperial College Vernon Rego Kishor Trivedi University of Vienna Philip Heidelberger Purdue University Duke University Richard Fujimoto IBM Research Joel Saltz Graham Horton David Wood Georgia Institute of Technology University of Maryland University of Erlangen University of Wisconson

28th Annual ACM Symposium on Theory of Computing (STOC)

Plenary Invited Speaker Registration for the 28th Annual ACM Symposium on Theory of Computing includes a reception, SIGACT Daily business meeting, an evening excursion, two lunches, continental breakfasts, coffee breaks, and conference proceedings. Student registration fee includes all of the above except the evening excursion. The conference is 8:00 — 9:00 am sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT). Room: Salon F Grand Ballroom

Sessions

10:10 am Ramakrishna Thurimella 11:25 am Univ. of Denver R The Space Complexity of Evaluation may be Easier than Approximating the Frequency Generation Reception Moments 9:45 am Moni Naor Noga Alon Approximating s-t Minimum Weizmann Institute Tuesday, May 21, 1996 Tel Aviv Univ. Cuts in0()n2 time 7:00 pm – 10:00 pm Yossi Matias and Mario Szegedy Andras A. Benczur and David R. 11:50 am AT&T Bell Laboratories Karger The PL Hierarchy Collapses S1 MIT Mitsunori Ogihara A 10:35 am Univ. of Rochester 10:10 am Session 1A Deterministic Restrictions in Circuit Complexity Minimum Cuts in Near-Linear 12:15 pm Wednesday, May 22, 1996 Shiva Chaudhuri Time Convergence Complexity of 9:20 am – 10:55 am Max-Planck Institut für Informatik David R. Karger Optimistic Rate Based Flow Jin-Yi Cai, Chair Jaikumar Radhakrishnan MIT Control Algorithms SUNY Buffalo Tata Institute of Fundamental Yehuda Afek, Yishay Mansour Research 10:35 am and Zvi Ostfeld 9:20 am Deterministic Õ(nm) Time Tel Aviv Univ. The Linear-Array Conjecture of Edge-Splitting in Undirected Communication Complexity S1 Graphs is False B Hiroshi Nagamochi and Toshi- S2 Eyal Kushilevitz hide Ibaraki B Session 1B Kyoto Univ. Technion Session 2B Nathan Linial Wednesday, May 22, 1996 Hebrew Institute 9:20 am – 10:55 am 10:55 am Coffee Break Wednesday, May 22, 1996 Rafail Ostrovsky Monika R. Henzinger, Chair 11:25 am – 12:35 pm Bellcore Cornell ShangHua Teng, Chair S2 Univ. of Minnesota 9:45 am 9:20 am A Testing of the Long Code and Fast Algorithms for k-Node Session 2A 11:25 am Hardness for Clique Connectivity Augmentation Wednesday, May 22, 1996 Generating Hard Instances of and Related Problems Johan Håstad 11:25 am – 12:25 pm Lattice Problems Royal Institute of Technology Joseph Cheriyan M. Ajtai Univ. of Waterloo Jin-Yi Cai, Chair IBM Almaden SUNY Buffalo 13 28th Annual ACM Symposium on Theory of Computing (STOC)

Sessions

11:50 am S3 Haim Kaplan and Robert E. Tar- 10:35 am Translational Polygon Con- B jan An0()nlog n -Size Fault-Toler- Princeton tainment and Minimal Enclo- Session 3B ant Sorting Network sure Using Linear Yuan Ma Programming Based Restric- Wednesday, May 22, 1996 4:55 pm Stanford tion 2:00 pm – 3:35 pm A Fast Quantum Mechanical Victor J. Milenkovic Erich Kaltofen, Chair Algorithm for Database Search Univ. of Miami RPI Lov K. Grover S5 AT&T Bell Laboratories B 12:15 pm 2:00 pm Session 5B Pushing Disks Together--the The Complexity of Matrix Continuous-motion Case Rank and Feasible Systems of S4 Thursday, May 23, 1996 Marshall Bern Linear Equations B 9:20 am – 10:55 am Xerox PARC E. Allender Session 4B Alistair Sinclair, Chair Amit Sahai Rutgers UC Berkeley Wednesday, May 22, 1996 UC Berkeley R. Beals 4:05 pm – 5:40 pm DIMACS, Rutgers 9:20 am M. Ogihara Ronitt Rubinfeld, Chair On Extracting Randomness Cornell/MIT L Univ. of Rochester From Weak Random Sources Amnon Ta-Shma 4:05 pm 12:35 pm – 2:00 pm 2:25 am Hebrew Univ. Luncheon Computing Roadmaps of Semi- Constructing Evolutionary algebraic Sets Trees in the Presence of Poly- 9:45 am morphic Characters S3 Saugata Basu and Richard Pol- Randomness-Optimal Sam- A lack Maria Bonet, Tandy J. Warnow pling, Extractors, and Con- Courant Institute and Shibu Yooseph structive Leader Election Univ. of Pennsylvania Session 3A Marie-Françoise Roy David Zuckermann Wednesday, May 22, 1996 IRMAR, Université de Rennes Cynthia Phillips Univ. of Texas, Austin 2:00 pm – 3:35 pm Sandia National Labs 2:50 pm Ronitt Rubinfeld, Chair 10:10 am Using the Groebner Basis Algo- 4:30 pm Cornell/MIT Generating Random Spanning rithm to find Proofs of Unsatis- Efficient Algorithms for Trees More Quickly than the fiability Inverting Evolution 2:00 pm Cover Time Matthew Clegg Martin Farach Learning Sat-k-DNF Formulas David Bruce Wilson UCSD Rutgers from Membership Queries MIT Jeffery Edmonds Sampath Kannan F. Bergadano York Univ. Univ. of Pennsylvania Universitá di Torino 10:35 am Russell Impagliazzo Towards an Analysis of Local D. Catalano UCSD Universitá di Catania S5 Optimization Algorithms Tassos Dimitriou and Russell S. Varricchio 3:15 pm A Universitá di L’ Aquila Impagliazzo Sparsity Considerations in Session 5A UCSD Dixon Resultants 2:25 pm Thursday, May 23, 1996 Deepak Kapur and Tushar Sax- 10:55 am Coffee Break Towards the learnability of ena 9:20 am – 10:55 am DNF formulae SUNY Albany Maurice Herlihy, Chair Nader H. Bshouty Brown Univ. of Calgary 3:35 pm Coffee Break S6 9:20 am 2:50 pm Modular Competitiveness for Knuth Prize Lecture Noise-tolerant Learning Near S4 Distributed Algorithms Thursday, May 23, 1996 the Information-theoretic A James Aspnes 11:30 am – 12:30 pm Bound Yale N. Cesa-Bianchi Session 4A Andrew C.-C. Yao Orli Waarts Princeton Universitá di Milano Wednesday, May 22, 1996 UC Berkeley E. Dichterman 4:05 pm – 5:40 pm Technion Monika R. Henzinger, Chair 9:45 am P. Fischer and H.U. Simon Cornell Communication-Efficient Par- L Universität Dortmund allel Sorting 4:05 pm Michael T. Goodrich 12:30 pm – 2:00 pm 3:15 pm Efficient 3-d Range Searching Johns Hopkins Luncheon Noise-tolerant Distribution- in External Memory Free Learning of General Geo- Darren Erick Vengroff 10:10 am S7 metric Concepts Brown, Duke Automatic Methods for Hiding A Nader Bshouty Jeffery Scott Vitter Latency in High Bandwidth Session 7A Calgary Duke Networks Sally Goldman, David Mathias Thursday, May 23, 1996 Matthew Andrews, Tom Leighton 2:00 pm – 3:35 pm and Subhash Suri 4:30 pm and Lisa Zhang Washington University Purely Functional Representa- MIT Michel Goemans, Chair Hisao Tamaki tions of Catenable Sorted Lists P. Takis Metaxas MIT IBM Tokyo Wellesley 14 28th Annual ACM Symposium on Theory of Computing (STOC)

Sessions

2:00 pm Parbhakar Raghavan 4:30 pm 9:20 am A Threshold of ln n for Approx- IBM Almaden How Good is the Goemans-Wil- Correlated Pseudorandom- imating Set Cover Madhu Sudan and David P. Wil- liamson MAX CUT Algorithm? ness and the Complexity of Uriel Feige laimson Howard J. Karloff Private Computations Weizmann Institute IBM T.J.Watson Georgia Tech Donald Beaver Transarc Corp. 2:25 pm 3:35 pm Coffee Break 4:55 pm Fast Algorithms for Parametric A Tight Analysis of the Greedy 9:45 am Scheduling come from Exten- Algorithm for Set Cover Digital Signets for Protection sions to Parametric Maximum S8 of Digital Information A Petr Slavik Flow SUNY Buffalo Cynthia Dwork and Jeffery S. Thomas McCormick Session 8A Lotspiech IBM Almaden UBC Thursday, May 23, 1996 5:20 pm Moni Naor 4:05 pm – 5:40 pm A Constant-factor Approxima- 2:50 pm tion Algorithm for the k-MST Weizmann Institute Gary L. Miller, Chair Towards a Syntactic Charac- Problem CMU terization of ptas Avrim Blum, R. Ravi and San- 10:10 am Sanjeev Khanna and Rajeev Mot- tosh Vempala Witness-Based Cryptographic wani 4:05 pm CMU Program Checking and Robust Stanford Computing Betti Numbers via Function Sharing Combinatorial Laplacians Yair Frankel and Peter Gemmell Joel Friedman Sandia National Labs 3:15 pm M Efﬁcient Approximation Algo- UBC Moti Yung IBM T.J. Watson rithms for MAX-CUT and COL- SIGACT Business Meeting ORING 4:30 pm Philip Klein and Hsueh-I Lu Embedding Graphs in an Arbi- Thursday, May 23, 1996 10:30 am Coffee Break Brown trary Surface in Linear Time 9:00 pm Bojan Mohar University of Ljubljana S9 S10 S7 A A B 4:55 pm Session 10A Algorithms for Manifolds and Session 9A Session 7B Simplicial Complexes in Friday, May 24, 1996 Friday, May 24, 1996 Thursday, May 23, 1996 Euclidean 3-Space 9:20 am – 10:30 am 11:00 am – 12:20 pm 2:00 pm – 3:35 pm Tamal K. Dey Thomas Lengauer, Chair Serge Plotkin, Chair Abhiram Ranade, Chair I.I.T. Kharagpur GMD Stanford UC Berkeley Sumanta Guha Univ. of Wisconsin 9:20 am 11:00 am 2:00 pm Reconstructing a Three- Non-Expansive Hashing Dynamic Deﬂection Routing 5:20 pm Dimensional Model with Arbi- Nathan Linial and Ori Sasson on Arrays On Bounding the Betti Num- trary Errors Hebrew Univ. Andrei Border bers and Computing the Euler Bonnie Berger, Jon Kleinberg Digital Systems Research Characteristic of Semi-alge- and Tom Leighton 11:25 am Eli Upfal braic Sets MIT Making Commitments in the IBM Almaden Saugata Basu Face of Uncertainty: How to Courant Institute 9:45 am Pick a Winner Almost Every 2:25 pm On the Boosting Ability of Top- Time Universal Algorithms for Store- Down Decision Tree Learning Baruch Awerbuch and-Forward and Wormhole S8 Algorithms Johns Hopkins Routing B Michael Kearns Yossi Azar and Amos Fiat Robert Cypher Session 8B AT&T Bell Laboratories Tel Aviv Univ. Johns Hopkins Yishay Mansour Tom Leighton Thursday, May 23, 1996 Tel Aviv Univ. MIT Friedhelm Meyer auf der Heide, 4:05 pm – 5:40 pm Christian Scheideler and Ber- thold Vocking Vijay Vazirani, Chair 10:10 am 11:50 am Univ. of Paderborn Georgia Tech Robot Navigation with Range Lower Bounds for On-line Queries Graph Problems with Applica- 2:50 pm 4:05 pm Dana Angluin, Jeffery Westbrook tion to On-Line Circuit and Distributed Packet Switching Approximability and Nonap- and Wenhong Zhu Optical Routing in Arbitrary Networks proximability Results for Mini- Yale Yair Bartal Yuval Rabini and Eva Tardos mizing Total Flow Time on a UC Berkeley Cornell Single Maching Amos Fiat Hans Kellerer S9 Tel Aviv Univ. 3:15 pm Universität Graz B Stefano Leonardi Universitá di Roma Adversarial Queueing Theory Thomas Tautenhahn Session 9B Allan Borodin Universität Magdeburg Univ. of Toronto Gerhard J. Woeginger Friday, May 24, 1996 Jon Kleinberg Eindhoven Univ. 9:20 am – 10:30 am MIT Joe Kilian, Chair NECI

15 28th Annual ACM Symposium on Theory of Computing (STOC)

Sessions Committees

S10 2:50 pm 3:35 pm Coffee Break David S. Johnson B Faster Isomorphism Testing of AT&T Research Session 10B Strongly Regular Graphs General Chair Daniel A. Spielman S12 Friday, May 24, 1996 UC Berkeley Gary L. Miller 11:00 am – 12:10 pm Carnegie-Mellon University Session 12 Noam Nisan, Chair 3:15 pm Program Chair Friday, May 24, 1996 Hebrew Univ. Node-Disjoint Paths on the 4:05 pm – 5:40 pm Alok Aggarwal Mesh and a New Trade-off in IBM Research 11:00 am VLSI Layout Sanjeev Arora, Chair Finance Chair Characterizing Linear Size Cir- Alok Aggarwal and David P. Will- Princeton cuits in Terms of Privacy iamson PROGRAM COMMITTEE Eyal Kushilevitz IBM Research 4:05 pm Sanjeev Arora Technion Jon M. Kleinberg Adaptive Zero Knowledge and Princeton Rafail Ostrovsky MIT Computational Equivocation Bellcore Donald Beaver Jin-Yi Cai Adi Rosen Transarc Corp. SUNY Buffalo Tel Aviv Univ. S11 Alan Frieze B 4:30 pm CMU 11:25 am Session 11B Adaptively Secure Multiparty Erich Kaltofen Nondeterministic Communica- Computation RPI Friday, May 24, 1996 tion with a Limited Number of Ran Canetti 2:00 pm – 3:35 pm Joe Kilian Advice Bits MIT NECI Juraj Hromkovic Alistair Sinclair, Chair Uri Feige, Oded Goldreich and Michel Goemans Universität zu Kiel UC Berkeley Moni Naor MIT Georg Schnitger Weizmann Institute Johann Wolfgang Goethe-Univer- 2:00 pm Monika R. Henzinger Cornell sität Modular 2 Counting Formulas 4:55 pm Are Hard for Cutting Planes On Relationships between Sta- Maurice Herlihy 11:50 am Proofs tistical Zero-Knowledge Proofs Brown Public vs. Private Coin Flips in Xudong Fu Tatsuaki Okamoto Thomas Lengauer One Round Communication Univ. of Toronto NTT Labs. GMD Games Gary L. Miller Ilan Newman 2:25 pm CMU Haifa Univ. Extremal Bipartite Graphs Noam Nisan Mario Szegedy and Superpolynomial Lower Hebrew Univ. AT&T Bell Laboratories Bounds for Monotone Span Programs Serge Plotkin Laszlo Babai Stanford S11 Univ. of Chicago Pavel Pudlak A Anna Gal Prague Session 11A Institute for Advanced Study Abhiram Ranade Janos Kollar Berkeley Friday, May 24, 1996 Univ. of Utah 2:00 pm – 3:35 pm Ronitt Rubinfeld Lajos Ronyai Cornell/MIT Alan Frieze, Chair Hungarian Academy of Sciences Alistair Sinclair CMU Tibor Szabo Ohio State UC Berkeley 2:00 pm Avi Wigderson ShangHua Teng Efﬁciently Four-coloring Pla- Hebrew Univ. Univ. of Minnesota nar Graphs Les Valiant Neil Robertson and Daniel P. 2:50 pm Harvard Sanders A Lower Bound for Random- Vijay Vazirani Ohio State ized Algebraic Decision Trees Georgia Tech Paul Seymour Dima Grigoriev Bellcore Penn State Robin Thomas Marek Karpinski and Roman Georgia Tech Smolensky Univ. of Bonn 2:25 pm Friedhelm Meyer auf der Heide The Angle-TSP Problem and Univ. of Paderborn the Weighted Linear Matroid Parity Problem 3:15 pm Exhibits A. Aggarwal, D. Coppersmith Lower Bounds for Noisy Bool- and B. Schieber ean Decision Trees Wednesday – Sunday IBM T.J. Watson William Evans and Nicholas Pip- 9:00 am – 6:00 pm S. Khanna and R. Motwani penger Stanford UBC Room: Franklin Hall

16 11th Annual IEEE Conference on Computational Complexity (Complexity, previously Structures)

Plenary Invited Speaker Registration for the 11th Annual IEEE Conference on Computational Complexity (previously Structures) Daily includes a reception, business meeting, evening excursion, Rump Sessions, continental breakfasts, coffee breaks, and conference proceedings. Student registration fee includes all of the above except the evening 8:00 — 9:00 am excursion. The conference is sponsored by the IEEE Technical Committee on Mathematical Foundations of Room: Salon F Computing. Grand Ballroom

Sessions

Invited Speakers: 11:10 am 4:30 pm S7 Parallel Complexity Hierar- Deciding the Vapnik-Cer- Noam Nisan p chies Based on PRAMs and vonenkis Dimension isΣ - Friday, May 24, 1996 3 Session 7 DLOGTIME-Uniform Circuits Complete Extractors, Dispersers, and Saturday, May 25, 1996 their Applications K. Iwama M. Schaefer Kyushu U. Univ. Chicago 2:00 pm – 3:40 pm Mike Saks C. Iwamoto Jin-Yi Cai, Chair Saturday, May 25, 1996 Kyushu Institute of Design 4:50 pm Randomization and Deran- VC Dimension in Circuit Com- 2:00 pm domization in Space 11:50 am plexity Randomization and Deran- Bounded Complexity Collapsing Oracle-Tape Hierar- P. Koiran domization in Space Bounded chies Ecole Normale Sup. Lyon Complexity Alan L. Selman (Invited Presentation) Sunday, May 26, 1996 G. Gottlob Technische U. Wien Mike Saks Much Ado about Functions Rutgers University S5 Christos Papadimitriou 3:00 pm Monday, May 27, 1996 S3 Session 5 The Complexity of Knowl- On the Measure of Two-dimen- edge Representation Saturday, May 25, 1996 sional Regions with Polyno- Session 3 9:20 am – 10:40 am mial-time Computable Friday, May 24, 1996 Jin-Yi Cai, Chair Boundaries R 2:00 pm – 3:40 pm Ker-I Ko David Zuckerman, Chair 9:20 am SUNY Stony Brook Reception Reducing P to a Sparse Set K. Weihrauch 2:00 pm Fern U. Germany Thursday, May 23, 1996 Using a Constant Number of 7:00 pm – 10:00 pm Extractors, Dispersers, and Queries Collapses P to L their Applications D. van Melkebeek 3:40 am Coffee Break (Invited Presentation) U. Chicago S1 Noam Nisan Hebrew Univ. 10:00 am S8 Session 1 Logspace Printability and Iso- 3:00 pm Friday, May 24, 1996 morphism Rump Session On Coherence, Random-self- 9:15 am – 10:40 am J. Goldsmith and M. Levy Saturday, May 25, 1996 reducibility, and Self-correc- U. Kentucky 4:00 pm - 5:45 pm Birgit Jenner, Chair tion S. Mahaney DIMACS 9:20 am J. Feigenbaum AT&T Bell Labs An Isomorphism Theorem for L. Fortnow, S. Laplante and A. 10:40 am Coffee Break S9 Circuit Complexity Naik M. Agrawal U. Chicago Session 9 U. Ulm S6 Sunday, May 26, 1996 E. Allender 3:40 am Coffee Break 9:20 am – 10:40 am Rutgers Session 6 Jack Lutz, Chair 10:00 am Saturday, May 25, 1996 9:20 am Nondeterministic NC1 Compu- S4 11:10 am - 12:30 pm On Positive P tation Session 4 Luc Longpré, Chair C. Lautemann and T. Sch- H. Caussinus and P. McKenzie wentick Friday, May 24, 1996 U. Montréal 11:10 am U. Mainz, Germany 4:10 pm - 5:10 pm D. Thérien Hierarchies of Circuit Classes I. A. Stewart McGill U. Carsten Lund, Chair that are Closed under Comple- U. Wales, UK H. Vollmer ment U. Würzburg 4:10 pm V. Vinay 10:00 am Error Reduction by Parallel Indian Institute of Science, Ban- A Comparison of Weak Com- 10:40 am Coffee Break Repetition - a Negative Result galore pleteness Notions U. Feige K. Ambos-Spies and X. Zheng Weizmann Institute 11:50 am U. Heidelberg S2 Oleg Verbitsky Succinct Representation, Leaf E. Mayordomo Lviv University Languages, and Projection U. Zaragoza Session 2 Reductions Friday, May 24, 1996 H.Veith 10:40 am Coffee Break 11:10 am - 12:30 pm Technische U. Wien Mitsunori Ogihara, Chair

17 11th Annual IEEE Conference on Computational Complexity (Complexity, previously Structures)

Sessions Committees

A. Naik S. Fenner Steven Homer S10 U. Chicago U. Southern Maine Boston University A. Selman Session 10 F. Green General Chair SUNY Buffalo Clark Univ. Sunday, May 26, 1996 Luc Longpré S. Homer University of Texas, El Paso 11:10 am - 12:30 pm 4:50 pm Boston Univ. Publicity Chair Jack Lutz, Chair Good Degree Bounds on A. Selman Nullstellensatz Refutations of SUNY Buffalo Jin-Yi Cai 11:10 am the Induction Principle T. Thierauf SUNY at Buffalo U. Ulm Stochastic Properties of Lutz- S. Buss Program Chair Random Sequences U.C. San Diego H. Vollmer Y. Wang T. Pitassi U. Würzburg CONFERENCE COMMITTEE U. Heidelberg U. Pennsylvania Eric Allender 11:10 am Rutgers University 11:50 am A Note on Decision versus Anne Condon Search for Graph Automor- Truth-table Closure and Turing M University of Wisconsin Closure of Average Polynomial phism Time Have Different Measures M. Agrawal Joan Feigenbaum Business Meeting AT&T Bell Laboratories in EXP U. Ulm R. Schuler Sunday, May 26, 1996 V. Arvind Lance Fortnow U. Ulm 8:30 pm Institute of Mathematical Sci- University of Chicago ences, Madras Noam Nisan Hebrew University S13 11:50 am S11 Zero Knowledge and the Chro- Uwe Schöning Universität Ulm Session 13 matic Number Session 11 Monday, May 27, 1996 Uriel Feige PROGRAM COMMITTEE Sunday, May 26, 1996 8:30 am - 10:10 pm Weizmann Institute Jin-Yi Cai 2:00 pm – 3:40 pm Kevin Compton, Chair Joe Kilian SUNY at Buffalo Mitsunori Ogihara, Chair NEC Research Institute 8:30 am Kevin Compton University of Michigan 2:00 pm The Complexity of Knowledge Birgit Jenner Much Ado about Functions Representation S15 (Invited Presentation) (Invited Presentation) Tübingen University Alan L. Selman Christos Papadimitriou Session 15 Luc Longpré SUNY Buffalo U.C. San Diego University of Texas, El Paso Monday, May 27, 1996 Carsten Lund 2:00 pm – 3:30 pm 3:00 pm 9:30 am AT&T Bell Laboratories Carsten Lund, Chair On Inverting Onto Functions Integer Programming as a Jack Lutz S. Fenner Framework for Optimization Iowa State University U. Southern Maine and Approximability 2:00 pm L. Fortnow and A. Naik I. Barland and P. Kolaitis DNA Models and Algorithms Mitsunori Ogihara U. Chicago U.C. Santa Cruz for NP-Complete Problems University of Rochester J. Rogers M. Thakur E. Bach, A. Condon, E. Glaser Jie Wang Depaul U. Borland International and C. Tanguay University of North Carolina, U. Wisconsin Greensboro 3:40 am Coffee Break 10:10 am Coffee Break 2:40 pm David Zuckerman University of Texas, Austin Reversible Simulation of Irre- versible Computation S12 S14 M. Li U. Waterloo Session 12 Session 14 P. Vitányi Sunday, May 26, 1996 Monday, May 27, 1996 CWI and U. Amsterdam 4:10 pm - 5:30 pm 10:30 am - 12:30 pm Jie Wang, Chair Luc Longpré, Chair

4:10 pm 10:30 am A Note on P-selective Sets and Complements of Multivalued on Adaptive versus Nonadap- Functions tive Queries to NP

“I don’t know what’s more inspiring, to look at the Liberty Bell or to look at the faces of children who are looking at the Liberty Bell.” Bert Shanas, New York Daily News

18 15th Annual ACM Symposium on Principles of Distributed Computing (PODC)

Plenary Invited Speaker Registration for the 15th Annual Symposium on Principles of Distributed Computing includes a reception, Daily the conference business meeting, one lunch, an evening excursion, continental breakfasts, coffee breaks, and conference proceedings. Student registration fee includes all of the above except lunch and the evening excur- 8:00 — 9:00 am sion. The conference is sponsored by the ACM Special Interest Group for Automata and Computability Theory Room: Salon F and the ACM Special Interest Group for Operating Systems Principles. Grand Ballroom

Sessions

Note: 10:40 am Coffee Break =>Efficient Delta-Causal =>Using Event Structure for Paper titles preceded by an Broadcasting of Multimedia the Efficient Analysis of States “=>” are Brief Announcements Applications Graphs S2 Roberto Baldon and Michel Dominique Ambroise and Brig- Raynal itte Rozoy R IRISA Universite de Paris XI Session 2 Ravi Prakash and Mukesh Sin- Reception Friday, May 24, 1996 ghal =>Testing Concurrent Data 11:00 am – 12:30 pm Ohio State University Thursday, May 23, 1996 Structures 8:00 pm – 10:00 pm Joint ISCA/PODC Panel and John L. Bruno Discussion =>Comparing Primary-Backup UC Santa Barbara and State Machines for Crash Phillip B. Gibbons and Steven S1 Failures Phillips L Jeremy B. Sussman and Keith AT&T Bell Laboratories Session 1 Marzullo 12:30 pm – 2:00 pm U.C. San Diego Friday, May 24, 1996 Luncheon 9:20 am – 10:40 am 3:30 pm Coffee Break M Ray Strong, Chair S3 IBM Almaden Business Meeting Friday, May 24, 1996 Session 3 S4 Memory Requirements for 7:30 pm - 8:30 pm Silent Stabilization Friday, May 24, 1996 Session 4 Shlomi Dolev 2:00 pm – 3:30 pm Friday, May 24, 1996 Ben-Gurion University Douglas B. Terry, Chair S5 3:50 pm – 5:20 pm Mohamed G. Gouda and Marco Xerox Parc Schneider Mark R. Tuttle, Chair Rump Session University of Texas at Austin Trade-Offs in Implementing DEC CRL Friday, May 24, 1996 Optimal Message Logging Pro- 8:30 pm - 10:00 pm Self-Stabilization by Window tocols Refining Knowledge Oriented Washing Lorenzo Alvisi Actions to Layered Implemen- Adam Costello and George Cornell University tations S6 Varghese Keith Marzullo Wil Janssen Washington University in St. U.C. San Diego University of Oldenburg Session 6 Louis Saturday, May 25, 1996 Efficient Message Ordering in Automated Logical Verifica- 9:30 am – 11:00 am Fault-Containing Self-Stabiliz- Dynamic Networks tion Based on Trace Abstrac- ing Algorithms Pierre Fraigniaud, Chair Idit Keidar and Danny Dolev tions LIP-CNRS Sukumar Ghosh, Arobinda Hebrew University Nils Klarlund, Mogens Nielsen Gupta, Ted Herman and Sriram and Kim Sunesen Memory Requirement for V. Pemmaraju University of Aarhus University of Iowa An efficient recovery-based Routing in Distributed Net- spin lock protocol for preemp- works tive shared memo Synthesis of Concurrent Sys- =>Mutually Consistent Record- tems for an Atomic Read Cyril Gavoille Injong Rhee Ecole Normale Superieure de ing in Asynchronous Computa- Atomic Write Model of Compu- tions Emory University Lyon Chi-Yung Lee tation Roberto Baldoni, Jean-Michel Stephane Perennes University of Warwick Paul Attie and Allen Emerson Helary and Michel Raynal University of Texas at Austin IRISA Optimal Routing Tables =>An Optimal Algorithm for Harry Buhrman and Jaap-Henk Generalized Causal Message =>Synthesis of Distributed Hoepman =>Minimizing Access Costs in Concurrent Systems Replicated Distributed Sys- Ordering CWI Evelyn Tumlin Pierce tems Ajay Kshemkalyani Paul M. B. Vitanyi University of Texas at Austin Michael Goldweber IBM Research Triangle CWI and University of Amster- Beloit College Mukesh Singhal dam Ohio State University =>I/O Automata Based Verifi- Donald Johnson cation of Finite State Distrib- Dartmouth College Spreading Rumors Rapidly =>Characterization of Mes- uted Systems; Complexity Despite an Adversary Issues =>On the Borowsky-Gafni Sim- sage Ordering Specifications James Aspnes and Will Hurwood Sandeep K. Shukla, Harry B. ulation Algorithm and Protocols Yale V. V. Murty and V. K. Garg Hunt III, Daniel J. Rosenkrantz, Nancy Lynch S. S. Ravi and R. E. Stearns University of Texas at Austin =>Fast, Long-Lived Renaming MIT SUNY Albany Sergio Rajsbaum Improved and Simplified UNAM Mexico

19 15th Annual ACM Symposium on Principles of Distributed Computing (PODC)

Sessions

Mark Moir Frank Stomp =>Baked Potatoes: Deadlock =>The Role of Data-Race-Free University of Carolina at Chapel AT&T Bell Laboratories Prevention Via Scheduling Programs in Recoverable DSM Hill Gadi Taubenfeld Shlomi Dolev Soma Chaudhuri Juan A. Garay AT&T Bell Laboratories and Ben-Gurion University Iowa University IBM T.J. Watson Israel Open University Evangelos Kranakis and Danny Sundar Kanthadai and Jennifer Krizanc Welch =>The Complexity of Data =>Space-efficient Construc- Carleton University Texas A & M University Mining on the Web tion of Buffer-optimal 1- Evangelos Kranakis and Danny Writer 1-Reader Multivalued =>Witness-based Crypto- =>Crash Failures vs. Crash + Krizanc Atomic Variable graphic Program Checking and Link Failures Carleton University S. Haldar Robust Function Sharing Anindya Basu and Sam Toueg Andrzej Pelc Tata Institute (Announcement) Cornell University Universite de Quebec a Hull K. Vidyasankar Yair Frankel and Peter Gemmel Bernadette Charron-Bost David Peleg Memorial U. of Newfoundland Sandia National Laboratories Ecole Polytechnic Weizmann Institute Moti Yung =>Randomized Adaptive IBM T.J. Watson =>Efficient Token-based Con- Video on Demand S10 trol in Rings C. Bouras, V. Kapoulas, T. =>On the Convergence Com- Esteban Feuerstein Pantziou and P. Spirakis plexity of Optimistic Rate Session 10 Universidad de Buenos Aires and Patras University Based Flow Control Algo- Universidad de General Sacra- rithms Sunday, May 26, 1996 mento =>Message and Time Efficient Yehuda Afek, Yishay Mansour 9:30 am – 11:00 am Stefano Leonardi and Alberto Distributed Algorithms for and Zvi Ostfeld Ambuj K. Singh, Chair Marchetti-Spaccamela Sparse k-connectivity Certifi- Tel-Aviv University U.C. Santa Barbara Universita di Roma “La sapienza” cates Nicola Santoro Esther Jennings and Lenka 4:00 pm Coffee Break Crash Failures Can Drive Pro- Carleton University Matyckova tocols to Arbitrary States Lulea University of Technology Mahesh Jayaram and George =>Efficient Traffic Laws for S9 Varghese Mobile Robots Washington University in St. Sonne Preminger S8 Louis Weizmann Institute Session 9 Eli Upfal Saturday, May 25, 1996 Session 8 Time and Space Lower Bounds Weizmann Institute and IBM 4:15 pm – 5:45 pm for Non-Blocking Implementa- Almaden Saturday, May 25, 1996 Eli Gafni, Chair tions 2:30 pm – 4:00 pm U.C. Los Angeles Prasad Jayanti 11:00 am Coffee Break James Aspnes, Chair Dartmouth College Yale The Power of Multi-objects King Tan and Sam Toueg Yehuda Afek Cornell University S7 Randomness in Private Com- Tel-Aviv University putations Michael Merritt Simple, Fast, and Practical Session 7 Eyal Kushilevitz AT&T Bell Laboratories Non-Blocking and Blocking Technion Gadi Taubenfeld Concurrent Queue Algorithms Saturday, May 25, 1996 Yishay Mansour AT&T Bell Laboratories and 11:20 am – 12:35 pm Maged Michael and Michael Tel-Aviv University Israel Open University Scott Yoram Moses, Chair University of Rochester Weizmann Institute Distributed Pseudo-Random Universal Operations: Unary Bit Generators: A New Way to versus Binary =>A Proof of a Theorem in Strong-Feasibilities of Equiva- Speed-Up Shared Coin Tossing Hagit Attiya and Eyal Dagan Algebraic Topology by a Dis- lence-Completions Mihir Bellare Technion tributed Algorithm Yuh-Jzer Joung U.C. San Diego Eli Gafni National Taiwan University Juan Garay Real-Time Object Sharing with U.C. Los Angeles IBM T.J. Watson Minimal System Support Polylog Randomized Wait- Tal Rabin Srikanth Ramamurthy, Mark =>Wait-Free Solvability via Free Consensus MIT Moir and James H. Anderson Combinatorial Topology Tushar Deepak Chandra University of North Carolina at Marios Mavronicolas IBM T.J. Watson A Randomized Byzantine Chapel Hill University of Cyprus Agreement Protocol with Con- =>Asynchrony versus Bulk- stant Expected Time and =>Space Bounds for Transac- =>Simulation as an Iterated Synchrony in QRQW PRAM Guaranteed Termination in tional Synchronization Task Models Optimal (Deterministic) Time John Valois Eli Gafni Phillip B. Gibbons and Yossi Arkady Zamsky Rensselaer Polytechnic Institute U.C. Los Angeles Matias Technion AT&T Bell Laboratories =>What Critical Algebraic =>On the Decidability of Dis- Vijaya Ramachandran =>Early-Stopping Terminating Property Allows Operations of tributed Decision Tasks University of Texas at Austin Reliable Broadcast Protocol for Concurrent Abstract Data Maurice Herlihy General Omission Failures Types to be Fast? Brown University =>Constructing a Reliable Marcel-Catalin Rosu Martha J. Kosa Sergio Rajsbaum Test&set Bit Cornell University Tennessee Technological Univer- UNAM Mexico (Extended Abstract) sity

20 15th Annual ACM Symposium on Principles of Distributed Computing (PODC)

Sessions Committees

11:00 am Coffee Break =>Tight Bounds on the Cumu- =>Collective Consistency James E. Burns lative Proﬁt of Distributed Vot- Cynthia Dwork, Ching-Tien Ho Bellcore ers and Ray Strong General Chair IBM Almaden S11 Peter Auer Yoram Moses UC Santa Cruz Weizmann Institute =>Perfect Failure Detectors Session 11 Pasquale Caianiello Program Chair Universita dell’Aquila and (Repeated) Reliable Broad- Sunday, May 26, 1996 Nicolo Cesa-Bianchi cast Brian Coan 11:20 am – 12:35 pm Universita di Milano Aleta Ricciardi Bellcore Tal Rabin, Chair University of Texas at Austin Finance Chair MIT =>The Offset Problem Lenore Cowen =>A Framework for Partition- STEERING COMMITTEE Counting Networks are Practi- Johns Hopkins University able Membership Service Maurice Herlihy cally Linearizable Rudolph Mathar Danny Dolev Brown University Nancy Lynch and Alex Shvarts- Aachen University of Technology Hebrew University Chair man Dalia Malki MIT AT&T Bell Laboratories James E. Burns Nir Shavit Ray Strong Bellcore S12 Tel-Aviv University and MIT IBM Almaden Brian Coan Dan Touitou Bellcore Tel-Aviv University Session 12 =>Evaluating Quorum Systems Sunday, May 26, 1996 Over the Internet Vassos Hadzilacos University of Toronto How to be an Efﬁcient Snoop, 2:30 pm – 4:00 pm Yair Amir or the Probe Complexity of Sergio Rajsbaum, Chair Hebrew University Barbara Liskov Quorum Systems UNAM Mexico Avishai Wool MIT David Peleg and Avishai Wool Weizmann Institute Yoram Moses Weizmann Institute Fail-Awareness in Timed Asyn- Weizmann Institute chronous Systems David Peleg Eventually-Serializable Data Christof Fetzer and Flaviu Cris- Weizmann Institute Services tian Alan Fekete U.C. San Diego PROGRAM COMMITTEE University of Sidney James Aspnes David Gupta, Victor Luchangco, A New Look at Membership Yale University Nancy Lynch and Alex Shvarts- Services man Benny Chor Gil Neiger Technion MIT Intel Corporation Pierre Fraigniaud =>From Serializable to Causal On the Impossibility of Group LIP--CNRS Transactions for Collaborative Membership Eli Gafni Applications Tushar Deepak Chandra U.C. Los Angeles M. Raynal and G. Thiakime IBM T.J. Watson IRISA, Campus de Beaulieu Yoram Moses Vassos Hadzilacos Weizmann Institute M. Ahamad University of Toronto Tal Rabin Georgia Institute of Technology Sam Toueg MIT Cornell University =>The Strength of Counting Bernadette Charron-Bost Sergio Rajsbaum Networks Ecole Polytechnic UNAM Mexico Costas Busch and Marios Mavronicolas Ambuj K. Singh University of Cyprus U.C. Santa Barbara Ray Strong IBM Almaden Douglas B. Terry Xerox PARC Mark R. Tuttle DEC CRL Jeannette M. Wing CMU Job Zwiers University of Twente

Philadelphia “The Nation’s Friendliest City” Conde Nast Traveler

21 The 12th Annual ACM Symposium on Computational Geometry (SCG)

Plenary Invited Speaker Registration for the 12th Annual ACM Symposium on Computational Geometry includes a welcoming recep- Daily tion, business meeting, an evening excursion, continental breakfasts, coffee breaks, a copy of the conference proceedings, and a copy of the video proceedings. Student registration fee includes all of the above except the 8:00 — 9:00 am evening excursion. The conference is sponsored by the ACM Special Interest Group on Algorithms and Com- Room: Salon F putation Theory (SIGACT) and the ACM Special Interest Group on Graphics (SIGGRAPH). Grand Ballroom

Sessions

12:10 pm 4:55 pm Pankaj K. Agarwal, Chair R Linear Complexity Hexahedral Rectilinear and Polygonal p- Duke University Reception Mesh Generation Piercing and p-Center Prob- David Eppstein lems 11:20 am Thursday, May 23, 1996 Micha Sharir and Emo Welzl On Computing Voronoi Dia- 7:00 pm – 10:00 pm grams by Divide-Prune-and- S3 Conquer Nancy M. Amato and Edgar A. S1 M Session 3 Ramos Session 1 Friday, May 24, 1996 Business Meeting 11:45 am Friday, May 24, 1996 2:00 pm – 3:45 pm Friday, May 24, 1996 Faster Output-Sensitive Paral- 9:15 am – 10:55 am Nicholas Patrikalakis, Chair 7:30 pm lel Convex Hulls for d < 3: Sue Whitesides, Chair MIT Joseph Mitchell, Chair Optimal Sublogarithmic Algo- McGill University SUNY-Stony Brook rithms for Small Outputs 2:00 pm Neelima Gupta and Sandeep Sen 9:15 am Combinatorial and Experimen- 12:10 pm New Lower Bounds for Convex tal Results for Randomized S5 Hull Problems in Odd Dimen- Point Matching Algorithms Developing a Practical Projec- sions Sandy Irani and Prabhakar tion-Based Parallel Delaunay Session 5 Algorithm Jeff Erickson Raghavan Saturday, May 25, 1996 Guy Blelloch, Gary L. Miller and 9:40 am 2:25 pm 9:15 am – 10:55 am Dafna Talmor Shadows and Slices of Poly- Temporally Coherent Conser- Victor Milenkovic, Chair topes vative Visibility University of Miami Nina Amenta and Günter Ziegler Satyan Coorg and Seth Teller S7 9:15 am 10:05 am 2:50 pm Parallel Robust Algorithms for Session 7 Vertical Decomposition of a Splitting a Complex of Convex Constructing Strongly Convex Saturday, May 25, 1996 Single Cell in a Three-Dimen- Polytopes in any Dimension Hulls 2:00 pm – 3:40 pm sional Arrangement of Sur- Chandrajit L. Bajaj and Valerio Wei Chen, Koichi Wada and Joseph O’Rourke, Chair faces and its Applications Pascucci Kimio Kawaguchi Smith College Otfried Schwarzkopf and Micha Sharir 3:15 pm 9:40 am A Computational Algorithm Robust Adaptive Floating- 2:00 pm 10:30 am for Origami Design Point Geometric Predicates Approaching the Largestβ - On the Number of Arrange- Robert J. Lang Jonathan Shewchuk Skeleton within a Minimum ments of Pseudolines Weight Triangulation Stefan Felsner 3:45 pm Coffee Break 10:05 am Siu-Wing Cheng and Yin-Feng On the Bit Complexity of Mini- Xu 10:55 am Coffee Break mum Link Paths: Superqua- 2:25 pm S4 dratic Algorithms for Problems Solvable in Linear time The Exact Minimum Weight Triangulation Session 4 Simon Kahan and Jack Snoey- S2 ink Matthew T. Dickerson and Mark Friday, May 24, 1996 H. Montague Session 2 4:05 pm – 5:20 pm 10:30 am Friday, May 24, 1996 Pankaj K. Agarwal, Chair Checking Geometric Pro- 2:50 pm 11:20 am - 12:35 pm Duke University grams or Veriﬁcation of Geo- Flipping Edges on Triangula- tions Marshall Bern, Chair metric Structures 4:05 pm Kurt Mehlhorn, Stefan Näher, F. Hurtado, M. Noy and J. Urru- Xerox PARC tia A Near-Linear Algorithm for Michael Seel, Raimund Seidel, the Planar 2-Center Problem Thomas Schilz, Stefan Schirra 11:20 am 3:15 pm Micha Sharir and Christian Uhrig On Triangulating Three- Enumeration of Regular Trian- Dimensional Polygons 4:30 pm 10:55 am Coffee Break gulations Gill Barequet, Matthew Dicker- Tomonari Masada, Hiroshi Imai son and David Eppstein On Piercing Sets of Objects and Keiko Imai Matthew J. Katz and Franck 11:45 am Nielsen S6 3:40 pm Coffee Break An Aspect Ratio Bound for Tri- angulating a d-Grid Cut by a Session 6 Hyperplace Saturday, May 25, 1996 Scott A. Mitchell and Stephen A. 11:20 am - 12:35 pm Vavasis 22 PROGRAM AT A GLANCE

Monday, May 20 Tuesday, May 21 Wednesday, May 22 Thursday, May 23 Friday, May 24 morning afternoon evening morning afternoon evening morning afternoon evening morning afternoon evening morning afternoon evening P1 E P2 E P3 E TH FCRC

S1 S3 L S5 R S7 S9

S2 S4 S6 S8 Careers

T1 T1 T2 T2 S2 S5 S6 S7 A B A B R S1 A S3 S4 A A A S8 M S9 S10 S2 S5 S6 S7 ISCA B B B B

T1 T4 T4 A T2 A C R S1 S2 L S4 T1 T3 T4 B A B T5 S3 T1 T3 C B METRICS T3 C S1 S2 S3 S4 S5 S7 S8 S9 S10 S11 R A A A A A S6 A A M A A A S12 S1 S2 S3 S4 S5 S7 S8 S9 S10 S11 STOC ICS B B B B B L B B B B B

R S1 S2 S3 S4 Complexity

R S1 S2 L S4 M

PODC S3 S5

R S1 S2 S3 S4 M SCG WACG WOPA

T1 T2 S1 S2 L S4 M S5 S6 L S8 R S9 S10

PLDI T3 T4 S3 S7

S1 S2 FLIC

R S1 S2 ICFP

T1 T2 R S1 S2 S3 S4 S5 S6 S7 S8 M S9 S10 PADS

R S1 S2 L D1 S4 S5 L D2

SPDT S3 S6 IOPADS NIM

23 Saturday, May 25 Sunday, May 26 Monday, May 27 Tuesday, May 28 morning afternoon evening morning afternoon evening morning afternoon evening morning afternoon evening P4 E P5 E FCRC

S Session Careers T Tutorial

D Panel Discussion ISCA

S1 S3 S6 S7 S8 S10 S11 A S2 A S4 S5 A A R A S9 B A S12 S13 M Meeting S1 S3 S6 S7 S8 S10 S11 B B B B B L A B P Plenaries S5 S6 S7 S8 S9 S10

E Exhibits METRICS TH CRA Town Hall

STOCReception ICS

S5 S6 S7 S8 S9 S10 S11 S12 M S13 S14 S15 L Lunch Complexity

S6 S7 S8 S9 S10 S11 S12 PODC Science Museum S5 S6 S7 S8 S9 S10 S11 S12 S13 SCG

S1 S3 S5 S6 S7 S8 S9 S10

S2 S4 WACG

S1 S2 L S4 S5 S6 L S8

S3 S7 WOPA PLDI FLIC

S3 S4 L S6 S7 S8 S9

S5 ICFP PADS SPDT

S1 S2 L S4

S3 IOPADS

S1 S2 S3 NIM

24 The 12th Annual ACM Symposium on Computational Geometry (SCG)

Sessions Committees

S8 9:40 am 2:25 pm Michael T. Goodrich A Polynomial-time Algorithm Approximating Monotone Johns Hopkins University Poster Session for Computing a Shortest Path Polygonal Curves Using the Conference Chair (Short Communications) of Bounded Curvature Amidst Uniform Metric Leonidas J. Guibas Moderate Obstacles Kasturi R. Varadarajan Stanford University Saturday, May 25, 1996 Jean-Daniel Boissonnat and Program Chair 4:05 pm – 5:45 pm Sylvain Lazard 2:50 pm Experimental Results of a Ran- Convex Drawings of Graphs in PROGRAM COMMITTEE domized Clustering Algorithm 10:05 am Two and Three Dimensions Pankaj K. Agarwal Mary Inaba, Hiroshi Imai and d1 -Optimal Motion for a Rod Marek Chrobak, Michael T. Goo- Duke University Naoki Katoh Tetsuo Asano, David Kirkpatrick drich and Roberto Tamassia and Chee K. Yap Imre Barany Hungarian Academy Animating Geometric Algo- 3:15 pm rithms over the Web 10:30 am Approximate Shortest Paths Marshall Bern James E. Baker, Isabel F. Cruz, Optimal Robot Localization in on a Convex Polytope in 3-d (Xerox PARC Giuseppe Liotta and Roberto Trees Kasturi R. Varadarajan Olivier Devillers Tamassia Kathleen Romanik and Sven INRIA, Sophia-Antipolis Schuierer 3:40 pm Coffee Break Simple Traversal of a Subdivi- Marc van Kreveld sion Without Extra Storage 10:55 am Coffee Break Utrecht University Mark de Berg, Marc van Kreveld, Jean-Claude Latombe René van Oostrum and Mark S12 Stanford University Overmars S10 Session 12 Chris Levcopoulos Lund University The Graph of Triangulations of Sunday, May 26, 1996 Session 10 Victor Milenkovic a Convex Polygon 4:05 pm - 5:20 pm F. Hurtado and M. Noy Sunday, May 26, 1996 University of Miami Imre Barany, Chair 11:20 am - 12:35 pm Joseph O’Rourke Hungarian Academy Partial Surface Matching by Marc van Kreveld, Chair Smith College Using Directed Footprints Utrecht University Nicholas Patrikalakis Gill Barequet and Micha Sharir 4:05 pm Monotonicity of Rectilinear MIT 11:20 am On the Sectional Area of Con- Geodesics in d-Space Gunter Rote Fast Randomized Point Loca- vex Polytopes Joonsoo Choi and Chee-Keng Technische Universitat Graz tion Without Preprocessing in D. Avis, P. Bose, T. Shermer, J. Yap Two-and Three-Dimensional Subhash Suri Snoeyink, G. Toussaint and B. Washington University Zhu Delaunay Triangulations 4:30 pm Ernst P. Mücke, Isaac Saias and Disk Packings and Planar Sep- Sue Whitesides Smallest Enclosing Cylinders Binhai Zhu arators McGill University Elmar Schomer, Jurgen Sellen, Daniel A. Spielman and Shang- Marek Teichmann and Chee Yap 11:45 am Hua Teng Fixed-Dimensional Linear Pro- Curve Based Stereo Matching gramming Queries Made Easy 4:55 pm Using the Minimum Hausdoff Timothy M. Chan Ramsey-Type Results for Geo- Distance metric Graphs Klara Kedem and Yana 12:10 pm Gyula Karolyi, Janos Pach and Yarmovski Pseudo-Triangulations: The- Geza Toth ory and Applications Approximate Geometric Michel Pocchiola and Gert Vegter Matching of 3d Bronchial Tree Structures S13 Chandrasekhar Pisupati, Lawrence Wolff, Wayne Mitzner S11 SCG/WACG Invited Talk and Elias Zerhouni Monday, May 27, 1996 Session 11 8:00 am - 9:00 am Sunday, May 26, 1996 David Dobkin S9 2:00 pm - 3:40 pm Princeton University Subhash Suri, Chair Session 9 Washington University Computational Geometry - Sunday, May 26, 1996 Where Did it Come From, 9:15 am – 10:55 am 2:00 pm What is it Good For? Improvements on Bottleneck Olivier Devillers, Chair Matching and Related Prob- INRIA, Sophia-Antipolis lems Using Geometry Alon Efrat and Alon Itai 9:15 am Algorithms to Compute the Convolution and Minkowski Sum Outer-Face of Two Simple Polygons G. D. Ramkumar

25 First ACM Workshop on Applied Computational Geometry (WACG)

Registration for the First Workshop on Applied Computational Geometry includes continental breakfasts, cof- Continental Breakfast fee breaks, and workshop proceedings. Student registration fee includes all of the above. The workshop is Daily sponsored by the ACM Special Interest Groups for Graphics (SIGGRAPH) and Algorithms & Computation 7:15 am – 8:00 am Theory (SIGACT). Room: Franklin Hall

Sessions

10:05 am S1 11:00 am S6 How Solid is Solid Modeling A beam-tracing algorithm for SCG/WACG Invited Talk Christoph Hoffmann MACHINE LEARNING, indoor radio propagation Purdue University VISION & COMPUTA- Steve Fortune Monday, May 27, 1996 AT & T Bell Labs TIONAL ROBOTICS 8:00 am - 9:00 am 11:40 am David Dobkin PANEL DISCUSSION on Monday, May 27, 1996 10:25 am Princeton University Robustness Issues 4:00 pm – 5:40 pm Extracting Geometric Informa- tion from Architectural Draw- Computational Geometry - Steve Fortune, Panel Chair Leo Guibas, Chair ings Where Did it Come From, AT & T Bell Labs Stanford University What is it Good For? Leo Guibas Brian Kernighan Stanford University 4:00 pm AT & T Bell Labs Franco Preparata Geometric Pattern Matching Chris Van Wyk S2 Brown University and Computer Vision Drew Dan Huttenlocher WACG Welcome Cornell University 10:45 am Coffee Break and Opening Remarks S5 Monday, May 27, 1996 4:40 pm 9:00 am – 9:20 am Manufacturing Geometric Problems in S8 Machine Learning Monday, May 27, 1996 1:50 pm – 3:40 pm David Dobkin and Dimitrios Geometric Software and S3 Gunopulos Visualization Chee Yap, Chair Princeton University Molecular Modeling New York University Tuesday, May 28, 1996 11:00 am – 12:50 pm Monday, May 27, 1996 5:00 pm 9:20 am – 10:40 am 1:50 pm Matching convex polygons and Joe Mitchell, Chair Computational Geometry in polyhedra, Allowing for Occlu- SUNY Stony Brook Ming Lin, Chair Design and Manufacturing sion Army Research Ofﬁce & UNC Michael J. Wozny 11:00 am Chapel Hill Ronen Basri Department of Commerce Weizmann Institute Using the visibility complex David Jacobs for radiosity computation 9:20 am 2:30 pm NEC R. Orti, F. Durand, S. Riviere and Smooth Surfaces for Multi- Applications of Computa- C. Puech Scale Shape Representation tional Geometry in Mechanical 5:20 pm IMAG-INRIA Herbert Edelsbrunner Engineering Design and Manu- Stably Placing Piecewise University of Illinois facturing Smooth Objects 11:20 am Michael Pratt Chao-Kuei Hung and Doug Ier- The CGAL kernel: A basis for 10:00 am National Institute of Standards & ardi geometric computation Geometric Manipulation of Technology University of Southern CA A. Fabri Flexible Ligands INRIA D. Halperin, L. Kavraki, J. 3:00 pm G. Gierzeman Latombe, R. Motwani, C. Shelton Utrecht Univ. and S. Venkatasubramanian Column-Based Strip Packing S7 using Ordered and Compliant L. Kettner and S. Schonherr Stanford University Freie Univ. Containment Geometric Applications I S. Schirra 10:20 am V. Milenkovic Univ. of Miami Tuesday, May 28, 1996 Max-Planck Institut fur Informatik Application of the Ray-Repre- 9:00 am – 10:45 am sentation to Problems of Pro- K. Daniels Harvard University Dinesh Manocha, Chair 11:40 am tein Structure and Function Univ. of N. Carolina, Chapel Hill PANEL DISCUSSION on Geo- Michael G. Prisant 3:20 pm metric Software & Visualiza- Duke University Computing a ﬂattest, under- 9:00 am tion Mark Overmars, Panel Chair 10:40 am Coffee Break cut--free parting line for a con- On Some Applications of Com- vex polyhedron, with putational Geometry in Virtual Utrecht University application to mold design Environments David Dobkin J. Majhi, P. Gupta and R. Janar- Joseph Mitchell Princeton University S4 dan SUNY Stony Brook D. T. Lee U. of Minnesota Northwestern University Solid Modeling and Geo- 9:35 am Kurt Mehlhorn metric Robustness 3:40 pm Coffee Break Geometric Issues Arising from Max-Planck-Institut fuer Informa- tik Monday, May 27, 1996 N-Manifold Geometry in BRL- 11:00 am – 12:50 pm CAD Michael Muuss Dinesh Manocha, Chair Army Research Laboratory Univ. of N. Carolina, Chapel Hill 26 First ACM Workshop on Applied Computational Geometry (WACG)

Sessions Committees

S9 Tony Woo 4:00 pm ADVISORY COMMITTEE University of Washington Issues in Geometric Toleranc- Herbert Edelsbrunner Geometric Applications II ing University of Illinois, Urbana 3:30 pm Chee Yap Michael Goodrich Tuesday, May 28, 1996 Triangle: Engineering a 2D New York University Johns Hopkins University 1:50 pm – 3:50 pm Quality Mesh Generator and Leo Guibas David Dobkin, Chair Delaunay Triangulator 4:40 pm Stanford University Princeton Jonathan Richard Shewchuk PANEL DISCUSSION Kurt Mehlhorn Carnegie-Mellon U. On the Future Trend of Geo- Max-Planck-Institut fuer Informatik, 1:50 pm metric Computing Germany Grid Generation for Computa- 3:50 pm Coffee Break Joseph Mitchell tional Field Simulation SUNY, Stony Brook Joe Thompson Committees Emo Welzl Mississippi State University S10 Fachbereich Mathematik, Freie Univer- Ming C. Lin sitat, Germany 2:30 pm Geometric Engineering U.S. Army Research Office & UNC- Chee Yap Computational Geometry Chapel New York University Tuesday, May 28, 1996 issues in VLSI Design Verifica- General Chair 4:00 pm – 5:40 pm PROGRAM COMMITTEE tion Dinesh Manocha David Dobkin V. T. Rajan Ming Lin, Chair University of North Carolina, Chapel Princeton University U.S. Army Research Office & Hill IBM T.J. Watson Research Center Leo Guibas UNC-Chapel Hill Program Chair Stanford University 3:00 pm Ming C. Lin Joe Mitchell Near Linear Time for Ray Trac- U.S. Army Research Office & UNC- SUNY, Stony Brook ing Chapel Hill Chee Yap Finance Chair New York University

ACM/UMIACS Workshop on Parallel Algorithms (WOPA)

Plenary Invited Speaker Registration for the 4th Workshop on Parallel Algorithms includes two lunches, continental breakfasts, an Daily excursion, and coffee breaks. Student registration fee includes all of the above except the excursion. The con- 8:00 — 9:00 am ference is sponsored by the University of Maryland Institute for Advanced Computer Studies (UMIACS) and Room: Salon F the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT). Grand Ballroom

Sessions

S1 S2 S3 S5

Session 1 Session 2 Session 3 Session 5 Saturday, May 25, 1996 Saturday, May 25, 1996 Saturday, May 25, 1996 Sunday, May 26, 1996 9:15 am – 10:45 am 11:00 am – 12:30 pm 2:15 pm – 3:15 pm 9:15 am – 10:45 am 9:15 am 11:00 am 2:15 pm 9:15 am Recent Developments in Paral- Estimation Algorithms for Efﬁ- Parallel Multisearch: Recent Building Parallel Machines: lel Asychronous Computing cient Parallel Query Process- Results and Open Problems How Useful Is Theory? (invited presentation) ing (invited presentation) (invited presentation) Michael O. Rabin (invited presentation) Mikhail J. Atallah Marc Snir Harvard University and Phillip B. Gibbons Purdue University IBM T. J. Watson Research Cen- Hebrew University AT&T Bell Laboratories ter 3:15 pm Coffee Break 10:15 am 12:00 pm 10:15 am Self-Stabilizing Synchroniza- Fine-Grain Parallelism: PRAM Programming and Analyzing tion Algorithms Parallel Algorithms in the Cilk Algorithms and Instruction- S4 Shlomi Dolev Level-Parallelism Multithreaded Language Ben-Gurion University of the Rimon Orni and Uzi Vishkin Session 4 Robert Blumofe, Matteo Frigo, Negev University of Maryland, Col- Charles E. Leiserson and Keith lege Park and Tel Aviv Univer- Saturday, May 25, 1996 Randall 10:45 am Coffee Break sity 3:45 pm – 4:45 pm The University of Texas at Aus- tin and MIT 3:45 pm Models, Algorithms and Archi- 10:45 am Coffee Break L tectures: Immediate Family or Distant Cousins? 12:30 pm – 2:00 pm (invited presentation) Luncheon Satish Rao NEC Research Institute

27 ACM/UMIACS Workshop on Parallel Algorithms (WOPA)

Sessions Committees

Uzi Vishkin Michael Rabin S6 2:15 pm Algorithm Design for Parallel University of Maryland and Tel Harvard University and Hebrew Aviv University University Session 6 Scientiﬁc Computation (invited presentation) General Chair Vijay Ramachandran Sunday, May 26, 1996 Gary Miller Joseph JaJa 11:00 am – 12:30 pm University of Texas at Austin Carnegie Mellon University University of Maryland 11:00 am John Reif Program Chair Duke University LogP Network Characteriza- 3:15 pm Coffee Break tion by Microbenchmarks Johanna Weinstein Burton Smith (invited presentation) University of Maryland Tera Computer David Culler S8 Publicity and Publications Chair Leslie Valiant University of California at Ber- Harvard University keley Session 8 Johanna Weinstein University of Maryland 12:00 pm Sunday, May 26, 1996 Finance Chair STEERING COMMITTEE Communication-Efﬁcient 3:15 pm – 4:45 pm Richard Cole Bulk-Synchronous Parallel 3:45 pm ADVISORY COMMITTEE New York University Computing The Random-Adversary Tech- Richard Karp Zvi Kedem Michael T. Goodrich nique University of California at Berke- New York University Johns Hopkins University ley Philip D. MacKenzie Alan Siegel Sandia National Laboratories Ken Kennedy New York University Rice University Uzi Vishkin L 4:15 pm How Can We Demonstrate Kurt Mehlhorn University of Maryland and Tel Max Planck Institute Aviv University 12:30 pm – 2:00 pm Increasing Parallel Complexi- Luncheon ties? Chuzo Iwamoto and Kazuo Iwama S7 Kyushu Institute of Design, Exhibits Japan Wednesday – Sunday Session 7 9:00 am – 6:00 pm Sunday, May 26, 1996 Room: Franklin Hall 2:15 pm – 3:15 pm

ACM SIGPLAN ‘96 Conference on Programming Language Design and Implementation (PLDI)

Registration for the ACM SIGPLAN ‘96 Conference on Programming Language Design and Implementation Plenary Invited Speaker includes three continental breakfasts, two lunches, a joint reception with ICFP, an evening excursion, coffee Daily breaks, and conference proceedings. Student registration includes all of the above except for the evening 8:00 — 9:00 am excursion. The conference is sponsored by the ACM Special Interest Group on Programming Languages (SIG- Room: Salon F PLAN). Grand Ballroom Registration for the full day of ACM SIGPLAN ‘96 tutorials includes a continental breakfast, lunch, coffee breaks and tutorial notes. Registration for the morning tutorial includes a continental breakfast, a coffee break, and tutorial notes. Registration for afternoon tutorials includes a coffee break and tutorial notes.

Tutorials

Richard J. LeBlanc is a Professor T1 level architecture of correspond- Tuesday, May 21, 1996 ing software solutions. Object- and the Associate Dean of the 1:30 pm – 4:30 pm oriented design concepts will be College of Computing of the Richard J. LeBlanc Teaching C++ in Introduc- Georgia Institute of Technology. Georgia Institute of Technology described as a systematic means tory Courses of implementing the results of His current teaching and C++ is a large and complex lan- Tuesday, May 21, 1996 object-oriented analysis. Some research interests include object guage. It’s still a very reasonable 9:00 am – 12:00 pm popular analysis and design technology, in which he fre- choice for the first year of Com- techniques will be compared. quently teaches continuing edu- Object-Oriented Analysis and puter Science courses provided Design The presentation of these tech- cation courses. that careful choices are made niques will not depend on the This tutorial will introduce the 10:30 am Coffee Break about what parts of the language features of any particular pro- principles of object-oriented soft- For Tutorial T1 will be covered and what classes gramming language. ware development and provide are provided for student use. an overview of object-oriented This tutorial is intended for peo- 12:00 pm – 1:30 pm We’ll survey different approaches analysis and design techniques. ple who are familiar with tradi- Luncheon to using C++, discuss how to The basic concepts of object-ori- tional imperative style For full day tutorial registrants develop and manage C++ as a ented software, such as object, programming and who want to student’s first language, and dis- class, message and inheritance, learn about object technology. It T2 cuss practical methods for will be defined and discussed. will provide valuable language- instructors and students to get Object-oriented analysis will be independent skills for those who Owen Astrachan up-to-speed with C++ and presented as a way of modeling wish to begin programming in Duke University object-oriented programming. user requirements and the high- object-oriented languages. 28 ACM SIGPLAN ‘96 Conference on Programming Language Design and Implementation (PLDI)

Tutorials and Sessions

This tutorial is intended for any- guage design, semantics, and 10:00 am 2:30 pm one interested in practical infor- implementation. A Reduced Multipipeline Global Communication Analy- mation on how best to teach C++ 2:50 pm Coffee Break Machine Description that Pre- sis and Optimization in introductory Computer Sci- For Tutorials T2, T3 and T4. serves Scheduling Constraints Soumen Chakrabarti ence courses. The primary focus Alexandre E. Eichenberger and University of California, Berkeley will be on the ﬁrst course (CS1) Edward S. Davidson Manish Gupta and Jong-Deok with attention to the second, University of Michigan Choi data structures course (CS2). T4 IBM T.J. Watson Research Center Prior experience with C++ is not 10:30 am Coffee Break mandatory. Guy L. Steele Jr. 3:00 pm Sun Microsystems Laboratories Owen Astrachan is an Assistant GUM: A Portable Parallel Professor of the Practice of Com- Tuesday, May 21, 1996 S2 Implementation of Haskell puter Science, and Director of 3:10 pm – 4:30 pm P.W. Trinder, K. Hammond and Undergraduate Studies at Duke The Java Programming Lan- Testing and Veriﬁcation S.L. Peyton Jones University. He has been involved guage Glasgow University in Computer Science education Wednesday, May 22, 1996 J.S. Mattson Jr. Java is a small, simple, object- 11:00 am – 12:30 pm for many years, and has given oriented programming language Hewlett Packard numerous invited talks at edu- that is attracting a lot of interest Dirk Grunwald, Chair A.S. Partridge cation conferences and work- for use on the World Wide Web. University of Colorado University of Tasmania shops. Just as HTML allows Web users to access text with embedded 11:00 am 3:30 pm Coffee Break pictures, sound clips, and mov- Teapot: Language Support for T3 ies with a simple point-and-click Writing Memory Coherence interface, Java allows a Web user Protocols S4 Luca Cardelli to access programs: a mouse Satish Chandra, Brad Richards Digital Equipment Corporation click in a Java-capable browser and James Larus Program Analysis Tuesday, May 21, 1996 can retrieve and execute a pro- University of Wisconsin, Madison Wednesday, May 22, 1996 1:30 pm– 2:50 pm gram on a local machine. This 4:00 pm – 5:30 pm Object-based vs. Class-based simple concept raises important 11:30 am Languages language design issues, includ- Target-Sensitive Construction William Landi, Chair Siemens Corporate Research Class-based object-oriented pro- ing security, privacy, and of Diagnostic Programs for gramming languages take object authentication. We discuss the Procedure Calling Sequence 4:00 pm generators as central, while design of the Java language with Generators object-based languages empha- an emphasis on how the design Mark W. Bailey and Jack W. Data Flow Frequency Analysis size the objects themselves. choices make Java suitable for Davidson G. Ramalingam Class-based languages have its intended applications. University of Virginia IBM T.J. Watson Research Center become relatively well-under- This tutorial is intended for those stood, widely debated, and interested in using the Java pro- 12:00 pm 4:30 pm hugely popular. In contrast, the gramming language and those Replay For Concurrent Non- A New Framework for Exhaus- area of object-based languages is interested in the problems of Deterministic Shared Memory tive and Incremental Data still underdeveloped. Nonethe- programming language design. Applications Flow Analysis Using DJ Graphs less, object-based languages are Guy L. Steele Jr., is a Distin- Mark Russinovich, Bryce Vugranam Sreedhar and Guang Cogswell and Zary Segall Gao intrinsically simpler and more guished Engineer at Sun Micro- University of Oregon McGill University general than traditional class- systems Laboratories. His Yong-fong Lee based languages, and hold honors include ACM Grace Mur- Intel Corporation promise for the future of object- ray Hopper Award (1988), AAAI oriented programming. I discuss Fellow (1990), and ACM Fellow L these two categories of object- (1994). 5:00 pm oriented languages, giving them 12:30 pm – 2:00 pm Generalized Dominance and equal weight, and concentrating Luncheon Control Dependence on the variations and potentials S1 Gianfranco Bilardi of object-based languages. Universita di Padova This tutorial is intended for peo- Instruction Scheduling S3 Keshav Pingali ple interested in understanding Cornell University Wednesday, May 22, 1996 Parallelizing Compilers the principal concepts behind 9:30 am – 10:30 am object-oriented languages. Peo- Wednesday, May 22, 1996 Monica Lam, Chair ple interested in typed object-ori- 2:00 pm – 3:30 pm Stanford University M ented programming, but not just Kathryn S. McKinley, Chair C++, and in untyped object-ori- 9:30 am University of Massachusetts Report by the Program ented programming, but not just Chair Smalltalk. A general knowledge Software Pipelining Show- down: Optimal vs. Heuristic 2:00 pm Wednesday, May 22, 1996 of at least one class-based lan- Commutativity Analysis: A guage is assumed. Methods in a Production Com- 5:30 pm – 6:00 pm piler New Analysis Framework for Luca Cardelli is a senior com- Parallelizing Compilers Michael Burke, Program Chair John Ruttenberg and W. Licht- IBM Thomas J. Watson Research puter scientist at Digital Equip- Martin C. Rinard and Pedro C. enstein Center ment Corporation, Systems Silicon Graphics Diniz Research Center in Palo Alto. His G.R. Gao and A. Stouchinin University of California, Santa main interests are in type theory McGill University Barbara and operational semantics, mostly for applications to lan-

29 ACM SIGPLAN ‘96 Conference on Programming Language Design and Implementation (PLDI)

Sessions Committees

Charles N. Fischer University of Wisconsin, Madison S5 S7 R General Chair New Directions ML Joint Reception with Michael Burke Thursday, May 23, 1996 Thursday, May 23, 1996 ICFP IBM Thomas J. Watson Research Center 9:30 am – 10:30 am 2:00 pm – 3:30 pm Thursday, May 23, 1996 Program Chair Michael Burke, Chair Fritz Henglein, Chair 6:30 pm – 8:30 pm IBM Thomas J. Watson Research DIKU, University of Copenhagen Susan Horwitz Center University of Wisconsin, Madison S9 2:00 pm Tutorials Chair 9:30 am Simple Objects for Standard Friday, May 24, 1996 Linda Torczon Practical Program Analysis ML 9:30 am – 11:00 am Using General Purpose Logic John Reppy and Jon Riecke Rice University Programming Systems AT&T Bell Laboratories Robert Halstead, Chair Finance Chair Steven Dawson, C.R. DEC Cambridge Research Lab Ramakrishnan and David S. 2:30 pm ADVISORY COMMITTEE Warren TIL: A Type-Directed Optimiz- 9:30 am Barbara Ryder SUNY, Stony Brook ing Compiler for ML Static Debugging: Browsing Rutgers University D. Tarditi, G. Morrisett, P. the Web of Program Invariants Mary Lou Soffa 10:00 am Cheng, C. Stone, R. Harper and Cormac Flanagan, K. Shriram, University of Pittsburgh Efﬁcient and Language-Inde- P. Lee Stephanie Weirich and Matthias pendent Mobile Programs Carnegie Mellon University Felleisen Marc Shapiro Ali-Reza Adl-Tabatabai, Geoff Rice University University of Wisconsin, Madison Langdale, Steven Lucco and 3:00 pm Robert Wahbe Flow-directed Inlining 10:00 am PROGRAM COMMITTEE Carnegie Mellon University Suresh Jagannathan and Source-Level Debugging of Preston Briggs Andrew Wright Scalar Optimized Code Tera Computer 10:30 am Coffee Break NEC Research Institute Ali-Reza Adl-Tabatabai and Tho- Michael Burke mas Gross Carnegie Mellon University IBM Thomas J. Watson Research 3:30 pm Coffee Break Center S6 10:30 am Robert Cartwright Static Detection of Dynamic Rice University Run-time Code Genera- S8 tion Memory Errors Dirk Grunwald David Evans University of Colorado Thursday, May 23, 1996 Currying/Partial Evalua- M.I.T. Laboratory for Computer 11:00 am – 12:30 pm tion Robert Halstead Science DEC Cambridge Research Lab Bernhard Steffen, Chair Thursday, May 23, 1996 University of Passau 4:00 pm – 5:30 pm 11:00 am Coffee Break Fritz Henglein DIKU, University of Copenhagen Room: 11:00 am Wen-mei Hwu Tom Reps, Chair Optimizing ML with Run- University of Illinois University of Wisconsin, Madison S10 Time Code Generation Monica Lam Peter Lee and Mark Leone 4:00 pm Implementation Tech- Stanford University Carnegie Mellon University Realistic Compilation by Par- niques William Landi 11:30 am tial Evaluation Friday, May 24, 1996 Siemens Corporate Research M. Sperber and P. Thiemann 11:30 am – 1:00 pm Fast, Effective Dynamic Com- Mark Linton Universitaet Tuebingen pilation Robert Cartwright, Chair Silicon Graphics J. Auslander, M. Philipose, C. Rice University 4:30 pm Kathryn S. McKinley Chambers, S. Eggers and B. Ber- University of Massachusetts shad Data Specialization 11:30 am University of Washington T. Knoblock and E. Ruf Simple Garbage-Collector- Tom Reps Microsoft Research Safety University of Wisconsin, Madison 12:00 pm Hans-J. Boehm Bernhard Steffen VCODE: a Retargetable, Exten- 5:00 pm Xerox PARC University of Passau sible, Very Fast Dynamic Code Relocating Machine Instruc- Generation System tions by Currying 12:00 pm Dawson R. Engler Norman Ramsey Representing Control in the M.I.T. Laboratory for Computer Purdue University Presence of One-Shot Continu- Science ations 5:30 pm - 6:00 pm Carl Bruggeman, Oscar Waddell Open SIGPLAN Meeting and R. Kent Dybvig L Indiana University

12:30 pm – 2:00 pm 12:30 pm Luncheon Printing Floating-Point Num- bers Quickly and Accurately Robert G. Burger, R. Kent Dybvig Indiana University 30 Workshop of Functional Languages in Introductory Computing (FLIC)

Registration for the workshop includes morning coffee break. The ﬁrst 50 registrants will receive a free copy of This Workshop is part of The Little Schemer, 4th edition, courtesy of MIT Press. The workshop is sponsored by ACM SIGPLAN, NEC ICFP, with an additional Research, and MIT Press, and is held in conjunction with the International Conference on Functional Pro- fee of $50. gramming.

Sessions

10:05 am 11:20 am Welcome S1 Over the past ten years, Scheme Teaching Computation The- Programming Languages and has rapidly become the program- Session 1 ory Of and With Scheme Techniques ming language of choice for Albert Meyer Carl Gunter Friday, May 24, 1996 many introductory computing MIT University of Pennsylvania 9:15 am – 11:05 am courses. Other functional languages, especially SML and Matthias Felleisen, Chair 10:35 am 11:50 am Haskell, have recently been Rice University Scheme in Pre-College Class- CAML at ENS adopted at a number of universi- rooms Guy Cousineau ties. Approximately 50 depart- 9:15 am Ian Ferguson ments in the US and 95 world- Welcome Schemer’s Inc. wide use functional languages as Matthias Felleisen 12:20 pm their introductory programming Rice University 11:05 am Coffee Break An FP-based Series of Under- languages. Some 20 secondary graduate Lectures using Gofer schools in the US have courses 9:20 am S. Doaitse Swierstra based on the functional philoso- Programming as a Medium for S2 University of Utrecht phy. All preparatory schools in Teaching France use CAML. Gerald J. Sussman Session 2 This workshop will present MIT Friday, May 24, 1996 speakers who discuss their expe- Daniel P. Friedman 11:20 am – 12:50 pm rience with using Scheme, SML, Indiana University Exhibits Christopher Haynes, Chair and Haskell in the introductory Wednesday – Sunday curriculum. They will report on Indiana University successes, recent changes, and 9:00 am – 6:00 pm the relationship of their courses Room: Franklin Hall to other parts of the curriculum.

ACM SIGPLAN International Conference on Functional Programming (ICFP)

Plenary Invited Speaker Registration for the International Conference on Functional Programming includes a reception (held jointly Daily with PLDI), an evening excursion, one luncheon, continental breakfasts, coffee breaks, and conference proceedings. Student registration includes all of the above except the evening excursion. The conference is spon- 8:00 — 9:00 am sored by ACM SIGPLAN in cooperation with IFIP Working Group 2.8. Room: Salon F Grand Ballroom

Sessions

5:00 pm Simon Peyton Jones, Will Partain R S2 Storage use analysis and its and André Santos applications University of Glasgow Joint Reception with Session 2 Manuel Serrano University of Montreal & INRIA PLDI 2:30 pm Friday, May 24, 1996 Rocquencourt Thursday, May 23, 1996 A reflection on call-by-value 4:00 pm – 5:30 pm Marc Feeley 6:30 pm – 8:30 pm Amr Sabry Olin Shivers, Chair University of Montreal Chalmers University MIT Philip Wadler S1 University of Glasgow 4:00 pm S3 Lag, drag, void and use -- Session 1 3:00 pm space-efficient compilation Session 3 Friday, May 24, 1996 Functional back-ends within Colin Runciman and Niklas 2:00 pm – 3:30 pm the lambda-sigma-calculus Röjemo Saturday, May 25, 1996 Olivier Danvy, Chair Thèrése Hardin University of York 9:30 am – 10:30 am Aarhus University LITP and INRIA Rocquencourt Paul Hudak, Chair Luc Maranget 4:30 pm Yale University 2:00 pm INRIA Rocquencourt Static and dynamic partition- Let-floating: Moving bindings Bruno Pagano ing of pointers as links and 9:30 am LITP and INRIA Rocquencourt to give faster programs threads The role of lazy evaluation in David S. Wise and Joshua Wal- amortized data structures 3:30 pm Coffee Break genbach Chris Okasaki Indiana University Carnegie Mellon University 31 ACM SIGPLAN International Conference on Functional Programming (ICFP)

Sessions Committees

10:00 am 2:30 pm S8 Robert Harper Deriving structural hylomor- Simplifying subtyping con- Carnegie Mellon University phisms from recursive defini- straints Session 8 General Chair tions François Pottier R. Kent Dybvig Sunday, May 26, 1996 Zhenjiang Hu, Hideya Iwasaki ENS Paris & INRIA Rocquencourt Indiana University 11:00 am – 12:30 pm and Masato Takeichi Program Chair University of Tokyo 3:00 pm John Reppy, Chair Complexity of kernel Fun sub- AT&T Research Robert Kessler 10:30 am Coffee Break type checking University of Utah Giorgio Ghelli 11:00 am Finance Chair Universita’ di Pisa A theory of weak bisimulation S4 for core CML ADVISORY COMMITTEE 3:30 pm Coffee Break William Ferreira, Matthew Hen- Arvind Session 4 nessy and Alan Jeffrey MIT Sussex University Saturday, May 25, 1996 Robert Kessler Utah 11:00 am – 12:30 pm S6 11:30 am John Launchbury, Chair Robert Harper Session 6 A provable time and space effi- Oregon Graduate Institute cient implementation of NESL Carnegie Mellon Saturday, May 25, 1996 Guy E. Blelloch and John Simon Peyton-Jones 11:00 am 4:00 pm – 5:30 pm Greiner Glasgow Analysis and caching of depen- Matthias Felleisen, Chair Carnegie Mellon University Guy L. Steele, Jr. dencies Rice University Martín Abadi 12:00 pm Sun Microsystems Digital Systems Research Center 4:00 pm Synchronous Kahn networks John Williams Butler Lampson The semantics of Scheme with Paul Caspi and Marc Pouzet IBM Microsoft future VERIMAG Jean-Jacques Lévy Luc Moreau PROGRAM COMMITTEE INRIA Rocquencourt University of Southampton Luca Cardelli DEC 11:30 am S9 4:30 pm Olivier Danvy Optimality and inefficiency: First-class synchronization Session 9 Aarhus University What isn’t a cost model of the barriers Sunday, May 26, 1996 Matthias Felleisen lambda calculus? Franklyn Turbak 2:00 pm – 3:30 pm Rice University Julia L. Lawall Wellesley College IRISA Andrew Wright, Chair Richard Gabriel Harry G. Mairson 5:00 pm NEC Research ParcPlace Brandeis University pHluid: The design of a parallel Paul Hudak functional language imple- 2:00 pm Yale University 12:00 pm Enriching the lambda calculus mentation John Launchbury Inductive, coinductive, and with contexts: Toward a the- Cormac Flanagan Oregon Graduate Institute pointed types Rice University ory of incremental program Brian T. Howard Rishiyur S. Nikhil construction Peter Lee Kansas State University Digital Equipment Corporation Shinn-Der Lee and Daniel P. Carnegie Mellon University Friedman Atsushi Ohori Indiana University Kyoto University L S7 2:30 pm Didier Remy INRIA 12:30 pm – 2:00 pm Sharing code through first- Sessions 7 John Reppy Luncheon class environments Sunday, May 26, 1996 Christian Queinnec AT&T 9:30 am – 10:30 am Ecole Polytechnique & INRIA Roc- Olin Shivers S5 Peter Lee, Chair quencourt MIT David DeRoure Carnegie Mellon University Andrew Wright Session 5 University of Southampton NEC Saturday, May 25, 1996 9:30 am 2:00 pm – 3:30 pm Cogen in six lines 3:00 pm Mixin modules Didier Rémy, Chair Peter Thiemann INRIA Universität Tübingen Dominic Duggan and Constanti- nos Sourelis University of Waterloo 2:00 pm 10:00 am A new look to pattern match- A probabilistic approach to the ing in abstract data types problem of automatic selec- Pedro Palao Gostanza, Ricardo tion of data representations Peña Marí and Manuel Núñez Tyng-Ruey Chuang and Wen L. Garcia Hwang Universidad Complutense de Academia Sinica Madrid 10:30 am Coffee Break

32 10th ACM Workshop on Parallel and Distributed Simulation (PADS)

Plenary Invited Speaker Registration for the 10th Workshop on Parallel and Distributed Simulation (PADS’96) includes a reception, an Daily evening excursion, the PADS business meeting, continental breakfasts, coffee breaks, and conference proceedings. Student registration fee includes all of the above except the reception and evening excursion. The 8:00 — 9:00 am conference is sponsored by the ACM Special Interest Group on Simulation (SIGSIM), the IEEE Computer Room: Salon F Society Technical Committee on Simulation, and the Society for Computer Simulation. Grand Ballroom

Sessions and Tutorials

Distributed Interactive Simula- Researchers in the parallel dis- Herve Avril and Carl Tropper T1 tion (DIS) is an infrastructure for crete event simulation commu- McGill University, CA building large-scale virtual nity with no prior knowledge of Richard Fujimoto worlds from a set of independent DIS or the HLA are particularly College of Computing simulator nodes. DIS is encouraged to attend. Georgia Institute of Technology S3 intended to support a mixture of Tuesday, May 21, 1996 simulation types: real-time, 9:00 am – 12:00 pm human-in-the-loop “virtual” sim- R Applications I: ATM and Network Simulation Parallel Discrete Event Sim- ulations; real platforms includ- ulation ing “live” systems, sensors, and Reception Wednesday, May 22, 1996 Discrete event simulation is tactical links; and event driven Tuesday, May 21, 1996 2:00 pm – 3:30 pm widely used in the design and wargames, known as “construc- 7:00 pm – 9:00 pm Samir R. Das, Chair evaluation of complex systems tive” simulations. While DIS is University of Texas at San Anto- and processes, e.g., large com- being developed by the Depart- nio puter systems, communication ment of Defense to support S1 networks, air traffic systems, training, DIS goes far beyond 2:00 pm military applications. The DIS and battlefield strategies, to Welcome and Keynote Conservative Parallel Simula- technology is applicable to trans- mention a few. The goal of this Address tion of ATM Networks tutorial is to introduce research- portation, medicine, education, emergency management, and Wednesday, May 22, 1996 John G. Cleary and Jya-Jang ers and practitioners to the cur- Tsai entertainment, to name just a 9:20 am – 10:50 am rent state of the art concerning University of Waikato, NZ the execution of discrete event few. Mary L. Bailey, Chair University of Arizona simulation programs on parallel The next generation of DIS is 2:30 pm computers. The tutorial will first known as the High Level Archi- 9:30 am Massively Parallel Simulation review fundamental concepts in tecture (HLA). The HLA is a of Asynchronous Transfer PADS Keynote Address discrete event simulation. Clas- framework into which specific Mode (ATM) Systems Ten Years of PADS: sical synchronization algorithms simulation architectures can be Krishnan Kumaran Where We’ve Been, Where such as the Chandy/Misra/Bry- defined. Like DIS, it is based on Rutgers University We’re Going ant “null message” algorithm a composable approach to con- Boris Lubachevsky and Jefferson’s “Time Warp” pro- struct federations of autono- Richard M. Fujimoto AT&T Bell Labs tocol will be discussed, as well as mous simulations. HLA Georgia Institute of Technology more recent algorithms and establishes the rules that must 3:00 pm techniques. Work concerning be followed to achieve proper 10:50 am Coffee Break Parallel Simulation of a High- other important issues related to interactions of simulations dur- Speed Wormhole Routing Net- parallel execution (e.g., memory ing a federation execution. It work management and load balanc- includes means for specifying S2 ing) will also be described, as object models to achieve interop- Rajive Bagrodia, Mario Gerla, Bruce Kwan, Jay Martin, Pras- well as experiences in utilizing erability among simulations, a Techniques I: Load Bal- asth Palnati and Simon Walton this technology. Algorithms set of interface definitions and a ancing in Parallel Simula- University of California at Los exploiting temporal parallelism Run Time Infrastructure (RTI) Angeles to simulate systems such as for managing the execution of tion cache memories and queueing the federation. Wednesday, May 22, 1996 3:30 pm Coffee Break networks will be discussed, as This tutorial will present an over- 11:10 am – 12:40 pm well as current trends in the view of DIS and the HLA, and Stephen J. Turner, Chair field. discuss differences between University of Exeter, UK Researchers interested in the work in these fields and the high S4 high performance parallel dis- performance parallel discrete 11:10 am crete event simulation field, and event simulation community. PADS, DIS, and the DoD Experiments in Automated High Level Architecture: practioners with large scale sim- Fundamental design principals Load Balancing What is PADS’ Role? ulation problems that could ben- and concepts in DIS such as Linda F. Wilson efit from concurrent execution. autonomy of simulation nodes NASA Wednesday, May 22, 1996 No prior knowledge of discrete and dead reckoning will be David M. Nicol 3:50 pm – 5:20 pm event simulation is assumed. described. The central compo- College of William and Mary Richard M. Fujimoto, Chair nents of the HLA will be Georgia Institute of Technology described, with particular 11:40 am T2 emphasis on object model tem- Background Execution of Time 3:50 pm plates and services provided by Warp Programs Presenter to be determined the RTI. Time Management in the DoD Organized by Richard Fujimoto Christopher D. Carothers and High Level Architecture Researchers and practitioners Richard M. Fujimoto Richard M. Fujimoto Tuesday, May 21, 1996 interested in on-going work to Georgia Institute of Technology 1:00 pm – 4:00 pm Georgia Institute of Technology enable interoperability among Richard Weatherly Distributed Interactive Sim- separately developed simulations 12:10 pm MITRE Corporation ulation and the High Level in geographically distributed The Dynamic Load Balancing Architecture computing environments. of CTW for Logic Simulation

33 10th ACM Workshop on Parallel and Distributed Simulation (PADS)

Sessions

4:20 pm 11:40 am 12:10 pm S9 Panel Discussion Hierarchical Strategy of Improving Conservative VHDL Richard M. Fujimoto, Moderator Model Partitioning for VLSI- Potpourri: Languages, Simulation Performance Georgia Institute of Technology Design Using an Improved Joel F. Hurford and Thomas C. Mixture of Experts Approach Models, and Algorithms Hartrum K. Hering, R. Haupt, and Th. Friday, May 24, 1996 Air Force Institute of Technology Villmann 9:20 am – 10:50 am S5 Universitaet Leipzig, DE Bruno R. Preiss, Chair 12:30 pm Techniques II: State-Sav- University of Waterloo, CA On Extending More Parallelism 12:10 pm to Serial Simulators ing and Synchronization The APOSTLE Simulation Lan- David Nicol in Optimistic Simulation 9:20 am guage: Performance Data and Design of High Level Model- College of William and Mary Thursday, May 23, 1996 Granularity Control ling/High Performance Simu- Philip Heidelberger 9:20 am – 10:50 am Paul Wonnacott and David lation Environments IBM T. J. Watson Research Center Rajive Bagrodia, Chair Bruce Bernard P. Zeigler and Doohwan University of California at Los Defence Research Agency, UK Kim Angeles University of Arizona Committees 9:20 am S7 9:50 am Transparent Incremental State Queueing Models and Stabil- Saving in Time Warp Parallel Applications II: Logic ity of Message Flows in Dis- Mary L. Bailey Discrete Event Simulation and Circuit Simulation tributed Simulators of Open University of Arizona Queueing Networks General Chair Robert Ronngren, Michael Liljen- Thursday, May 23, 1996 stam and Rassul Ayani Manish Gupta, Anurag Kumar 2:00 pm – 3:30 pm Wayne M. Loucks and Bruno R. Royal Institute of Technology, SE and Rajeev Shorey Preiss Johan Montagnat Rassul Ayani, Chair Indian Institute of Science (Ban- University of Waterloo, CA Ecole National Superieure de Royal Institute of Technology, SE galore), IN Program Chair Cachan, FR 2:00 pm 10:30 am STEERING COMMITTEE 9:50 am Conservative Circuit Simula- Discrete-Event Simulation and Mary L. Bailey Automatic Incremental State tion on Shared-Memory Multi- the Event Horizon, Part 2: University of Arizona processors Adel S. Elmaghraby Saving Event List Management University of Louisville Darin West Joerg Keller, Thomas Rauber, Jeff Steinman Richard M. Fujimoto Science Applications International and Bernd Rederlechner Jet Propulsion Laboratory Georgia Institute of Technology Corporation Universitaet des Saarlandes, DE C. Michael Overstreet Kiran Panesar 10:50 am Coffee Break Old Dominion University Georgia Institute of Technology 2:30 pm Steve J. Turner Actor Based Parallel VHDL University of Exeter, UK Brian W. Unger Simulation Using Time Warp 10:20 am S10 University of Calgary, CA Reducing Synchronization Venkatram Krishnaswamy and Prithviraj Banerjee Overhead in Parallel Simula- Short Papers PROGRAM COMMITTEE tion University of Illinois D. K. Arvind Friday, May 24, 1996 Ulana Legedza and William E. Edinburgh University, UK Weihl 3:00 pm 11:10 am – 12:50 pm R. Ayani Massachusetts Institute of Tech- Optimistic Simulation of Par- John G. Cleary, Chair Royal Institute of Technology, SE allel Architectures Using Pro- R. Bagrodia nology University of Waikato, NZ University of California at Los Angeles gram Executables R. D. Chamberlain 10:50 am Coffee Break Sashikanth Chandrasekaran 11:10 am Washington University and Mark D. Hill A Performance Evaluation J. G. Cleary University of Wisconsin Methodology for Parallel Simu- University of Waikato, NZ lation Protocols S. R. Das S6 3:30 pm Coffee Break University of Texas at San Antonio Vikas Jha and Rajive Bagrodia R. M. Fujimoto Techniques III: Granular- University of California at Los Georgia Institute of Technology ity and Partitioning in Angeles A. G. Greenberg Parallel Simulation S8 AT&T Bell Labs 11:30 pm P. Heidelberger Thursday, May 23, 1996 Work In Progress Estimating the Cost of Throt- IBM T. J. Watson Research Center 11:10 am – 12:40 pm D. Nicol Thursday, May 23, 1996 tled Execution in Time Warp College of William and Mary Wayne M. Loucks, Chair 3:50 pm – 5:20 pm Samir R. Das V. Rego University of Waterloo, CA University of Texas at San Anto- Purdue University Phil A. Wilsey, Chair nio J. S. Steinman 11:10 am University of Cincinnati Jet Propulsion Laboratory and Califor- Concurrency Preserving Parti- 11:50 pm nia Institute of Technology tioning (CPP) for Parallel Logic S. J. Turner Parallel Simulation of Billiard University of Exeter, UK Simulation M Balls using Shared Variables B. W. Unger Hong K. Kim and Jack Jean Peter McKenzie and Carl Trop University of Calgary, CA Wright State University PADS Business Meeting per P. A. Wilsey Thursday, May 23, 1996 McGill University, CA University of Cincinnati 5:20 pm – 6:20 pm

34 ACM SIGMETRICS Symposium on Parallel and Distributed Tools (SPDT)

Plenary Invited Speaker Registration for the SIGMETRICS Symposium on Parallel and Distributed Tools includes an evening recep- Daily tion, two lunches, continental breakfasts, coffee breaks, and conference proceedings. Student registration fee includes all of the above. The conference is sponsored by the ACM Special Interest Group on Measurement 8:00 — 9:00 am and Evaluation. Room: Salon F Grand Ballroom

Sessions

Peter A. Buhr 3:20 pm Coffee Break R L University of Waterloo Martin Karsten 12:40 pm – 2:00 pm Reception Universitaet Mannheim Tuesday, May 21, 1996 Luncheon D2 7:00 pm – 10:00 pm 10:40 am Coffee Break New Frontiers, or Back S3 to the Future S1 Performance Monitoring S5 Thursday, May 23, 1996 Performance Tuning Wednesday, May 22, 1996 3:45 pm – 5:00 pm 2:00 pm – 3:20 pm Performance Analysis Dan Reed, Moderator Wednesday, May 22, 1996 University of Illinois, Urbana- 9:20 am – 10:40 am Bert Halstead, Chair Thursday, May 23, 1996 DEC Cambridge Research Lab 10:45 am – 12:30 pm Champaign Barton Miller, Chair University of Wisconsin Diane Rover, Chair Execution Analysis of DSM Michigan State University Applications: A Distributed Performance Tuning with Car- and Scalable Approach nival Automatic Performance Pre- Committees Lionel Brunie, Laurent Lefevre Wagner Meira Jr., Thomas J. diction to Support Cross and Olivier Reymann Development of Parallel Pro- LeBlanc and Alexander Poulos Ecole Normale Superieure de Barton Miller University of Rochester grams University of Wisconsin-Madison Lyon Matthias Schumann General Chair An On-line Computation of Technische Universitaet The SHRIMP Performance Critical Path Proﬁling Muenchen Joan Francioni Monitor: Design and Applica- University of Southwestern Loui- Jeffrey K. Hollingsworth tions siana University of Maryland, College Three Performance Tool Margaret Martonosi, Douglas W. Park Design Issues and CHITRA’s Daniel Reed Clark and Malena Mesarina Solutions University of Illinois, Urbana- Princeton University 10:40 am Coffee Break Marc Abrams, Randy Ribler and Champaign Anup Mathur Program Chairs 3:20 pm Coffee Break Virginia Polytechnic Institute and State University PROGRAM COMMITTEE S2 Al Geist D1 Event Graph Visualization for Oak Ridge National Lab Debugger Techniques Debugging Large Applications Cherri Pancake Wednesday, May 22, 1996 Tools: What’s Right, Dieter Kranzlmueller and Jens Oregon State University 10:55 am – 12:40 pm What’s Wrong Volkert Bert Halstead Johannes Kepler University Linz DEC Cambridge Res. Lab Al Malony, Chair Wednesday, May 22, 1996 Doug Pase University of Oregon 3:45 pm – 5:00 pm IBM Power Parallel Systems Doug Kimelman Event and State-Based Debug- Joan Francioni, Moderator L IBM T.J. Watson Res. Center ging in TAU: A Prototype University of Southwest Louisi- ana 12:30 pm – 2:00 pm Mendel Rosenblum Sameer Shende, Janice Cuny, Stanford University Lars Hansen, Joydip Kundu, Luncheon Stephen McLaughry and Odile Allen Malony Wolf University of Oregon University of Oregon S4 S6 Diane Rover Michigan State University Debugger Architectures Debugging Race Conditions in Debugger Interfaces John Mellor-Crummey Message-Passing Programs Thursday, May 23, 1996 Thursday, May 23, 1996 Rice University Robert H.B. Netzer and Timothy 9:20 am – 10:30 am 2:00 pm – 3:20 pm Karsten Schwan W. Brennan Georgia Tech Doug Kimelman, Chair Doug Pase, Chair Brown University IBM T.J. Watson Research Center Robert Netzer Suresh K. Damodaran-Kamal IBM Power Parallel Systems Brown University Convex Computer Corp. Jerry Yan Experiences with Building Dis- The Mantis Parallel Debugger tributed Debuggers NASA Ames Research Center Steven S. Lumetta and David E. Debugging Heterogeneous Michael S. Meier, Kevan L. Miller, Applications with Pangaea Culler Donald P. Pazel and Josyula R. University of California, Berkeley Leesa Hicks and Francine Ber- Rao man IBM T.J. Watson Research Center LOCAL ARRANGEMENTS The p2d2 Project: Building a University of California, San Jeffrey Hollingsworth Portable Distributed Debugger Diego KDB: A Multi-Threaded Debug- University of Maryland, College ger for Multi-Threaded Appli- Robert Hood Park cations NASA Ames Research Center

35 4th Annual ACM/IEEE Workshop on I/O in Parallel and Distributed Systems (IOPADS)

Registration for the Fourth Annual Workshop on I/O in Parallel and Distributed Systems (IOPADS) includes Continental Breakfast proceedings published by ACM Press, technical sessions, continental breakfast, lunch, and coffee breaks. Daily Student registration fee includes all of the above. The conference is sponsored by ACM SIGACT, ACM 7:15 am – 8:00 am SIGARCH, ACM SIGOPS, and IEEE TCOS, in cooperation with ACM SIGMETRICS. Room: Franklin Hall

Sessions Committees

2:30 pm David Kotz S1 11:00 am Evaluating Approximately Bal- HFS: A Performance-Oriented Dartmouth College Applications and Lan- anced Parity-Declustered Data Flexible File System Based on General Chair Building-Block Compositions guage Support Layouts for Disk Arrays Thomas H. Cormen Eric J. Schwabe, Ian M. Suther- Orran Krieger and Michael Dartmouth College Monday, May 27, 1996 land and Bruce K. Holmer Stumm General Chair 9:00 am – 10:30 am Northwestern University University of Toronto Ravi Jain Charles Koelbel, Chair Bellcore Rice University 11:30 am 3:00 pm ENWRICH: A Compute-Proces- Scalable Message Passing in General Chair 9:00 am sor Write Caching Scheme for Panda Alok Choudhary Efﬁcient Data-Parallel Files via Parallel File Systems Y. Chen, M. Winslett, K. E. Sea- Syracuse University Automatic Mode Detection Apratim Purakayastha and mons, S. Kuo, Y. Cho and M. Program Chair Subramaniam Jason A. Moore Carla Schlatter Ellis Duke University University of Illinois Thomas H. Cormen Oregon State University Dartmouth College David Kotz Philip J. Hatcher Publicity and Publications Chair University of New Hampshire Dartmouth College 3:30 pm Coffee Break Michael J. Quinn Thomas H. Cormen Oregon State University 12:00 pm Dartmouth College Prefetching in Segmented Disk S4 Finance Chair 9:30 am Cache for Multi-Disk Systems PROGRAM COMMITTEE Tuning the Performance of I/O Valery V. Soloviev Theory and Algorithms Sandra Johnson Baylor Intensive Parallel Applications North Dakota State University Monday, May 27, 1996 IBM T. J. Watson Anurag Acharya, Mustafa Uysal, 4:00 pm – 5:00 pm Robert Bennett, Assaf Mendel- Alok Choudhary Jeffrey Vitter, Chair Syracuse University son, Michael Beynon, Jeffrey K. L Hollingsworth, Joel Saltz and Duke University Thomas H. Cormen Alan Sussman Dartmouth College University of Maryland 12:30 pm – 2:00 pm 4:00 pm Denise Ecklund Luncheon Bounds on the Separation of Intel SSD 10:00 am Two Parallel Disk Models Garth Gibson The Design and Implementa- S3 Chris Armen Carnegie Mellon University tion of SOLAR, a Portable University of Hartford Charles Koelbel Library for Scalable Out-of- File Systems Rice University Core Linear Algebra Computa- David Kotz Monday, May 27, 1996 4:30 pm tions Dartmouth College 2:00 pm – 3:30 pm Structured Permuting in Place Sivan Toledo and Fred G. on Parallel Disk Systems Ethan Miller Gustavson David Womble, Chair Leonard F. Wisniewski University of Maryland, Baltimore IBM T. J. Watson Sandia National Laboratories Dartmouth College County Richard Muntz 10:30 am Coffee Break 2:00 pm UCLA Performance of the Galley Par- Daniel A. Reed allel File System University of Illinois at Urbana- S2 Nils Nieuwejaar and David Kotz Champaign Dartmouth College Jeffrey Vitter Caching and Architec- Duke University tural Issues John Wilkes Hewlett-Packard Laboratories Monday, May 27, 1996 David Womble 11:00 am – 12:30 pm Sandia National Laboratories John Wilkes, Chair Hewlett-Packard Laboratories

“Philadelphia is ranked as the safest of the nation’s 12 largest metropolitan areas.” A recent FBI Crime index

36 SIAM Symposium on Networks and Information Management (NIM)

Registration for the Symposium on Networks and Information Management includes continental breakfasts Continental Breakfast and coffee breaks. The Symposium on Networks and Information Management is sponsored by the Society Daily for Industrial and Applied Mathematics (SIAM) in cooperation with the Department of Computer and Informa- 7:15 am – 8:00 am tion Science, University of Pennsylvania Room: Franklin Hall

Sessions

searching one disk to searching S1 which research advances in the development of security fea- mathematics and computing the whole Internet. I will also dis- tures in a wide range of network cuss how to combine global data Session 1 are already having on the tele- services. (Joint work with Matt communications industry. with local processing to make Blaze and Jack Lacy.) Monday, May 27, 1996 10:30 am Coffee Break Internet access much more pro- 3:30 pm Coffee Break 9:30 am – 11:45 am ductive. Sampath Kannan, Chair 10:45 am 2:30 pm University of Pennsylvania Title to be determined Joan Feigenbaum S3 Van Jacobson AT&T Research 9:30 am Lawrence Berkeley Laboratory Managing Trust in Large Net- Panel Discussion Clyde Monma works Bellcore Monday, May 27, 1996 The speaker will identify the 3:45 pm – 5:15 pm Telecommunications Net- S2 “trust management problem” as work Design: Opportunities a distinct and important compo- Barry Leiner and Challenges for the Math- nent of security in network ser- ARPA ematical Sciences Session 2 vices. Aspects of the trust Henry Bayard The telecommunications indus- Monday, May 27, 1996 management problem include MITRE Corporation try is going through a period of 1:15 pm – 3:30 pm formulating security policies and Peter Weinberger very rapid change due to many Jill P. Mesirov, Chair security credentials, determining AT&T Research factors, including the impact of STSS, IBM whether particular sets of cre- The panel will discuss the future new and emerging technologies; Boston University dentials satisfy the relevant poli- the convergence of computing, of networks research and the cies, and specifying and role of mathematics and theoret- communications and entertain- 1:15 pm deferring trust to third parties. ment; and government regula- ical computer science in this Udi Manber Existing systems that support area. Panelists will include peo- tory policies in response to global University of Arizona security in networked applica- competition. ple from academia, industry, Finding Useful Information tions, including X.509 and PGP, and funding agencies. The current situation provides Through the Internet address only narrow subsets of the overall trust management an exciting opportunity for the Information is now available in problem and often do so in a mathematical and computa- vast amounts from numerous manner that is appropriate to tional sciences to make a signifi- diverse sources on every topic. only one application. This paper cant impact and to help shape But finding the right information presents a comprehensive PROGRAM ORGANIZERS: the future of the telecommunica- and figuring what to do with it is approach to trust management, Sampath Kannan tions industry. still hard. There is a great need based on a simple language for Department of Computer and This talk will describe some of for better tools to locate relevant specifying trusted actions and Information Science the opportunities and chal- information and process it. I will trust relationships. It also University of Pennsylvania lenges for researchers in this discuss several new search and describes a prototype implemen- Jill Mesirov new environment. The talk will filtering systems we developed tation of a new “trust manage- Department of Computer Science also include some specific exam- (Glimpse, GlimpseHTTP, Warm- ment system,” called STSS, IBM ples illustrating the impact list, Siff, Harvest) ranging from “PolicyMaker,” that will facilitate Boston University

“From its bustling downtown streets to its numerous historic sites... Philadelphia can compete with almost anything Europe has to offer.” Cox News Service

“Best Restaurant City in America” Conde Nast Traveler

37 HOTEL

Philadelphia Marriott Hotel Advance Hotel 1201 Market Street Registration Deadline Philadelphia PA 19107 April 19, 1996 Phone: (215) 625-2900 FAX: (215) 625-6097 Location/Transportation Facts Connected to Pennsylvania Convention Center and Gallery Mall in downtown Philadelphia. Eight miles from Philadelphia International Airport. Two blocks from City Hall, six blocks from Independence Hall and four blocks from the cultural district.

From International Airport: Take I-95 North to 676 West to Broad Street exit. Left on Vine Street, right on 12th Street, right on Filbert Street. Hotel is on the left.

Climate In May, the average temperature is 53 to 73 degrees Fahrenheit. Average rainfall is 3.3 inches.

Accommodations Philadelphia’s newest convention hotel, The Philadelphia Marriott at 1201 Market Street, is conve- niently located in Center City, walking distance to shopping, cultural and historic attractions and eas- ily accessible by car or train. All FCRC sessions will take place at the Marriott.

Additional housing is available at the Holiday Inn Express, 1305 Walnut Street (two blocks from the Marriott) and at the Best Western Center City, 501 N. 22nd Street (approximately 13 blocks from the Marriott).

Dining/Entertainment Allie’s American Grille serves breakfast, lunch and dinner. Outdoor Cafe for breakfast, lunch and dinner. JW’s Steakhouse serves dinner. Lobby Bar, Atrium Lounge and Champions Restaurant and Sports Bar offer a variety of locations for your enjoyment.

Reading Terminal Market, next door to the Marriott, offers dozens of food stands with a variety of choices at low prices.

Services/Facilities/Shops Valet parking daily parking fee $20, Express Check-In, airline desk, car rental desk, gift shop, telecon- ferencing, safe-deposit boxes.

Child Care Attendees requiring child care should contact the hotel independently.

Recreational/Amusement Facilities Indoor pool, health club, sauna, whirlpool, game room. Tennis nearby.

Attractions Even before ACM was created, groups were meeting in Philadelphia. Founded in 1682 by William Penn, whose statue now looks over his city from atop City Hall, the First Continental Congress met at Car- penters’ Hall in 1774 and at the State House, later renamed Independence Hall, patriots declared independence in 1776.

World famous art exhibits at some of the world’s ﬁnest museums; a lively and colorful historic district; exciting new arts and entertainment venues; a renaissance along the Delaware River waterfront...all are part of the “new” Philadelphia.

The second largest city on the East Coast and the ﬁfth largest city in the U.S., Philadelphia is home to more than 1.6 million people, the metropolitan population is approximately 5.78 million.

The city’s cultural treasures line the Benjamin Franklin Parkway. Included are the art treasures of the Philadelphia Museum of Art; the great sculptures of the Rodin Museum; one of America’s leading science museums at the Franklin Institute Science Museum (site of FCRC Excursions on Wednesday and Saturday evenings); the world’s best dinosaur exhibit and natural history at the Academy of Natural Sciences; and the Free Library. The Pennsylvania Academy of the Fine Arts, the Philadelphia Museum of Art, the Rodin Museum and the Barnes Foundation in Merion, comprise the strongest collection of Impressionist paintings in the world outside of Paris.

Fairmount Park, the largest landscaped city park in the world, is graced by several historic mansions, a Japanese house and garden, a Horticulture Center, two outdoor theaters, the Philadelphia Zoo, and outstanding sculpture.

38 HOTEL REGISTRATION FORM

Reservation Request

Advance Deposit We would like to welcome you as a participant in FCRC ’96. You may make your reservation by con- Deadline April 19, 1996 tacting the hotel of your choice directly. Be sure to indicate you are attending FCRC to obtain the special conference rates. The room block will be held until April 19, 1996.

Philadelphia Marriott Hotel Conference Headquarters 1201 Market Street Philadelphia, PA 19107 (215) 625-2900 Fax: (215) 625-6097 ❑ Single $133 ❑ Triple $153 ❑ Double $133 ❑ Quad $173 ❑ Non-smoking room requested

Name A limited number of economy rate rooms have been set aside for Position/title attendees at the following nearby hotels. Organization

Address Holiday Inn Express City State Zip 1305 Walnut Street (two blocks from the Marriott) Philadelphia, PA 19107 Phone Fax (215) 735-9300 Fax: (215) 732-2682 ❑ Single $95 Arrival date ❑ Double, Triple, and Quad $100 Expected time of arrival AM/PM ❑ Non-smoking room requested Departure date Best Western Center City 501 N. 22nd Street (approximately 13 blocks from the Marriott) Philadelphia, PA 19130 (215) 568-8300 Fax: (215) 557-9448 ❑ Single $63 ❑ Double $69 ❑ Non-smoking room requested

Credit Authorization

Name Arrival Date Arrival Time

Credit card type ❑ American Express ❑ MasterCard ❑ Visa Credit card number Expiration date Print name as it appears on the card Signature

To avoid duplication, please do not mail in this form if you make your reservation by telephone or telefax.

PLEASE MAKE SURE ALL INFORMATION IS COMPLETE BEFORE SEALING ENVELOPE.

39 REGISTRATION FORM

Conference Selection

Please circle the appropriate amount(s), compute the total, and write it in the Conference Total box on the EARLY REGISTRATION next page. Check membership box and provide number if applicable. Refer to individual conference pages for DEADLINE APRIL 26, 1996 information about what is included in the fee for each conference. To the extent the facilities allow, attendees are free to attend technical sessions of other conferences being held at the same time as the conferences they are registered for.

Individual Conference Registration

Member Non-member Student By 4/26 After 4/26 By 4/26 After 4/26 By 4/26 After 4/26 1 Careers $136 $136 $136 $136 $124 $124 2 ISCA 325 405 415 495 100 125 Half day Tutorial 175 250 220 250 55 70 Full day Tutorial 250 300 310 375 100 125 ❑ ACM or IEEE membership #______3. ICS 330 405 385 460 125 175 Full day Tutorial 200 250 250 300 200 200 ❑ ACM membership #______4. METRICS 300 375 350 425 105 155 Tutorial with Conference 485 640 585 740 180 260 Tutorial only 225 280 275 330 85 120 ❑ ACM membership #______5. STOC 290 365 365 440 125 175 ❑ ACM membership #______6. Complexity 325 390 405 485 125 175 ❑ ACM, EATCS, or IEEE membership #______7. PODC 305 365 385 445 100 130 ❑ ACM membership #______8. SCG 270 310 310 350 125 155 ❑ ACM membership #______9. WACG 150 175 175 200 125 150 ❑ ACM membership #______10. WOPA 180 225 210 255 95 125 ❑ ACM membership #______11. PLDI 275 375 375 450 115 150

Cut along dotted line Half day Tutorial (T1 or T2 or (T3 and T4)) 55 75 75 90 30 40 Full day Tutorial (T1 and (T2 or (T3 and T4))) 110 150 150 175 60 80 ✂ ❑ ACM or IEEE membership #______12. ICFP 325 385 385 450 125 150 ❑ ACM membership #______13. FLIC 55 55 65 65 55 55 ❑ ACM membership #______14. PADS 290 340 340 390 125 150 Half day Tutorial 150 200 200 250 150 150 Full day Tutorial 280 380 380 480 280 280 ❑ ACM, SCS, or IEEE membership #______15. SPDT 240 270 260 295 105 130 ❑ ACM membership #______16. IOPADS 150 180 195 235 50 60 ❑ ACM or IEEE membership #______17. NIM 80 90 80 90 15 15 TOTAL $______$______$______$______$______$______

Multiple Conferences Registration

Subtract $50 (non-student) or $25 (student) from the Conference Total if registering for any one of the following pairs of conferences: STOC and Complexity, STOC and PODC, or STOC and SCG. Subtract $25 (non-students only) from the Conference Total if registering for both SCG and WACG.

Single Day Registration

Single day registration rates are $175 for May 22, May 23, May 24, May 25, or May 26; $150 for May 27: and $100 for May 28. Registration includes breakfast, coffee breaks, and admission to the technical sessions, exhibits, and plenary for the day selected. Available ONLY with one full conference registration.

Continued on next page 40 REGISTRATION FORM (continued)

Registration Information

• Complete both sides of this • Mail or fax both sides to: • Cancellations form. Use the back side of this FCRC Conference You may cancel and receive a form to select options and calcu- 3 Church Circle, Suite 194 refund less a $50 processing fee late costs. Annapolis, MD 21401 if a request is received in writing • Enclose payment. or fax to: on or before April 19, 1996, at FCRC Conference the Annapolis address shown (410) 267-0332 on this form. Substitutions are acceptable.

Identiﬁcation

First name, Middle initial, Surname

Name

Position

Organization Street

Address City, State/Province, Postal Code, Country

Electronic Mail Address ✂

Area code, Number Area code, Number Cut along dotted line

Phone Fax

❑ Do you have any special needs?

My name and address may be distributed beyond the FCRC attendance list: ❑ Approved (unlimited use) ❑ Limited to sponsor and sister organizations ❑ Attendee list only

❑ Evening at Franklin Institute (Wednesday, May 22) ______@ $60 per person

❑ Evening at Franklin Institute (Saturday, May 25)______@ $60 per person

Conference Totals

Conference Totals (from prior page) $

Franklin Institute $

Total Payment Enclosed $

Method of Payment

❑ Visa ❑ Master Card Number Exp date

Name exactly as it appears on credit card ❑ Check or money order Send your registration to: U.S. bank only Payble to: FCRC Conference FCRC ‘96 3 Church Circle, Suite 194 Annapolis, MD 21401 Signature

41 EXCURSIONS EXHIBITS

An Evening of Fellowship and Registration fee. Additional tick- Exhibits Fun at the Franklin Institute ets can be ordered in advance at FCRC week also features exhib- $60.00 each. See the Registra- Dominated by a gigantic statue its consisting of book and education form of page 41. Tickets will of Benjamin Franklin, Franklin tional software displays and be sold on-site for $65.00 each Hall is just one part of the demostrations. Franklin Institute Science up to 24 hours prior to each Museum that will be open to event if space is available. those participating in the Date: Wednesday, May 22 through Wednesday, May 22 or the Sat- Date: Wednesday, May 22 or Sunday, May 26 urday, May 25 Excursions. Par- Saturday, May 25 Time: 9:00 am – 6:00 pm ticipants will enjoy Philadelphia Time: 6:00 pm – 10:00 pm Room: Franklin Hall style food and beverage while Cost: $60 per person with viewing fun, hands-on science advance registration exhibits in the Halls of Inven- $65 per person on-site tions, Electricity and Aviation. if space is available. Approximately 11 blocks from the Marriott Hotel, round trip bus service will be provided.

The fee for the Evening at the Franklin Institute Science Museum is included in most of the participating Conferences’

TRANSPORTATION

Airline Discount

USAir agrees to offer an exclusive low fare for the attendees of the Federated Computing Research Conference, May 20- 28, 1996, in Philadelphia, PA. This special fare will offer a 5% discount off First Class and any published USAir pro- motional round trip fares. A 10% discount off unrestricted coach fares will apply with 7 day advance reservations and ticketing required. These discounts are valid providing all fare rules and restrictions are met and is applicable for travel from the Continental United States, Bahamas, Ber- muda, Canada, and San Juan, PR. Meeting discounts are not combinable with other discounts or promotions. Additional restrictions may apply on international travel. These meeting discounts are valid between May 17-31, 1996. For reservations call USAir’s Meeting and Convention Res- ervation Office 1-800-334-8644 8:00 AM - 9:00 PM (Eastern Time) Refer to Gold File Number 63930014 Once your reservations are confirmed, we will mail the tickets to you or suggest several other convenient methods of purchase. If you normally use the services of a travel agent or corporate travel department, please have them place the call so that they may obtain the same advantages for you. The special meeting fare is only available through the Meeting and Convention Reservation Office.

42 HOTEL MAP

43 HOTEL MAP

44 NOTES

45 NOTES

46 ASSOCIATION FOR COMPUTING MACHINERY 1515 Broadway Non-Proﬁt Organization New York, NO 10036-5701 USA U.S. Postage P A I D Phillipsburg, NJ Permit No. 187