fcrc ‘96 federated computing 23rd annual acm/ieee …acm-stoc.org/stoc1996/program96.pdforganizing...

Philadelphia Skyline

FCRC ‘96

Federated

Invited Speakers

ComputingResearchConference

May 20-28, 1996

Philadelphia, PA

ACMCRAIEEENSFSIAM

Wm. A. WulfBurton SmithCynthia DworkRobin MilnerRandy Katz

Sponsors

CRA Workshop on Academic Careersfor Women in Computing Science

23rd Annual ACM/IEEEInternational Symposium onComputer Architecture

ACM International Conference onSupercomputing

ACM SIGMETRICS InternationalConference on Measurement andModeling of Computer Systems

28th Annual ACM Symposium onTheory of Computing

11th Annual IEEE Conference onComputational Complexity

15th Annual ACM Symposium onPrinciples of Distributed Computing

12th Annual ACM Symposium onComputational Geometry

First ACM Workshop on AppliedComputational Geometry

ACM/UMIACS Workshop on ParallelAlgorithms

ACM SIGPLAN ‘96 Conference onProgramming Language Design andImplementation

ACM Workshop of FunctionalLanguages in IntroductoryComputing

SIGPLAN International Conferenceon Functional Programming

10th ACM Workshop on Parallel andDistributed Simulation

ACM SIGMETRICS Symposium onParallel and Distributed Tools

4th Annual ACM/IEEE Workshop onI/O in Parallel and DistributedSystems

SIAM Symposium on Networks andInformation Management

Welcome to the second Federated Computing Research Conference, FCRC’96, which isbeing held May 20 - 28, 1996 at the Philadelphia downtown Marriott. This secondFCRC follows the same model of the highly successful first conference, FCRC’93, inwhich nine constituent conferences participated. FCRC’96 includes seventeen constit-uent conferences - almost twice the size of FCRC’93! The FCRC model is one thatassembles a number of existing, specialized, research conferences into a coordinatedmeeting held at a common time in a common place. This model retains the advantagesof the smaller conferences, while at the same time, facilitating communication amongresearchers in different subfields in computer science and engineering. We havearranged a number of venues for attendee interaction including common breakfastsand coffee breaks throughout the week. And, of course, due to its size, FCRC’96 alsoprovides great visibility for the field as a whole.

The technical program for each constituent conference is independently administered,with each responsible for its own meeting’s structure, content, and proceedings. Theconstituent conference committees are to be commended for putting together excep-tionally strong, interlinking technical programs. To the extent facilities allow, attendeesare free to attend technical sessions of other constituent conferences being held at thesame time as their “home” conference. Proceedings from other constituent conferenceswill be available for purchase on-site.

Five mornings of FCRC’96 week will start with a plenary talk on a topic of broad appealto the CS&E community. We think you will find the talks presented by our outstandingslate of plenary speakers both inspiring and thought-provoking. The plenaries areopen to anyone registered for a constituent conference meeting that day. FCRC weekalso features two exciting evening excursions, one Wednesday and one Saturdayevening, and an informative Friday evening Panel organized by CRA. Almost all constit-uent conferences meeting on Wednesday or Saturday have included the excursion intheir registration package. The CRA Panel is open to all registrants. Exhibits, consist-ing of books and educational software displays and demonstrations, will be openWednesday through Sunday of FCRC week.

You have probably noticed that FCRC week spans a U.S. holiday, Memorial Day. TheOrganizing Committee encourages you to consider bringing your family along to Phila-delphia. They can have fun (while you work!). Philadelphia boasts world famous artexhibits and museums, a lively and colorful historic district, exciting arts and enter-tainment venues, and fantastic restaurants.

In planning FCRC’96, the Organizing Committee is grateful for support and assistancefrom the sponsoring organizations (ACM, CRA, The IEEE Computer Society, and SIAM)as well as the National Science Foundation. ACM, The Association for Computing, wasnotably active in providing support and planning expertise. In particular, the Commit-tee would like to extend a warm thanks to Debbie Hall of ACM SIG Services for herhelp with budgets, schedules, printings and mailings, and for putting up with ournaiveté about society policies and procedures. Rod Abraham and the staff of R.E.Abraham Associates provided outstanding conference management services. Finally,the Committee would like to thank James Haines of the Computer Science Depart-ment at Purdue University, who formatted this Advance Program with much patience,professionalism, and humor. The computing resources provided by Purdue’s Com-puter Science Department for its production are also gratefully acknowledged.

1

Organizing CommitteeMary Jane Irwin, ChairPenn State University

Steve Mahaney, Vice ChairRutgers University

Alan Berenbaum, TreasurerAT&T Bell Laboratories

Frank Friedman, ExhibitsTemple University

Sampath Kannan, StudentCoordinatorUniv. of Pennsylvania

David Wise, SteeringIndiana University

Janice Cuny, CareersUniversity of Oregon

Allan Gottlieb, ISCANew York University

Doug DeGroot, ICSTexas Instruments

Daniel Reed, METRICSUniversity of Illinois

David Johnson, STOCAT&T Bell Laboratories

Steven Homer, ComplexityBoston University

Cynthia Dwork, PODCIBM, Almaden

Michael Goodrich, SCGJohns Hopkins University

Ming Lin, WACGU.S. Army Research Office &Univ. of N. Carolina, Chapel Hill

Dinesh Manocha, WACGUniv. of N. Carolina, Chapel Hill

Uzi Vishkin, WOPAUniversity of Maryland

Charles Fischer, PLDIUniversity of Wisconsin

Robert Harper, ICFPCarnegie Mellon University

Matthias Felleisen, FLICRice University

Mary Bailey, PADSUniversity of Arizona

Barton Miller, SPDTUniversity of Wisconsin

David Kotz, IOPADSDartmouth College

Sampath Kannan, NIMUniversity of Pennsylvania

Steering CommitteeDavid Wise, ChairIndiana University

Mary Jane IrwinPenn State University

Gwen BellBoston Computer Museum

Frank FriedmanTemple University

David JohnsonAT&T Bell Laboratories

Dave PattersonUniversity of California, Berkeley

Paul YoungCISE, NSF

WELCOMEFCRC

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 ofComputer 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)


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)


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

CONTENTS

2

FCRC Town Meeting

Town Hall MeetingFriday, May 24, 19966:00 pm – 7:30 pmRoom: Salon F, Grand Ballroom

Our Precarious Future: Who Will Fund Computing Research and Why?The Computing Research Association presents a discussion among influential policy makers from industry, academia and government concerningthe funding future of computing research. At a time of significant threats to government funding sources and industrial focus on product-relevantresearch, 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

TH

Wm. A. WulfUniversity of VirginiaWednesday, May 22, 19968:00 – 9:00 amRoom: Salon F, Grand Ballroom

Information Technology Is TheLever, But Where Shall WeStand?

Bill Wulf is AT&T Professor ofEngineering at the University ofVirginia. He formerly was a Pro-fessor of Computer Science atCarnegie-Mellon, founded andwas CEO of Tartan Laborato-ries, and was Assistant Directorof NSF. His research interestshave spanned programming lan-guages, optimizing compilers,computer architecture, and com-puter security.

His current activities includeresearch into memory systemsarchitecture, steering a funda-mental rethinking of the under-graduate CS curriculum,assisting scholars in the human-ities exploit information technol-ogy, and chairing the ComputerScience and Telecommunica-tions Board at the NationalResearch Council. Dr. Wulf is amember of the National Academyof Engineering, a Fellow of theAmerican Academy of Arts andSciences, and a Fellow of theACM, IEEE, and AAAS.

Burton SmithTera ComputerThursday, May 23, 19968:00 – 9:00 amRoom: Salon F, Grand Ballroom

Designing your own multi-threaded processorBurton Smith is Chairman and

P1

P2

CONFERENCE HIGHLIGHTS

Chief Scientist of Tera ComputerCompany. He received theBSEE from the University of NewMexico in 1967 and the Sc.D.from MIT in 1972. From 1985 to1988 he was Fellow at theSupercomputing Research Cen-ter of the Institute for DefenseAnalyses in Maryland. Beforethat, he was Vice President,Research and Development atDenelcor, Inc. and was chiefarchitect of the HEP computersystem. Dr. Smith is a Fellow ofthe ACM and a Fellow of theIEEE, and winner of the IEEE-ACM Eckert-Mauchly award in1991. His main interest is gen-eral purpose parallel computerarchitecture.

Cynthia DworkIBM AlmadenFriday, May 24, 19968:00 – 9:00 amRoom: Salon F, Grand Ballroom

TBA

Cynthia Dwork has been a mem-ber and occasional manager ofthe Systems Fundamentalsgroup at the IBM AlmadenResearch Center since 1985. Herprincipal areas of research aredistributed computing and cryp-tography, with particularemphasis on applications of thelatter to the former. For severalyears she has worked both togain theoretical understandingof the sui generis cryptographicrequirements of distributed com-puting aggregates, such as theInternet, and to develop practicalprimitives for these and morestructured environments. Thiswork has ranged from the inven-tion of non-malleable cryptogra-phy to the design of the security

P3

architecture of the Almaden Dis-tributed Digital Library System(both collaborative efforts).

Robin MilnerUniversity of Cambridge UKSaturday, May 25, 19968:00 – 9:00 amRoom: Salon F, Grand Ballroom

Computing is InteractionRobin Milner is Professor ofComputation Theory at Cam-bridge UK, since January 1995;from January 1996 he is Head ofthe Computer Laboratory there.Previously he was at the Univer-sity of Edinburgh for 22 years; in1986, with colleagues, hefounded there the Laboratory forFoundation of Computer Sci-ence. In 1991 gained the A.M.Turing Award.

He has worked on computer-assisted reasoning; his systemLCF (Logic for ComputableFunctions) was a model for sev-eral later systems. He led a teamwhich designed and definedStandard ML, a widely used pro-gramming language; this is oneof the first industry-scale lan-guages whose semantic defini-tion is fully formal. His maincontribution has been to the the-ory of concurrent computation.Some of this work is widelyaccessible through his bookCommunication and Concur-rency (1989); also, around thattime he devised (with two col-leagues) the pi calculus, a basicmodel for mobile communicatingsystems. A continuing purposeof this work is to unite the theo-ries which underlie computationand communication.

P4

Randy KatzUC - BerkeleySunday, May 26, 19968:00 – 9:00 amRoom: Salon F, Grand Ballroom

The Case for Wireless Over-lay NetworksRandy H. Katz is a leadingresearcher in computer systemdesign and implementation. Hehas written over 120 technicalpublications on CAD, databasemanagement, multiprocessorarchitectures, high performancestorage systems, and videoserver architectures.

He led the implementation of theSPUR (Symbolic ProcessingUsing RISCs) multiprocessormemory system, the first suchsystem to integrate coherentmultiprocessor cache memorieswith efficient virtual memorymanagement. He was responsi-ble for co-developing the conceptof Redundant Arrays of Inexpen-sive Disks (RAID). He led theimplementation of the first large-scale RAID file server for highperformance applications. FromJanuary 1993 through Decem-ber 1994, Katz was a programmanager and deputy director ofthe Computing Systems Tech-nology Office of ARPA.

Katz’s recent research hasfocused on wireless communica-tions and mobile computing. Hiscurrent work involves providingseamless roaming across hetero-geneous wireless networks. Incollaboration with several serviceproviders and wireless technol-ogy companies, he is developinga wireless communications test-bed in the San Francisco BayArea called BARWAN (Bay AreaResearch Wireless Access Net-work).

P5

Invited Speakers

Continental BreakfastDaily7:15 am – 8:00 amRoom: Franklin Hall

3

ExhibitsWednesday – Sunday9:00 am – 6:00 pmRoom: Franklin Hall

CRA Workshop on Academic Careers for Women (Careers)

Introduction and WelcomeMonday, May 20, 19968:15 am – 8:30 am

Janice Cuny, general chairUniversity of Oregon

This is the fifth in a series ofCRA-sponsored Workshops onAcademic Careers for Women inComputer Science. The work-shop is primarily intended forwomen who are beginning aca-demic careers -- either in thefinal stages of finishing a Ph.D.or newly hired as faculty. Partici-pants will meet with women whoare already established in theirfields. The established profes-sionals will share their ownexperiences, providing practicalinformation, advice, and supportto their younger colleagues. Theworkshop will impart basic infor-mation that new faculty mem-bers need for success.

The Tenure DecisionMonday, May 20, 19968:30 am – 9:45 am

Mary Jane Irwin, chairPennsylvania State University

What’s needed and what’s notneeded. Writing a good tenuredossier. Choosing references.Typical successful cases. Com-mon pitfalls and mistakes.

Building a Research Pro-gramMonday, May 20, 19969:45 am – 11:00 am

Nancy Leveson, chairUniversity of Washington

Going beyond your thesis. Advis-ing graduate students. Collabo-rating. Journal versusconference publications. Whatreferees look for. What to dowhen a paper is rejected.

11:00 am Coffee Break

S1

S2

TeachingMonday, May 20, 199611:30 am – 12:30 am

Joan Francioni, chairUniversity of SouthwesternLouisiana

How to be a good teacher. Com-mon mistakes of new teachers.What should you be teaching.Dealing with problem students.Special problems facing womenfaculty. Documenting youraccomplishments.

12:30 pm – 1:30 pmLuncheon

Getting a JobMonday, May 20, 19961:30 pm – 2:30 pm

Francine Berman, chairUniversity of California at SanDiego

How to develop a marketablevita. Options after grad school.Interviewing. The Offer.

First Year SurprisesMonday, May 20, 19962:30 pm – 3:30 pm

Eileen Kraemer, chairWashington University

The first few years. How to estab-lish yourself. Tips for gettingstarted.

3:30 pm Coffee Break

Funding Mini-WorkshopMonday, May 20, 19964:00 pm – 6:00 pm

Caroline Wardle, chairNational Science Foundation

Writing an NSF proposal.

S3

L

S4

S5

S6

ReceptionMonday, May 20, 19966:30 pm

NetworkingTuesday, May 21, 19968:30 am – 9:30 am

Susan Eggers, chairUniversity of Washington

The importance of networking.Attending conferences. Describ-ing your work. Being part of the“young girls’ network.”

The Perspective From theSmaller SchoolsTuesday, May 21, 19969:30 am – 10:30 am

Sheila Castaneda, chairClarke College

How do requirements and expec-tations differ at smaller schoolsand four year institutions.Research with fewer resources.Rewards.


Time ManagementTuesday, May 21, 199611:00 am – 12:30 pm

Janice Cuny, chairUniversity of Oregon

How can you get this all done?How hard do you have to work?Life outside of work. Balancingfamily life with a career. Twocareer familes.

R

S7

S8

S9

Registration for the CRA Workshop on Academic Careers for Women in Computer Science includes continen-tal breakfasts, coffee breaks, lunch on May 20th, and a reception on the evening of May 20th. The workshopis sponsored by the Computing Research Association with support from the National Science Foundation.

4

Janice CunyUniversity of Oregon

Organizer and General Chair

Francine BermanUniversity of California at SanDiego

Ruzena BajcsyUniversity of Pennsylvania

Carla BrodleyPurdue University

Sheila CastanedaClarke College

Susan EggersUniversity of Washington

Joan FiegenbaumAT&T

Joan FrancioniUniversity of SouthwesternLouisiana

Helen GillNational Science Foundation

Mary Jane IrwinPennsylvania State University

Eileen KraemerWashington University

Andrea LaPaughPrinceton University

Nancy LevesonUniversity of Washington

Dian Rae LopezUniversity of Minnesota at Morris

Donna ReeseMississippi State University

Mary VernonUniversity of Wisconsin

Caroline WardleNational Science Foundation

CommitteeSessions


ISCA ‘96Student Travel Grants

A limited number of Student TravelGrants will be available for ISCA ‘96student attendees. To apply for agrant, please contact (preferably bye-mail);

Prof. Jean-Loup BaerDept. of Computer Scienceand EngineeringBox 352350University of WashingtonSeattle, WA [email protected]

Pradip BoseIBM T. J. Watson Research Center

S. SuryaIBM Corp., Somerset Design Cen-ter

Tuesday, May 21, 19968:30 am – 12:30 pm

Pre-Silicon PerformanceAnalysis and VerificationMethodologyA significant portion of this tuto-rial will be devoted to the prob-lem of validation and formalverification of processor timermodels, based on latest researchat IBM and elsewhere. We willcover: (a) early estimation modelsfor use during processor designdefinition; (b) cycle-by-cycle sim-ulation models for CPU-memorysubsystems; (c) model validationand application performanceverification; (d) generation of rep-resentative traces from user andbenchmark source code; (e) pro-jection of benchmark suite per-formance using the targetprocessor simulation model;and (f) compiler tuning basics forperformance enhancement ofprocessor-memory subsystems.Extensions to cover SMP perfor-mance also will be describedbriefly.

Jelica Protic, Milo Tomasevicand Veljko MilutinovicInstitute for Advanced ComputerTechnology, Belgrade, Yugoslavia

Tuesday, May 21, 19968:30 am – 12:30 pm

Distributed Shared Mem-ory: Concepts and Systems

T1A

T1B

5

This tutorial will be an introduc-tion to DSM concepts and algo-rithms. We will cover memoryconsistency models with exam-ples; classification criteria andparameters; hardware imple-mentations (e.g., DASH, SCI,KSR, DDM, Merlin, RMS, andstate-of-the-art research); soft-ware implementations (e.g.,Munin, IVY, Linda, Mirage,Clouds, Orca, and state-of-the-art research); and hybrid imple-mentations (e.g., Alewife, Para-digm, Galactica, Plus, Flash,Shrimp, and state-of-the-artresearch). Examples and casestudies will be presented.

Peter SteenkisteCarnegie Mellon University

Tuesday, May 21, 19961:30 pm – 5:30 pm

High-Performance Communi-cation on Loosely-CoupledSystems: Architecture andSoftwareApplication-level communica-tion performance often is limitedby the interface between thecompute node and the networkor interconnect. In this tutorialwe will describe hardware andsoftware techniques that can beused to improve communicationperformance on loosely-coupledsystems. We will draw from ourexperience in the Nectar, GigabitNectar, and Credit Net high-speed networking projects, andfrom lessons learned by thearchitecture community in opti-mizing communication ontightly-coupled systems. Thetutorial will be based on a “verti-cal slice” approach where welook at system issues from theApplication Programming Inter-face all the way down to the com-munication hardware.

Yale N. PattUniversity of Michigan

Tuesday, May 21, 19961:30 pm – 5:30 pm

Continuing to ExploitInstruction Level Parallel-ism: Issues, Bottlenecks, andEnabling Conditions

T2A

T2B

Exploiting instruction level par-allelism continues to be a hottopic in computer architecture.We will focus on what you canaccomplish at run time, alongwith how the compiler can help.Compile time vs. run time,superscalar vs. VLIW, and thevarious design decisions affect-ing the microarchitecture(instruction supply mechanisms,branch prediction, multi-widedecode/issue, static or dynamicscheduling, multiple functionalunits and distribution buses,and various state maintenancemechanisms) will be covered.Recent announcements of wide-issue processors, most usingout-of-order execution, will bediscussed. Finally, what toexpect in the near future, espe-cially in light of these recentannouncements, coupled withrenewed interest in VLIW.

ReceptionTuesday, May 21, 19967:00 pm – 10:00 pm

WelcomeWednesday, May 22, 19969:20 am – 9:30 am

Keynote Address9:30 am – 10:30 am


Branch PredictionWednesday, May 22, 199611:00 am – 12:30 pm

Joel Emer, chair

Using Hybrid Branch Predic-tors to Improve Branch Predic-tion Accuracy in the Presenceof Context SwitchesMarius Evers, Po-Yung Changand Yale N. PattUniversity of Michigan

An Analysis of DynamicBranch Prediction Schemes onSystem Workloads

R

S1

S2A

Nicolas Gloy, Cliff Young, J. Bra-dley Chen and Michael D. SmithHarvard University

Correlation and Aliasing inDynamic Branch PredictorsStuart Sechrest, Chih-Chieh Leeand Trevor N. MudgeUniversity of Michigan

Shared MemoryWednesday, May 22, 199611:00 am – 12:30 pm

Per Stenstrom, chair

Decoupled Hardware Supportfor Distributed Shared Mem-orySteven K. Reinhardt, Robert W.Pfile and David A. WoodUniversity of Wisconsin

MGS: A Multi-Grain SharedMemory SystemDonald Yeung, John Kubiatow-icz and Anant AgarwalMIT

COMA: an Opportunity forBuilding Fault-Tolerant Scal-able Shared Memory Multipro-cessorsChristine Morin, Alain Gefflaut,Michel Banâtre and Anne-MarieKermarrecIRISA

Processor/Memory Trade-offsWednesday, May 22, 19962:00 pm – 3:30 pm

Dave Patterson, chair

Evaluation of Design Alterna-tives for a MultiprocessorMicroprocessorBasem A. Nayfeh, Lance Ham-mond and Kunle OlukotunStanford University

Memory Bandwidth Limita-tions of Future Microproces-sorsDoug Burger, Alain Kägi andJames R. GoodmanUniversity of Wisconsin

S2B

S3

23rd Annual International Symposium On Computer Architecture (ISCA)

Sessions and Tutorials

Registration for the 23rd Annual International Symposium On Computer Architecture includes a SIGARCH/TCCA business meeting, a reception, an evening excursion, Eckert-Mauchly Award Lunch, continental break-fasts, coffee breaks, and conference proceedings. Student registration includes all of the above except theevening excursion. The conference is sponsored by the ACM Special Interest Group on Computer Architectureand the IEEE Computer Society Technical Committee on Computer Architecture.

Plenary Invited SpeakerDaily8:00 — 9:00 amRoom: Salon F

Grand Ballroom

6

Missing the Memory Wall: TheCase for Processor/MemoryIntegrationAshley SaulsburySwedish Institute of ComputerScienceFong Pong and AndreasNowatzykSun Microsystems Computer Cor-poration


Panel Discussion:Research Opportunitiesand Critiques: An Indus-trial PerspectiveWednesday, May 22, 19964:00 pm – 5:30 pm

Dave Patterson, Organizer

Cache OrganizationThursday, May 23, 19969:30 am – 10:30 pm

Corinna Lee, chair

Don’t use the page number,but a pointer on itAndré SeznecIRISA

The Difference-bit CacheToni Juan and Juan J. NavarroUniversitat Politecnica de Catalu-nyaTomas LangUC Irvine

Application Implicationsfor MP SystemsThursday, May 23, 19969:30 am – 10:30 pm

Thomes Gross, chair

Understanding the Perfor-mance of Shared Virtual Mem-ory from an ApplicationsPerspectiveLiviu Iftode, Jaswinder Pal Singhand Kai LiPrinceton University

Application and ArchitecturalBottlenecks in Large Scale Dis-tributed Shared MemoryMachinesChris Holt and John HennessyStanford UniversityJaswinder Pal SinghPrinceton University

S4

S5A

S5B


Superscalar Memory Sys-temsThursday, May 23, 199611:00 am – 12:00 pm

Matt Farrens, chair

Increasing Cache Port Effi-ciency for Dynamic Supersca-lar MicroprocessorsKenneth M. Wilson, KunleOlukotun and Mendel Rosen-blumStanford University

High-Bandwidth AddressTranslation for Multiple-IssueProcessorsTodd M. Austin and Gurindar S.SohiUniversity of Wisconsin

I/O and InterruptsThursday, May 23, 199611:00 am – 12:00 pm

Jai Menon, chair

DCD-Disk Caching Disk:A New Approach for BoostingI/O PerformanceYiming Hu and Qing YangUniversity of Rhode Island

Polling Watchdog: CombiningPolling and Interrupts for Effi-cient Message HandlingOlivier Maquelin, Guang R. Gao,Kevin Theobald and Xinmin TianMcGill UniversityHerbert H. J. HumConcordia University

12:30 pm – 2:00 pmE-M Award Luncheon

Processor Microarchitec-tureThursday, May 23, 19962:00 pm – 3:30 pm

Jim Smith, chair

Exploiting Choice: InstructionFetch and Issue on an Imple-mentable Simultaneous Multi-Threading Processor

S6A

S6B

L

S7A

Dean M. Tullsen, Susan J. Egg-ers, Henry M. Levy and Jack L.LoUniversity of WashingtonJoel S. Emer and Rebecca L.StammDigital Equipment Corporation

Evaluation of MultithreadedUniprocessors for CommercialApplication EnvironmentsRick J. Eickmeyer, Ross E.Johnson, Steve R. Kunkel, Shi-afun Liu and Mark S. SquillanteIBM

Performance Comparison ofILP Machines with Cycle TimeEvaluationTetsuya Hara, Hideki Ando,Chikako Nakanishi and MasaoNakayaMitsubishi Electric Corporation

NetworksThursday, May 23, 19962:00 pm – 3:30 pm

Kai Li, chair

Rotating Combined Queueing(RCQ): Bandwidth andLatency Guarantees in Low-Cost, High-Performance Net-worksJae H. Kim and Andrew A. ChienUniversity of Illinois at Urbana-Champaign

A Router Architecture forReal-Time Point-to-Point Net-worksJennifer Rexford, John Hall andKang G. ShinUniversity of Michigan

Coherent Network Interfacesfor Fine-Grain CommunicationShubhendu S. Mukherjee,Babak Falsafi, Mark D. Hill andDavid A. WoodUniversity of Wisconsin


Performance Evaluationand OptimizationThursday, May 23, 19964:00 pm – 5:30 pm

Patricia Teller, chair

Informing Memory Opera-tions: Providing Memory Per-formance Feedback in ModernProcessors

S7B

S8

Mark HorowitzStanford UniversityMargaret MartonosiPrinceton UniversityTodd C. MowryUniversity of TorontoMichael D. SmithHarvard University

Instruction Prefetching of Sys-tems Codes With Layout Opti-mized for Reduced CacheMissesChun Xia and Josep TorrellasUniversity of Illinois at Urbana-Champaign

Compiler and Hardware Sup-port for Cache Coherence inLarge-Scale Multiprocessors:Design Considerations andPerformance EvaluationLynn ChoiUniversity of IllinoisPen-Chung YewUniversity of Minnesota

SIGARCH/TCCABusiness MeetingThursday, May 23, 19966:00 pm

SystemsFriday, May 24, 19969:30 am – 10:30 am

Steve Scott, chair

Early Experience with Mes-sage-Passing on the SHRIMPMulticomputerRichard D. Alpert, AngelosBilas, Matthias A. Blumrich,Douglas W. Clark, StefanosDamianakis, Cezary Dubnicki,Edward W. Felten, Liviu Iftodeand Kai LiPrinceton University

STiNG: A CC-NUMA ComputerSystem for the CommercialMarketplaceTom Lovett and Russell ClappSequent Computer Systems


Joint ISCA/PODC Paneland DiscussionFriday, May 24, 199611:00 am – 12:30 pm

M

S9

S10

Sessions



Allan GottliebNew York University

General Chair

Norm JouppiDigital Equipment Corporation

Program Chair

Patricia TellerNew Mexico State University

Tutorials Chair

Ed FeltonPrinceton University

Publicity & Publications Chair

Kai LiPrinceton University

Finance Chair

ADVISORY COMMITTEEJean-Loup BaerUniversity of Washington

Alan BerenbaumAT&T Bell Labs

Bill DallyMIT

Jim GoodmanUniv. of Wisconsin

Yale PattUniv. of Michigan

Alan J. SmithUC Berkeley

Jim SmithUniv. of Wisconsin

PROGRAM COMMITTEEDon AlpertIntel

Forest BaskettSilicon Graphics

Andrew ChienUniv. of Illinois

Michel DuboisUSC

Joel EmerDEC

Matt FarrensUC Davis

Thomas GrossETH Zurich / CMU

Anoop GuptaStanford University

Martin HopkinsIBM

Jerry HuckHP

Corinna LeeUniv. of Toronto

Jai MenonIBM

Trevor MudgeUniversity of Michigan

Greg PapadopoulosSun Microsystems

Dave PattersonUC Berkeley

Shuichi SakaiReal World Computing Partner-ship

Steve ScottCray Research

André SeznecIRISA-INRIA

Mike SmithHarvard

Guri SohiUniv. of Wisconsin

Per StenstromLund University

Patricia TellerNew Mexico State Univ.

Mateo ValeroUniv. of Catalonia

Committees

International Conference on Supercomputing (ICS)

Registration for the 1996 International Conference on Supercomputing includes an excursion, a reception, aluncheon, continental breakfasts, coffee breaks, and conference proceedings. Student registration includesall of the above except the evening excursion. The conference is sponsored by the ACM Special Interest Groupon Computer Architecture.

Tutorial and Sessions

Dr. Michael WolfeThe Portland Group, Inc., andOregon Graduate Institute

Friday, May 24, 19969:30 am – 5:00 pm

Supercomputer Architec-ture: Hardware and SoftwareTrade-offsMichael Wolfe is a leader in thedevelopment of optimizing andparallelizing compilers. Since1988, he has been Associate Pro-fessor at the Oregon GraduateInstitute. In 1996, he joins thePortland Group, Inc., the leadingsupplier of optimizing High Per-formance Fortran compilers.

This full day tutorial will covermodern supercomputer archi-tectures, ranging from pipelinedsuperscalar and vector proces-sors to moderately and massivelyparallel systems. Of particularinterest are the trade-offsbetween capabilities imple-mented in hardware vs. soft-ware, such as parallelismdetection and exploitation, mem-ory locality, and so on.

This tutorial is aimed at develop-

Ters, researchers and studentswho want a fast-paced, compre-hensive introduction to the widevariety of supercomputer archi-tectures available. This includessystem software and hardwaredevelopers, as well as applicationwriters.

Distributed Memory Com-pilersSaturday, May 25, 19969:30 am – 11:00 am

Compiler Support for HybridIrregular Accesses on Multi-computersAntonio Lain and Prithviraj Ban-erjeeUniversity of Illinois at Urbana-Champaign

Analysis of Local Enumera-tion and Storage Schemes inHPFH.J. Sips and C. van ReeuwijkDelft University of Technology,Delft, the NetherlandsW. DenissenTNO-TPD, Delft, the Netherlands

S1A

Detection and Global Optimi-zation of Reduction Opera-tions for Distributed parallelMachinesToshio Suganuma, HideakiKomatsu and Toshio NakataniIBM Japan Tokyo Research Labo-ratory, Kanagawa, Japan

Memory Systems (I)Saturday, May 25, 19969:30 am – 11:00 am

Memory Organization in Multi-Channel Optical Networks:NUMA and COMA RevisitedJohn K. Bennett and Y. Y. XaioRice University

The GLOW Cache CoherenceProtocol Extensions for WidelyShared DataStefanos Kaxiras and James R.GoodmanUniversity of Wisconsin-Madison

A Cost-Comparison Approachfor Adaptive DistributedShared MemoryJai-Hoon Kim and Nitin H.VaidyaTexas A&M University

S1B


Invited TalkSaturday, May 25, 199611:30 am – 12:30 pm

Distribution of Data andComputationsSaturday, May 25, 19962:00 pm – 4:00 pm

Minimizing Communicationwhile Preserving ParallelismWayne Kelly and William PughUniversity of Maryland

Data-Localization for FortranMacro-Dataflow ComputationUsing Partial Static Task-AssignmentAkimasa Yoshida, Kenichi Koshi-zuka and Hironori KasaharaWaseda University, Tokyo, Japan

Mapping Performance Datafor High-Level and Data Viewsof Parallel Program Perfor-mance

S2

S3A

7


Grand Ballroom


Sessions

R. Bruce IrvinInformix Software Inc.Barton P. MillerUniversity of Wisconsin-Madison

Experimental Evaluation ofEfficient Sparse Matrix Distri-butionsManuel Ujaldon and Emilio L.ZapataUniversity of Malaga, SpainShamik D. Sharma and JoelSaltzUniversity of Maryland

Physical and Mathemati-cal ComputationsSaturday, May 25, 19962:00 pm – 3:30 pm

A Generator of Multi-PlatformHigh Performance Codes forPDE-based Scientific Applica-tionsRobert vanEngelen, Lex Woltersand Gerard CatsLeiden University, the Nether-lands

A Performance Study of Cos-mological Simulations on Mes-sage-Passing and Shared-Memory MultiprocessorsMarios D. Dikaiakos andJoachim StadelUniversity of Washington

Parallel Additive LaggedFibonacci Random NumberGeneratorsSrinivas AluruSyracuse University


Data PrefetchingSaturday, May 25, 19964:30 pm – 5:30 pm

Data Prefetching and Multi-level Blocking for Linear Alge-bra OperationsJuan J. Navarro, Elena Gracia-Diego and Jose R. HerreroUniversitat Politecnica de Catalu-nya, Barcelona, Spain

A Template for Non-uniformParallel Loops Based onDynamic Scheduling andPrefetching TechniquesSalvatore OrlandoUniversita’ Ca’ Foscari Venezia,Venezia Mestre, Italy

Raffaele PeregoIstituto CNUCE, Consiglio Nazion-ale delle Ricerche (CNR), Pisa,Italy

Invited SessionSunday, May 26, 19969:30 am – 12:30 pm

Dennis Gannon, OrganizerIndiana University

MetaComputing: Progress andNew Directions in Parallel andDistributed Computing

Memory Systems (II)Sunday, May 26, 19962:00 pm – 3:30 pm

Evaluation of Dynamic AccessOrdering HardwareSally McKee, C.W. Oliver, W.A.Wulf, K.L. Wright and J.H. TaylorUniversity of Virgina

Examination of a MemoryAccess Classification Schemefor Pointer-intensive andNumeric ProgramsSharad Mehrotra and LuddyHarrisonUniversity of Illinois at Urbana-Champaign

Optimizing the Primary Cachefor Parallel Scientific Applica-tions: The Pool BufferApproachJosep Torrellas and Liuxi YangUniversity of Illinois at Urbana-Champaign

Load Balance Issues inUnstructured Applica-tionsSunday, May 26, 19962:00 pm – 3:30 pm

ParInt: A Software Package forParallel IntegrationElise de Doncker, Ajay Gupta,Jay Ball, Patricia Ealy and AlanGenzWestern Michigan University

Automatic Partitioning Tech-niques for Solving Partial Dif-ferential Equations onIrregular Adaptive Meshes

Jerome GaltierUniversite de Versailles Saint-Quentin, France

Profile Driven WeightedDecompositionKaren A. TomkoWright State UniversityEdward S. DavidsonUniversity of Michigan


Message Passing Optimi-zationsSunday, May 26, 19964:00 pm – 5:30 pm

Evaluating the Limits of Mes-sage Passing via the SharedAttraction Memory on CC-COMA Machines: Experienceswith TCGMSG and PVMKaushik GhoshGeorgia Institute of TechnologySteve BreitDragon Systems

Hybrid Algorithms for Com-plete Exchange in 2D MeshesN.S.Sundar, D.N.Jayasimha,D.K.Panda and P.SadayappanOhio State University

The Effect of Interrupts onSoftware Pipeline Executionon Message-passing Architec-turesRob F. Van der Wijngaart,Sekhar R. Sarukkai and PankajMehraNASA Ames Research Center

Combinatorial ProblemsSunday, May 26, 19964:00 pm – 5:30 pm

Amon2: A Parallel Wire Rout-ing Algorithm on a Torus Net-work Parallel ComputerHesham Keshk, Shin-ichiroMori, Hiroshi Nakashima andShinji TomitaKyoto University, Kyoto, Japan

Parallel Construction of Multi-Dimensional Binary SearchTreesIbraheem Al-furaih, SrinivasAluru and Sanjay GoilSyracuse UniversitySanjay RankaUniversity of Florida

S3B

S4

S5

S6A

S6B

S7A

S7B

Satisfiability Test with Syn-chronous Simulated Annealingon the Fujitsu AP1000 Mas-sively-Parallel MultiprocessorAndrew SohnNew Jersey Institute of Technol-ogy

ReceptionSunday, May 26, 19967:00 pm – 10:00 pm

Runtime OptimizationsMonday, May 27, 19969:30 am – 11:00 am

Automating Parallel RuntimeOptimizations Using Post-Mor-tem AnalysisSanjeev Krishnan and Laxmi-kant V.KaleUniversity of Illinois at Urbana-Champaign

Runtime Coupling of Data-par-allel ProgramsM.Ranganathan, A.Acharya,G.Edjlali, A.Sussman andJ.SaltzUniversity of Maryland

Run-time Compilation for Par-allel Sparse Matrix Computa-tionsCong Fu and Tao YangUniversity of California

Analysis of Multi-NodeSystemsMonday, May 27, 19969:30 am – 11:00 am

Synchronization Hardware forNetworks of Workstations: Per-formance vs. CostRahmat S. Hyder and David A.WoodUniversity of Wisconsin-Madison

Are There Advantages to High-Dimension Architectures?:Analysis of k-ary n-cubes forthe Class of Parallel Divide-and-Conquer AlgorithmsShantanu Dutt and Nam TrinhUniv. of Minnesota

Evaluating Virtual Channelsfor Cache-Coherent Shared-Memory MultiprocessorsAkhilesh Kumar and LaxmiBhuyanTexas A&M University

R

S8A

S8B

8


Invited TalkMonday, May 27, 199611:30 am – 12:30 pm

12:30 pm – 2:00 pmICS Luncheon

Compilation TechniquesMonday, May 27, 19962:00 pm – 3:30 pm

A New Guaranteed Heuristicfor the Software PipeliningProblemPierre-Yves Calland, Alain Darteand Yves RobertEcole Normale Superieure deLyon, France

A Register Allocation Tech-nique Using Guarded PDGAkira Koseki and Yoshiaki Fuka-zawaWaseda University, Tokyo, JapanHideaki KomatsuIBM Japan Tokyo Research Labo-ratory, Kanagawa, Japan

Counting Solutions to Linearand Nonlinear ConstraintsThrough Ehrhart polynomials:Applications to Analyze andTransform Scientific ProgramsPhilippe ClaussUniversite Louis Pasteur, France

Linear AlgebraMonday, May 27, 19962:00 pm – 3:30 pm

An Efficient Steepest-EdgeSimplex Algorithm for SIMDComputersMichael E. Thomadakis and Jyh-Charn LiuTexas A&M University

Parallel Implementation of theLanczos Method for SparseMatrices: Analysis of Data Dis-tributionsE.M. Garzon and I. GarciaUniversidad de Almeria, Spain

Block Algorithms for SparseMatrix Computations on HighPerformance Workstations

S9

L

S10A

S10B

Juan J. Navarro, Elena Garcia,Josep-L. Larriba-Pey and ToniJuanUniversitat Politecnica de Catalu-nya, Spain


Programming ModelsMonday, May 27, 19964:00 pm – 5:30 pm

Inference Mechanism for FastArray Language ComputationLuiz De Rose and David PaduaUniversity of Illinois at Urbana-Champaign

Integrating Task and Data Par-allelism Using Shared ObjectsSaniya Ben Hassen and HenriBalVrije Universiteit, Amsterdam,the Netherlands

Eliminating Redundant Bar-rier Synchronizations in Rule-based ProgramsAnurag AcharyaUniversity of Maryland

Performance EvaluationMonday, May 27, 19964:00 pm – 5:30 pm

Benchmark Tests on the Digi-tal Equipment CorporationAlpha AXP 21164-BasedAlphaServer 8400Harvey WassermanLos Alamos National Laboratory

Fine Grain Parallel Communi-cation on General PurposeLANsT. Mummert, C. Losak, P. Steen-kiste and A. FisherCarnegie Mellon University

Improving Single-Process Per-formance with MultithreadedProcessorsOlivier Teman and A. FarcyUniversity of Versailles, France

Input/Output SystemsTuesday, May 28, 19969:30 am – 11:00 am

An Interprocedural Frameworkfor Placement of Asynchro-nous I/O operations

S11A

S11B

S12


9

Doug DeGrootTexas Instrument

General Chair

Pen-Chung YewUniversity of Minnesota at Twin Cities

Program Chair

Kenichi MiuraFujitsu America, Inc.

Vice-Chair (Application)

David SnellingUniversity of Manchester, England

Vice-Chair (Architecture)

Hironori KasaharaWaseda University, Japan

Vice-Chair (Software)

John SopkaSequent Computer Systems, Inc.

Finance Chair

PROGRAM COMMITTEEFrancois BodinIRISA, France

Ding-Kai ChenSilicon Graphic Inc.

Gregory K. EganMonash University, Australia

Rudolf EigenmannPurdue University

Sessions Committees

Gagan Agrawal, AnuragAcharya and Joel SaltzUniversity of Maryland

Automatic Optimization ofCommunication in CompilingOut-of-core Stencil CodesRajesh Bordawekar and AlokChoudharySyracuse UniversityJ.RamanujamLouisiana State University

The Galley Parallel File SystemNils Nieuwejaar and David KotzDartmouth College


Vector Memory SystemsTuesday, May 28, 199611:30 am – 12:30 pm

Reducing Inter-Vector-Con-flicts in Complex Memory Sys-temsAnna del Corral and J. LlaberiaUniversitat Politecnica de Catalu-nya, Barcelona, Spain

Performance of the VectorialProcessor VEC-SM2 UsingSerial Multiport MemoryJacques Jorda, A. Mzoughi andD. litaizeIRIT/UPS, Toulouse, France

S13

Efstratis GallopoulosUniversity of Patras, Greece

Dennis GannonIndiana University

Hans Michael GerndtCentral Institute for Applied Mathe-matics Research Center, Juelich, Ger-many

Elana GranstonGMD, Germany

Mary HallCalifornia Institute of Technology

Siamak HassanzadehSun Microsystems

Kei HirakiUniversity of Tokyo, Japan

Chris JesshopeUniversity of Surrey, England

Sachio KamiyaFujitsu Limited, Japan

Sumio KikuchiHitachi, Ltd., Japan

Peter KoggeUniversity of Notre Dame

David LiljaUniversity of Minnesota

John Mellor-CrummeyRice University

Shigeo NagashimaHitachi, Ltd., Japan

Hiroshi NakashimaKyoto University, Japan

Matt O’KeefeUniversity of Minnesota

Yoshio OyanagiUniversity of Tokyo, Japan

Umakishore RamachandranGeorgia Institute of Technology

David SchneiderCornell University

Henk SipsDelft University of Technology, TheNetherlands

Peiyi TangThe University of Southern Queen-land, Australia

Olivier TelmanUniversite de Versailles, France

Clemens TholeGMD - German National ResearchCenter for Information Technology

Josep TorrellasUniversity of Illinois at Urbana-Cham-paign

Harvey WassermanLos Alamos National Laboratory

Harry WijshoffLeiden University, The Netherlands

Michael WolfeOregon Graduate Institute of Science& Technology

Yoshinori YamaguchiElectrotechnical Laboratory, Japan

Xiaodong ZhangUniversity of Texas at San Antonio

Hans P. ZimaUniversity of Vienna, Austria

Committees

mentation architecture aredescribed. The implications ofrecent system directions forinstrumentation are discussed.We close with a brief review ofavailable standards in the areaof systems performance instru-mentation.

Carey WilliamsonUniversity of Saskatchewan

Thursday, May 23, 19968:30 am – 10:00 am

Introduction to ATM Net-worksAsynchronous Transfer Mode(ATM) offers the potential for effi-cient statistical multiplexing ofmultiple traffic types (e.g., data,voice, video, image) on a singlehigh speed integrated servicesnetwork. ATM is basically theconcept of connection-orientedpacket switching, using smallfixed size packets called cells.

This beginner-level tutorial willprovide an overview of the con-cepts and motivation behindATM, define a number of theterms from the “ATM dictionary”,and then discuss a number ofperformance-related issues inhigh speed ATM networks (e.g.,switching, call admission con-trol, traffic management, QOS).No background knowledge ofATM is required.

Tommy WagnerUS Military Academy


Performance Evaluation 102:Workload CharacterizationTechniquesIn order to model the perfor-mance of a computer system,two models are required: a modelof the system itself, and a modelof the workload that runs on thesystem (as input to the systemmodel). The process of workloadcharacterization is the process ofbuilding those workload models.This tutorial will survey the fieldof workload characterizationfocusing on some of the most

widely accepted methods forbuilding workload models. Thebasic issues involved in parallelworkload modeling will also beintroduced and some of the pro-posed approaches will be dis-cussed.

Brian CarlsonDakota State University

Thursday, May 23, 199611:00 am– 12:00 pm

Performance Evaluation 103:Basic Applications to ParallelSystemsParallel programs have proper-ties that are quite different fromtheir sequential counterparts.Thus, basic performance model-ing techniques differ consider-ably from the modeling andworkload characterization ofsequential programs. This tuto-rial will examine basic issues inthe performance evaluation ofparallel programs. Characteriza-tions of parallel programsinclude Amdahl’s Law, averageparallelism, speedup, efficiency,parallelism profiles, executionsignatures, and task graphs.Often, obtaining the character-ization information is difficultand requires additional tools.One such tool that will bedescribed in detail is PICL. Aseries of case studies will showhow the algorithm works.

Margaret MartonosiThursday, May 23, 199610:30 am – 12:00 pm

Hardware and Software Sup-port for Performance Moni-toringObtaining good performance oncurrent computers oftenrequires performance monitor-ing systems that allow program-mers, compiler writers, andsystem designers to identify andtune the portions of their designthat are limiting applicationsand system performance.

This tutorial examines the issuesand challenges inherent in mak-ing fine-grained observationsabout system behavior (with low

T1C

T2

T3A

T3B

Larry DowdyVanderbilt University


Performance Evaluation 101:Basic Modeling TechniquesThis tutorial is aimed at noviceperformance modelers. The con-text and motivating examplesfocus on performance prediction.Given a computer system withseveral options for possibleimprovement, a performanceprediction model can be used toevaluate each option. The optionwith the best predicted perfor-mance, relative to the implemen-tation cost, is judged to be thebest alternative. Topics include:measurement, workload charac-terization, model construction,model solution, calibration, pre-diction, and validation. The pre-sentation is example orientedand intuition driven. Basic mod-eling techniques using Mark-ovian analysis, convolution,mean value analysis, Petri netmodels, bounding techniques,decomposition, and approxi-mate analysis are covered.

Robert BerryIBM


Systems Performance Instru-mentation: Techniques,Trade-offs, and Implicationsfor AnalysisSystem performance developers/analysts make performance-ori-ented design and tuning deci-sions based on theinstrumentation available ontheir systems. Analysts mustunderstand the nature of thisinstrumentation: the techniques,the trade-offs and the resultingimplications for analysis.

We start with typical systeminstrumentation guidelines forlarge, complex systems. Next, weintroduce basic instrumentationtechniques and discuss thetrade-offs that motivate the useof one technique over another.The key elements of an instru-

T1A

T1B

10

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 theconference proceedings. The student registration includes all of the above except the evening excursion. Theconference is sponsored by the ACM Special Interest Group on Measurement and Modeling of Computer Sys-tems.

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

Tutorials

overhead and without perturbingthe system being measured),focusing mainly on parallel codeand the memory system. Hard-ware monitoring support can becrucial in gathering accurateprogram information. The tuto-rial provides a survey of existingperformance monitoring hard-ware and software, and dis-cusses the challenges inextending current approaches.

Asit DanDinkar SitaramIBM Research

Thursday, May 23, 199610:30 am – 12:00 pm

Resource Management inDistributed Video ServerEnvironmentsThis tutorial provides an over-view of resource management ina distributed video server clus-ter consisting of many intercon-nected processing and storagenodes. While admission control,CPU and I/O scheduling ensureQoS guarantees, distributedresource management issuesinclude data placement,dynamic load balancing, cachemanagement, etc. Efficientresource management algo-rithms can make an order ofmagnitude difference in terms ofcost-effectiveness.

This tutorial will give casual par-ticipants an overview of the videoserver design issues, as well asprovide sophisticated designerswith new and timely informationabout this rapidly evolving area.Case studies of commercial serv-ers will be of interest to bothgroups.

Christoph LindemannGMD Research Institute, Berlin

Thursday, May 23, 19961:30 pm – 4:30 pm

Numerical Methods for Per-formance Modeling of Com-puter ArchitecturesWhile measurement is an attrac-tive option for assessing an exist-ing system or a prototype, it is

T3C

T4A


Grand Ballroom


not a feasible option during thesystem design and implementa-tion phases. Model-based evalu-ation has proven to be anattractive alternative in thesecases. The most appropriate typeof model depends upon the com-plexity of the system, the ques-tions to be studied, the accuracyrequired, and the resourcesavailable for the study. Deter-ministic and stochastic Petrinets (DSPNs), for example, are amodeling formalism well suitedto modeling distributed comput-ing systems and communicationnetworks.

This tutorial is particularlyintended for researchers andpractitioners interested in mod-eling the performance of com-puter systems. The backgroundis elementary probability andstatistics.

Sivaram ChelluriAT&T Global Information Solu-tions

Danny Chen/dev/counsel, Inc.

David GloverHewlett Packard Company, Inc.


Performance Measurement,Management, and CapacityPlanning of UNIX SystemsThis tutorial provides an intro-duction to the performance mea-surement and analysis toolsavailable on several variants ofthe UNIX system. We will presentthese tools primarily in the con-text of bottleneck analysis, sys-tem tuning, and resourceutilization. We will also surveysome of the commercially avail-able performance measurementand analysis packages and theirrole in performance analysis andcapacity planning. This includesan in-depth survey of availablebenchmarking technology fromthird parties and industry stan-dards groups. We will also dis-cuss the current state of the artand future trends in perfor-mance measurement and man-agement, includingstandardized interfaces.

Joe HellersteinIBM Research


An Introduction to Multivari-ate Statistics: Their Geome-try and ApplicationMultivariate statistical analysisis an invaluable tool in the studyof performance data, especiallyfor testing hypotheses, estimat-ing parameters, and predictingfuture observations. This tutorialprovides an introduction to sev-eral multivariate statistical tech-niques.

Key to multivariate statisticaltechniques are the concepts ofmulti-dimensional means, vari-ances, and covariances. All threecan be described using geomet-ric notions of distances, angles,and volumes. The tutorial illus-trates these relationships andthe mathematics underlyingmultivariate analysis.

With these concepts in hand,several multivariate statisticaltechniques are studied (e.g.,multivariate estimates ofdescriptive statistics; using mul-tivariate analysis to reduce thedimensionality of data; andusing multivariate least-squaresregression for predicting futureobservations).

Randy NelsonOTA Limited Partnership


Mathematical Techniques inFinancial EngineeringThere are a surprising number ofsimilarities between the mathe-matical techniques used in thefields of performance modelingand financial engineering. Thesesimilarities arise because finan-cial markets are inherentlyunpredictable and are thus ana-lyzed using probabilistic models.As with performance modeling,when problems are not mathe-matically tractable, solutionsare obtained from approxima-tions or simulations.

This tutorial explores the simi-larity of the two disciplines byanalyzing a selection of problemsthat are encountered in practice(e.g., pricing of financial instru-ments; optimal portfolios). Themodels and solutions discussedprovide a broad view of financialengineering, and reveal severalcomplementary views of how tomodel random price movements.

T4B

T4C

T5

11


ReceptionThursday, May 23, 19967:00 pm – 10:00 pm

SchedulingFriday, May 24, 19969:15 am – 10:45 am

Ken Sevcik, ChairUniversity of Toronto

9:15 amBringing Real-time Schedul-ing Theory and Practice Closerfor Multimedia ComputingR. Gopalakrishnan and G.M.ParulkarWashington University

9:45 amExploiting Process LifetimeDistributions for DynamicLoad BalancingMor Harchol-Balter and AllenDowneyUniversity of California, Berkeley

10:15 amEffective Local Scheduling ofParallel JobsAndrea C. Dusseau, RemziArpaci and David CullerUniversity of California, Berkeley


Parallel SystemsFriday, May 24, 199611:15 am – 12:45 pm

Margaret Martonosi, ChairPrinceton University

11:15 amLimits on the PerformanceBenefits of Multithreadingand PrefetchingBeng-Hong LimIBM T.J. Watson Research CenterRicardo BianchiniFederal University of Rio de Jan-eiro

11:45 amFast Message Assembly UsingCompact Address RelationsPeter Dinda and David O’Hal-laronCarnegie Mellon University

R

S1

S2

12:15 pmCoordinated Allocation ofMemory and Processors inMultiprocessorsEric Parsons and KennethSevcikUniversity of Toronto


SimulationFriday, May 24, 19962:15 pm – 3:45 pm

Phil Heidelberger, ChairIBM TJ Watson Research Center

2:15 pmEmbra: Fast and FlexibleMachine SimulationEmmett WitchelMITMendel RosenblumStanford University

2:45 pmExperiences with NetworkSimulationLawrence Brakmo and Larry L.PetersonThe University of Arizona

3:15 pmAsynchronous Updates inLarge Parallel SystemsAlbert GreenbergAT&T Bell LaboratoriesScott ShenkerXerox PARCAlexander StolyarMotorola


Poster SessionFriday, May 24, 19964:15 pm – 5:45 pm

Practical Algorithms for SelfScaling Histograms or Betterthan Average Data CollectionMichael GreenwaldStanford University

Integrating Parallel Prefetch-ing and CachingTracy KimbrelUniversity of WashingtonPei CaoUniversity of Wisconsin, Madison

L

S3

S4

12

Edward FeltenPrinceton UniversityAnna KarlinUniversity of WashingtonKai LiPrinceton University

A Buffer Model for Evaluatingthe Performance of R-treePacking AlgorithmsScott Leutenegger and Mario A.LopezUniversity of Denver

An Approach to Selecting Met-rics for Detecting PerformanceProblems in Information Sys-temsJoseph HellersteinIBM T.J. Watson Research Center

RAIDframe: Rapid Prototyp-ing for Disk ArraysGarth Gibson, WilliamCourtright II, Mark Holland andJim ZelenkaCarnegie Mellon University

Quantifying Achievable Rout-ing Performance in Multipro-cessor InterconnectionNetworksSwaminathan RamanyDigital Equipment CorporationDerek EagerUniversity of Saskatchewan

Analysis of the Early Workloadon the Cornell Theory CenterIBM SP2Steven Hotovy, David Schneiderand Timothy O’DonnellCornell Theory Center

NetworksSaturday, May 25, 19969:15 am – 10:45 am

Will Leland, ChairBellcore

9:15 amDesign and Analysis of Frame-based Fair Queing: A New Traf-fic Scheduling Algorithm forPacket Switched NetworksAnujan Varma and DimitriosStiliadisUniversity of California, SantaCruz

9:45 amNetworking Support for LargeScale Multiprocessor ServersDavid J. Yates, Erich M. Nahum,James F. Kurose and Don Tows-leyUniversity of Massachusetts,Amherst

S5

10:15 amWeb Server Workload Charac-terization: The Search forInvariantsMartin Arlitt and Carey L. Will-iamsonUniversity of Saskatchewan


Measurement and Moni-toringSaturday, May 25, 199611:15 am – 12:45 pm

Ed Gehringer, ChairNorth Carolina State University

11:15 amIntegrating Performance Moni-toring and Communication inParallel ComputersMargaret MartonosiPrinceton UniversityDavid Ofelt and Mark HeinrichStanford University

11:45 amMicro-architecture EvaluationUsing Performance VectorsUmesh Krishnaswamy and IsaacD. SchersonUniversity of California, Irvine

12:15 pmExplaining World Wide WebTraffic Self SimilarityMark Crovella and AzerBestavrosBoston University

Modeling and Analysis ISaturday, May 25, 19962:15 pm – 3:45 pm

Spencer Ng, ChairIBM Research, Almaden

2:15 pmOn the Modeling and Perfor-mance Characteristics of aSerpentine Tape DriveBruce Hillyer and Avi Silber-schatzAT&T Bell Laboratories

2:45 pmAn Analytic Model of Hierachi-cal Mass Storage Systems withNetwork-Attached StorageDevicesDaniel Menasce’George Mason University

S6

S7

Odysseas Ioannis Pentakalosand Yelena YeshaUniversity of Maryland BaltimoreCounty, CESDIS

3:15 pmAn Approximate Analysis ofWaiting Time in Multi-classesM/G/1/./EDF QueuesKen Chen and LaurentDecreusefondENST


Work In ProgressSaturday, May 25, 19964:15 pm – 5:45 pm

Larry Dowdy, ChairVanderbilt University

VideoSunday, May 26, 19969:15 am – 10:45 am

Joe Hellerstein, ChairIBM TJ Watson Research Center

9:15 amOn Optimal Piggyback MergingPolicies for Video-on-DemandSystemsJoel WolfIBM TJ Watson Research CenterCharu AggarwalMITPhilip S. YuIBM TJ Watson Research Cente

9:45 amExperiments with DigitalVideo PlaybackLadan Gharai and Richard Ger-berUniversity of Maryland

10:15 amSupporting Stored Video:Reducing Rate Variability andEnd-to-End Resource Require-ments through OptimalSmoothingJames Salehi, Zhi-Li Zhang,James F. Kurose and Don Tows-leyUniversity of Massachusetts,Amherst


S8

S9

Sessions

Modeling and Analysis IISunday, May 26, 199611:15 am – 12:45 pm

Alois Ferscha, ChairUniv. of Vienna

11:15 amAnalysis of Balanced Fork-JoinNetworksElizabeth Varki and Lawrence W.DowdyVanderbilt University

11:45 amEfficient Exploration of Avail-ability Models Guided by Fail-ure DistancesJuan Carrasco, Javier Escribaand Angel CalderonDepartament d’Enginyeria Elec-tronica, UPC

12:15 pmMinimizing Completion Timeof a Program by Checkpointingand RejuvenationKishor Trivedi, Sachin Garg,Yennun Huang and ChandraKintalaDuke University

S10

Committees

Daniel A. ReedUniversity of Illinois

General Chair

David NicolCollege of William and Mary

Program Chair

Carey WilliamsonUniversity of Saskatchewan

Tutorials Chair

Mark HolidayWestern Carolina University

Proceedings Editor

Daniel A. ReedUniversity of Illinois

Finance Chair

ADVISORY COMMITTEELarry DowdyChair

Murray WoodsideVice-chair

Scott LeuteneggerSecretary/treasurer

Mary VernonBoard of Directors

Richard MuntzBoard of Directors

Don TowsleyBoard of Directors

Linda WrightBoard of Directors


11:25 amEvaluation may be Easier thanGenerationMoni NaorWeizmann Institute

11:50 amThe PL Hierarchy CollapsesMitsunori OgiharaUniv. of Rochester

12:15 pmConvergence Complexity ofOptimistic Rate Based FlowControl AlgorithmsYehuda Afek, Yishay Mansourand Zvi OstfeldTel Aviv Univ.

Session 2BWednesday, May 22, 199611:25 am – 12:35 pm

ShangHua Teng, ChairUniv. of Minnesota

11:25 amGenerating Hard Instances ofLattice ProblemsM. AjtaiIBM Almaden

S2B

13


Session 1AWednesday, May 22, 19969:20 am – 10:55 am

Jin-Yi Cai, ChairSUNY Buffalo

9:20 amThe Linear-Array Conjecture ofCommunication Complexityis FalseEyal KushilevitzTechnionNathan LinialHebrew InstituteRafail OstrovskyBellcore

9:45 amTesting of the Long Code andHardness for CliqueJohan HåstadRoyal Institute of Technology

R

S1A

10:10 amThe Space Complexity ofApproximating the FrequencyMomentsNoga AlonTel Aviv Univ.Yossi Matias and Mario SzegedyAT&T Bell Laboratories

10:35 amDeterministic Restrictions inCircuit ComplexityShiva ChaudhuriMax-Planck Institut für InformatikJaikumar RadhakrishnanTata Institute of FundamentalResearch

Session 1BWednesday, May 22, 19969:20 am – 10:55 am

Monika R. Henzinger, ChairCornell

9:20 amFast Algorithms for k-NodeConnectivity Augmentationand Related ProblemsJoseph CheriyanUniv. of Waterloo

S1B

Ramakrishna ThurimellaUniv. of Denver

9:45 amApproximating s-t MinimumCuts in timeAndras A. Benczur and David R.KargerMIT

10:10 amMinimum Cuts in Near-LinearTimeDavid R. KargerMIT

10:35 amDeterministic Õ(nm) TimeEdge-Splitting in UndirectedGraphsHiroshi Nagamochi and Toshi-hide IbarakiKyoto Univ.


Session 2AWednesday, May 22, 199611:25 am – 12:25 pm

Jin-Yi Cai, ChairSUNY Buffalo

0 n2( )

S2A

PROGRAM COMMITTEEScott BadenUniversity of California at San Diego

Gianfranco CiardoCollege of William and Mary

Chita DasPennsylvania State University

Peter DanzigUniversity of Southern California

David DeWittUniversity of Wisconsin

Carla EllisDuke University

Alois FerschaUniversity of Vienna

Richard FujimotoGeorgia Institute of Technology

Committees


Sessions

Registration for the 28th Annual ACM Symposium on Theory of Computing includes a reception, SIGACTbusiness meeting, an evening excursion, two lunches, continental breakfasts, coffee breaks, and conferenceproceedings. Student registration fee includes all of the above except the evening excursion. The conference issponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT).

Bruno GaujalINRIA

Ed GehringerNorth Carolina State University

Robert GeistClemson University

Garth GibsonCarnegie Mellon University

Albert GreenbergAT&T Bell Laboratories

Anoop GuptaStanford University

Peter HarrisonImperial College

Philip HeidelbergerIBM Research

Graham HortonUniversity of Erlangen

Robert JumpRice University

Harry JordanUniversity of Colorado

David KotzDartmouth College

Will LelandBell Communications Research

Scott LeuteneggerUniversity of Denver

Miron LivnyUniversity of Wisconson

Dick MuntzUniversity of Calfornia at Los Angles

Vernon RegoPurdue University

Joel SaltzUniversity of Maryland

Sanjeev SetiaGeorge Mason University

Ken SevcikUniversity of Toronto

Rahul SimhaCollege of William and Mary

Billy StewartNorth Carolina State University

Mark SquillanteIBM Research

Xian-He SunLouisana State University

Don TowsleyUniversity of Massachusetts

Kishor TrivediDuke University

David WoodUniversity of Wisconson



Grand Ballroom


Sessions

11:50 amTranslational Polygon Con-tainment and Minimal Enclo-sure Using LinearProgramming Based Restric-tionVictor J. MilenkovicUniv. of Miami

12:15 pmPushing Disks Together--theContinuous-motion CaseMarshall BernXerox PARCAmit SahaiUC Berkeley


Session 3AWednesday, May 22, 19962:00 pm – 3:35 pm

Ronitt Rubinfeld, ChairCornell/MIT

2:00 pmLearning Sat-k-DNF Formulasfrom Membership QueriesF. BergadanoUniversitá di TorinoD. CatalanoUniversitá di CataniaS. VarricchioUniversitá di L’ Aquila

2:25 pmTowards the learnability ofDNF formulaeNader H. BshoutyUniv. of Calgary

2:50 pmNoise-tolerant Learning Nearthe Information-theoreticBoundN. Cesa-BianchiUniversitá di MilanoE. DichtermanTechnionP. Fischer and H.U. SimonUniversität Dortmund

3:15 pmNoise-tolerant Distribution-Free Learning of General Geo-metric ConceptsNader BshoutyCalgarySally Goldman, David Mathiasand Subhash SuriWashington UniversityHisao TamakiIBM Tokyo

L

S3A

Session 3BWednesday, May 22, 19962:00 pm – 3:35 pm

Erich Kaltofen, ChairRPI

2:00 pmThe Complexity of MatrixRank and Feasible Systems ofLinear EquationsE. AllenderRutgersR. BealsDIMACS, RutgersM. OgiharaUniv. of Rochester

2:25 amComputing Roadmaps of Semi-algebraic SetsSaugata Basu and Richard Pol-lackCourant InstituteMarie-Françoise RoyIRMAR, Université de Rennes

2:50 pmUsing the Groebner Basis Algo-rithm to find Proofs of Unsatis-fiabilityMatthew CleggUCSDJeffery EdmondsYork Univ.Russell ImpagliazzoUCSD

3:15 pmSparsity Considerations inDixon ResultantsDeepak Kapur and Tushar Sax-enaSUNY Albany


Session 4AWednesday, May 22, 19964:05 pm – 5:40 pm

Monika R. Henzinger, ChairCornell

4:05 pmEfficient 3-d Range Searchingin External MemoryDarren Erick VengroffBrown, DukeJeffery Scott VitterDuke

4:30 pmPurely Functional Representa-tions of Catenable Sorted Lists

S3B

S4A

Haim Kaplan and Robert E. Tar-janPrinceton

4:55 pmA Fast Quantum MechanicalAlgorithm for Database SearchLov K. GroverAT&T Bell Laboratories

Session 4BWednesday, May 22, 19964:05 pm – 5:40 pm

Ronitt Rubinfeld, ChairCornell/MIT

4:05 pmConstructing EvolutionaryTrees in the Presence of Poly-morphic CharactersMaria Bonet, Tandy J. Warnowand Shibu YoosephUniv. of PennsylvaniaCynthia PhillipsSandia National Labs

4:30 pmEfficient Algorithms forInverting EvolutionMartin FarachRutgersSampath KannanUniv. of Pennsylvania

Session 5AThursday, May 23, 19969:20 am – 10:55 am

Maurice Herlihy, ChairBrown

9:20 amModular Competitiveness forDistributed AlgorithmsJames AspnesYaleOrli WaartsUC Berkeley

9:45 amCommunication-Efficient Par-allel SortingMichael T. GoodrichJohns Hopkins

10:10 amAutomatic Methods for HidingLatency in High BandwidthNetworksMatthew Andrews, Tom Leightonand Lisa ZhangMITP. Takis MetaxasWellesley

S4B

S5A

10:35 amAn -Size Fault-Toler-ant Sorting NetworkYuan MaStanford

Session 5BThursday, May 23, 19969:20 am – 10:55 am

Alistair Sinclair, ChairUC Berkeley

9:20 amOn Extracting RandomnessFrom Weak Random SourcesAmnon Ta-ShmaHebrew Univ.

9:45 amRandomness-Optimal Sam-pling, Extractors, and Con-structive Leader ElectionDavid ZuckermannUniv. of Texas, Austin

10:10 amGenerating Random SpanningTrees More Quickly than theCover TimeDavid Bruce WilsonMIT

10:35 amTowards an Analysis of LocalOptimization AlgorithmsTassos Dimitriou and RussellImpagliazzoUCSD


Knuth Prize LectureThursday, May 23, 199611:30 am – 12:30 pm

Andrew C.-C. YaoPrinceton


Session 7AThursday, May 23, 19962:00 pm – 3:35 pm

Michel Goemans, ChairMIT

0 n nlog( )

S5B

S6

L

S7A

14

9:20 amCorrelated Pseudorandom-ness and the Complexity ofPrivate ComputationsDonald BeaverTransarc Corp.

9:45 amDigital Signets for Protectionof Digital InformationCynthia Dwork and JefferyLotspiechIBM AlmadenMoni NaorWeizmann Institute

10:10 amWitness-Based CryptographicProgram Checking and RobustFunction SharingYair Frankel and Peter GemmellSandia National LabsMoti YungIBM T.J. Watson


Session 10AFriday, May 24, 199611:00 am – 12:20 pm

Serge Plotkin, ChairStanford

11:00 amNon-Expansive HashingNathan Linial and Ori SassonHebrew Univ.

11:25 amMaking Commitments in theFace of Uncertainty: How toPick a Winner Almost EveryTimeBaruch AwerbuchJohns HopkinsYossi Azar and Amos FiatTel Aviv Univ.Tom LeightonMIT

11:50 amLower Bounds for On-lineGraph Problems with Applica-tion to On-Line Circuit andOptical RoutingYair BartalUC BerkeleyAmos FiatTel Aviv Univ.Stefano LeonardiUniversitá di Roma

S10A

2:00 pmA Threshold of ln n for Approx-imating Set CoverUriel FeigeWeizmann Institute

2:25 pmFast Algorithms for ParametricScheduling come from Exten-sions to Parametric MaximumFlowS. Thomas McCormickUBC

2:50 pmTowards a Syntactic Charac-terization of ptasSanjeev Khanna and Rajeev Mot-waniStanford

3:15 pmEfficient Approximation Algo-rithms for MAX-CUT and COL-ORINGPhilip Klein and Hsueh-I LuBrown

Session 7BThursday, May 23, 19962:00 pm – 3:35 pm

Abhiram Ranade, ChairUC Berkeley

2:00 pmDynamic Deflection Routingon ArraysAndrei BorderDigital Systems ResearchEli UpfalIBM Almaden

2:25 pmUniversal Algorithms for Store-and-Forward and WormholeRoutingRobert CypherJohns HopkinsFriedhelm Meyer auf der Heide,Christian Scheideler and Ber-thold VockingUniv. of Paderborn

2:50 pmDistributed Packet Switchingin Arbitrary NetworksYuval Rabini and Eva TardosCornell

3:15 pmAdversarial Queueing TheoryAllan BorodinUniv. of TorontoJon KleinbergMIT

S7B

Parbhakar RaghavanIBM AlmadenMadhu Sudan and David P. Wil-laimsonIBM T.J.Watson


Session 8AThursday, May 23, 19964:05 pm – 5:40 pm

Gary L. Miller, ChairCMU

4:05 pmComputing Betti Numbers viaCombinatorial LaplaciansJoel FriedmanUBC

4:30 pmEmbedding Graphs in an Arbi-trary Surface in Linear TimeBojan MoharUniversity of Ljubljana

4:55 pmAlgorithms for Manifolds andSimplicial Complexes inEuclidean 3-SpaceTamal K. DeyI.I.T. KharagpurSumanta GuhaUniv. of Wisconsin

5:20 pmOn Bounding the Betti Num-bers and Computing the EulerCharacteristic of Semi-alge-braic SetsSaugata BasuCourant Institute

Session 8BThursday, May 23, 19964:05 pm – 5:40 pm

Vijay Vazirani, ChairGeorgia Tech

4:05 pmApproximability and Nonap-proximability Results for Mini-mizing Total Flow Time on aSingle MachingHans KellererUniversität GrazThomas TautenhahnUniversität MagdeburgGerhard J. WoegingerEindhoven Univ.

S8A

S8B

4:30 pmHow Good is the Goemans-Wil-liamson MAX CUT Algorithm?Howard J. KarloffGeorgia Tech

4:55 pmA Tight Analysis of the GreedyAlgorithm for Set CoverPetr SlavikSUNY Buffalo

5:20 pmA Constant-factor Approxima-tion Algorithm for the k-MSTProblemAvrim Blum, R. Ravi and San-tosh VempalaCMU

SIGACT Business MeetingThursday, May 23, 19969:00 pm

Session 9AFriday, May 24, 19969:20 am – 10:30 am

Thomas Lengauer, ChairGMD

9:20 amReconstructing a Three-Dimensional Model with Arbi-trary ErrorsBonnie Berger, Jon Kleinbergand Tom LeightonMIT

9:45 amOn the Boosting Ability of Top-Down Decision Tree LearningAlgorithmsMichael KearnsAT&T Bell LaboratoriesYishay MansourTel Aviv Univ.

10:10 amRobot Navigation with RangeQueriesDana Angluin, Jeffery Westbrookand Wenhong ZhuYale

Session 9BFriday, May 24, 19969:20 am – 10:30 am

Joe Kilian, ChairNECI

M

S9A

S9B


Sessions

15

16


Sessions

Session 10BFriday, May 24, 199611:00 am – 12:10 pm

Noam Nisan, ChairHebrew Univ.

11:00 amCharacterizing Linear Size Cir-cuits in Terms of PrivacyEyal KushilevitzTechnionRafail OstrovskyBellcoreAdi RosenTel Aviv Univ.

11:25 amNondeterministic Communica-tion with a Limited Number ofAdvice BitsJuraj HromkovicUniversität zu KielGeorg SchnitgerJohann Wolfgang Goethe-Univer-sität

11:50 amPublic vs. Private Coin Flips inOne Round CommunicationGamesIlan NewmanHaifa Univ.Mario SzegedyAT&T Bell Laboratories

Session 11AFriday, May 24, 19962:00 pm – 3:35 pm

Alan Frieze, ChairCMU

2:00 pmEfficiently Four-coloring Pla-nar GraphsNeil Robertson and Daniel P.SandersOhio StatePaul SeymourBellcoreRobin ThomasGeorgia Tech

2:25 pmThe Angle-TSP Problem andthe Weighted Linear MatroidParity ProblemA. Aggarwal, D. Coppersmithand B. SchieberIBM T.J. WatsonS. Khanna and R. MotwaniStanford

S10B

S11A

2:50 pmFaster Isomorphism Testing ofStrongly Regular GraphsDaniel A. SpielmanUC Berkeley

3:15 pmNode-Disjoint Paths on theMesh and a New Trade-off inVLSI LayoutAlok Aggarwal and David P. Will-iamsonIBM ResearchJon M. KleinbergMIT

Session 11BFriday, May 24, 19962:00 pm – 3:35 pm

Alistair Sinclair, ChairUC Berkeley

2:00 pmModular 2 Counting FormulasAre Hard for Cutting PlanesProofsXudong FuUniv. of Toronto

2:25 pmExtremal Bipartite Graphsand Superpolynomial LowerBounds for Monotone SpanProgramsLaszlo BabaiUniv. of ChicagoAnna GalInstitute for Advanced StudyJanos KollarUniv. of UtahLajos RonyaiHungarian Academy of SciencesTibor SzaboOhio StateAvi WigdersonHebrew Univ.

2:50 pmA Lower Bound for Random-ized Algebraic Decision TreesDima GrigorievPenn StateMarek Karpinski and RomanSmolenskyUniv. of BonnFriedhelm Meyer auf der HeideUniv. of Paderborn

3:15 pmLower Bounds for Noisy Bool-ean Decision TreesWilliam Evans and Nicholas Pip-pengerUBC

S11B


Session 12Friday, May 24, 19964:05 pm – 5:40 pm

Sanjeev Arora, ChairPrinceton

4:05 pmAdaptive Zero Knowledge andComputational EquivocationDonald BeaverTransarc Corp.

4:30 pmAdaptively Secure MultipartyComputationRan CanettiMITUri Feige, Oded Goldreich andMoni NaorWeizmann Institute

4:55 pmOn Relationships between Sta-tistical Zero-Knowledge ProofsTatsuaki OkamotoNTT Labs.

S12

David S. JohnsonAT&T Research

General Chair

Gary L. MillerCarnegie-Mellon University

Program Chair

Alok AggarwalIBM Research

Finance Chair

PROGRAM COMMITTEESanjeev AroraPrinceton

Jin-Yi CaiSUNY Buffalo

Alan FriezeCMU

Erich KaltofenRPI

Joe KilianNECI

Michel GoemansMIT

Monika R. HenzingerCornell

Maurice HerlihyBrown

Thomas LengauerGMD

Gary L. MillerCMU

Noam NisanHebrew Univ.

Serge PlotkinStanford

Pavel PudlakPrague

Abhiram RanadeBerkeley

Ronitt RubinfeldCornell/MIT

Alistair SinclairUC Berkeley

ShangHua TengUniv. of Minnesota

Les ValiantHarvard

Vijay VaziraniGeorgia Tech

Committees

Exhibits

Wednesday – Sunday

9:00 am – 6:00 pm

Room: Franklin Hall

Invited Speakers:

Noam NisanFriday, May 24, 1996Extractors, Dispersers, andtheir Applications

Mike SaksSaturday, May 25, 1996Randomization and Deran-domization in SpaceBounded Complexity

Alan L. SelmanSunday, May 26, 1996Much Ado about Functions

Christos PapadimitriouMonday, May 27, 1996The Complexity of Knowl-edge Representation


Session 1Friday, May 24, 19969:15 am – 10:40 am

Birgit Jenner, Chair

9:20 amAn Isomorphism Theorem forCircuit ComplexityM. AgrawalU. UlmE. AllenderRutgers

10:00 amNondeterministic NC1 Compu-tationH. Caussinus and P. McKenzieU. MontréalD. ThérienMcGill U.H. VollmerU. Würzburg


Session 2Friday, May 24, 199611:10 am - 12:30 pm

Mitsunori Ogihara, Chair

R

S1

S2

11:10 amParallel Complexity Hierar-chies Based on PRAMs andDLOGTIME-Uniform CircuitsK. IwamaKyushu U.C. IwamotoKyushu Institute of Design

11:50 amCollapsing Oracle-Tape Hierar-chiesG. GottlobTechnische U. Wien


David Zuckerman, Chair

2:00 pmExtractors, Dispersers, andtheir Applications(Invited Presentation)Noam NisanHebrew Univ.

3:00 pmOn Coherence, Random-self-reducibility, and Self-correc-tionJ. FeigenbaumAT&T Bell LabsL. Fortnow, S. Laplante and A.NaikU. Chicago


Session 4Friday, May 24, 19964:10 pm - 5:10 pm

Carsten Lund, Chair

4:10 pmError Reduction by ParallelRepetition - a Negative ResultU. FeigeWeizmann InstituteOleg VerbitskyLviv University

S3

S4

4:30 pmDeciding the Vapnik-Cer-vonenkis Dimension is -CompleteM. SchaeferUniv. Chicago

4:50 pmVC Dimension in Circuit Com-plexityP. KoiranEcole Normale Sup. Lyon

Session 5Saturday, May 25, 19969:20 am – 10:40 am

Jin-Yi Cai, Chair

9:20 amReducing P to a Sparse SetUsing a Constant Number ofQueries Collapses P to LD. van MelkebeekU. Chicago

10:00 amLogspace Printability and Iso-morphismJ. Goldsmith and M. LevyU. KentuckyS. MahaneyDIMACS


Session 6Saturday, May 25, 199611:10 am - 12:30 pm

Luc Longpré, Chair

11:10 amHierarchies of Circuit Classesthat are Closed under Comple-mentV. VinayIndian Institute of Science, Ban-galore

11:50 amSuccinct Representation, LeafLanguages, and ProjectionReductionsH.VeithTechnische U. Wien

Σ3

p

S5

S6

Session 7Saturday, May 25, 19962:00 pm – 3:40 pm

Jin-Yi Cai, Chair

2:00 pmRandomization and Deran-domization in Space BoundedComplexity(Invited Presentation)Mike SaksRutgers University

3:00 pmOn the Measure of Two-dimen-sional Regions with Polyno-mial-time ComputableBoundariesKer-I KoSUNY Stony BrookK. WeihrauchFern U. Germany


Rump SessionSaturday, May 25, 19964:00 pm - 5:45 pm

Session 9Sunday, May 26, 19969:20 am – 10:40 am

Jack Lutz, Chair

9:20 amOn Positive PC. Lautemann and T. Sch-wentickU. Mainz, GermanyI. A. StewartU. Wales, UK

10:00 amA Comparison of Weak Com-pleteness NotionsK. Ambos-Spies and X. ZhengU. HeidelbergE. MayordomoU. Zaragoza


S7

S8

S9

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

Sessions

17

Registration for the 11th Annual IEEE Conference on Computational Complexity (previously Structures)includes a reception, business meeting, evening excursion, Rump Sessions, continental breakfasts, coffeebreaks, and conference proceedings. Student registration fee includes all of the above except the eveningexcursion. The conference is sponsored by the IEEE Technical Committee on Mathematical Foundations ofComputing.


Grand Ballroom

Sessions

Session 10Sunday, May 26, 199611:10 am - 12:30 pm

Jack Lutz, Chair

11:10 amStochastic Properties of Lutz-Random SequencesY. WangU. Heidelberg

11:50 amTruth-table Closure and TuringClosure of Average PolynomialTime Have Different Measuresin EXPR. SchulerU. Ulm

Session 11Sunday, May 26, 19962:00 pm – 3:40 pm

Mitsunori Ogihara, Chair

2:00 pmMuch Ado about Functions(Invited Presentation)Alan L. SelmanSUNY Buffalo

3:00 pmOn Inverting Onto FunctionsS. FennerU. Southern MaineL. Fortnow and A. NaikU. ChicagoJ. RogersDepaul U.


Session 12Sunday, May 26, 19964:10 pm - 5:30 pm

Jie Wang, Chair

4:10 pmA Note on P-selective Sets andon Adaptive versus Nonadap-tive Queries to NP

S10

S11

S12

A. NaikU. ChicagoA. SelmanSUNY Buffalo

4:50 pmGood Degree Bounds onNullstellensatz Refutations ofthe Induction PrincipleS. BussU.C. San DiegoT. PitassiU. Pennsylvania

Business MeetingSunday, May 26, 19968:30 pm

Session 13Monday, May 27, 19968:30 am - 10:10 pm

Kevin Compton, Chair

8:30 amThe Complexity of KnowledgeRepresentation(Invited Presentation)Christos PapadimitriouU.C. San Diego

9:30 amInteger Programming as aFramework for Optimizationand ApproximabilityI. Barland and P. KolaitisU.C. Santa CruzM. ThakurBorland International


Session 14Monday, May 27, 199610:30 am - 12:30 pm

Luc Longpré, Chair

10:30 amComplements of MultivaluedFunctions

M

S13

S14

S. FennerU. Southern MaineF. GreenClark Univ.S. HomerBoston Univ.A. SelmanSUNY BuffaloT. ThieraufU. UlmH. VollmerU. Würzburg

11:10 amA Note on Decision versusSearch for Graph Automor-phismM. AgrawalU. UlmV. ArvindInstitute of Mathematical Sci-ences, Madras

11:50 amZero Knowledge and the Chro-matic NumberUriel FeigeWeizmann InstituteJoe KilianNEC Research Institute

Session 15Monday, May 27, 19962:00 pm – 3:30 pm

Carsten Lund, Chair

2:00 pmDNA Models and Algorithmsfor NP-Complete ProblemsE. Bach, A. Condon, E. Glaserand C. TanguayU. Wisconsin

2:40 pmReversible Simulation of Irre-versible ComputationM. LiU. WaterlooP. VitányiCWI and U. Amsterdam

S15

Steven HomerBoston University

General Chair

Luc LongpréUniversity of Texas, El Paso

Publicity Chair

Jin-Yi CaiSUNY at Buffalo

Program Chair

CONFERENCE COMMITTEEEric AllenderRutgers University

Anne CondonUniversity of Wisconsin

Joan FeigenbaumAT&T Bell Laboratories

Lance FortnowUniversity of Chicago

Noam NisanHebrew University

Uwe SchöningUniversität Ulm

PROGRAM COMMITTEEJin-Yi CaiSUNY at Buffalo

Kevin ComptonUniversity of Michigan

Birgit JennerTübingen University

Luc LongpréUniversity of Texas, El Paso

Carsten LundAT&T Bell Laboratories

Jack LutzIowa State University

Mitsunori OgiharaUniversity of Rochester

Jie WangUniversity of North Carolina,Greensboro

David ZuckermanUniversity of Texas, Austin

Committees

18

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

“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

Registration for the 15th Annual Symposium on Principles of Distributed Computing includes a reception,the conference business meeting, one lunch, an evening excursion, continental breakfasts, coffee breaks, andconference proceedings. Student registration fee includes all of the above except lunch and the evening excur-sion. The conference is sponsored by the ACM Special Interest Group for Automata and Computability Theoryand the ACM Special Interest Group for Operating Systems Principles.


Sessions

Note:Paper titles preceded by an“=>” are Brief Announcements



Ray Strong, ChairIBM Almaden

Memory Requirements forSilent StabilizationShlomi DolevBen-Gurion UniversityMohamed G. Gouda and MarcoSchneiderUniversity of Texas at Austin

Self-Stabilization by WindowWashingAdam Costello and GeorgeVargheseWashington University in St.Louis

Fault-Containing Self-Stabiliz-ing AlgorithmsSukumar Ghosh, ArobindaGupta, Ted Herman and SriramV. PemmarajuUniversity of Iowa

=>Mutually Consistent Record-ing in Asynchronous Computa-tionsRoberto Baldoni, Jean-MichelHelary and Michel RaynalIRISA

=>Minimizing Access Costs inReplicated Distributed Sys-temsMichael GoldweberBeloit CollegeDonald JohnsonDartmouth College

=>On the Borowsky-Gafni Sim-ulation AlgorithmNancy LynchMITSergio RajsbaumUNAM Mexico

R

S1


Session 2Friday, May 24, 199611:00 am – 12:30 pm

Joint ISCA/PODC Panel andDiscussion



Douglas B. Terry, ChairXerox Parc

Trade-Offs in ImplementingOptimal Message Logging Pro-tocolsLorenzo AlvisiCornell UniversityKeith MarzulloU.C. San Diego

Efficient Message Ordering inDynamic NetworksIdit Keidar and Danny DolevHebrew University

An efficient recovery-basedspin lock protocol for preemp-tive shared memoInjong RheeEmory UniversityChi-Yung LeeUniversity of Warwick

=>An Optimal Algorithm forGeneralized Causal MessageOrderingAjay KshemkalyaniIBM Research TriangleMukesh SinghalOhio State University

=>Characterization of Mes-sage Ordering Specificationsand ProtocolsV. V. Murty and V. K. GargUniversity of Texas at Austin

S2

L

S3

=>Efficient Delta-CausalBroadcasting of MultimediaApplicationsRoberto Baldon and MichelRaynalIRISARavi Prakash and Mukesh Sin-ghalOhio State University

=>Comparing Primary-Backupand State Machines for CrashFailuresJeremy B. Sussman and KeithMarzulloU.C. San Diego



Mark R. Tuttle, ChairDEC CRL

Refining Knowledge OrientedActions to Layered Implemen-tationsWil JanssenUniversity of Oldenburg

Automated Logical Verifica-tion Based on Trace Abstrac-tionsNils Klarlund, Mogens Nielsenand Kim SunesenUniversity of Aarhus

Synthesis of Concurrent Sys-tems for an Atomic ReadAtomic Write Model of Compu-tationPaul Attie and Allen EmersonUniversity of Texas at Austin

=>Synthesis of DistributedConcurrent SystemsEvelyn Tumlin PierceUniversity of Texas at Austin

=>I/O Automata Based Verifi-cation of Finite State Distrib-uted Systems; ComplexityIssuesSandeep K. Shukla, Harry B.Hunt III, Daniel J. Rosenkrantz,S. S. Ravi and R. E. StearnsSUNY Albany

S4

=>Using Event Structure forthe Efficient Analysis of StatesGraphsDominique Ambroise and Brig-itte RozoyUniversite de Paris XI

=>Testing Concurrent DataStructuresJohn L. BrunoUC Santa BarbaraPhillip B. Gibbons and StevenPhillipsAT&T Bell Laboratories

Business MeetingFriday, May 24, 19967:30 pm - 8:30 pm

Rump SessionFriday, May 24, 19968:30 pm - 10:00 pm


Pierre Fraigniaud, ChairLIP-CNRS

Memory Requirement forRouting in Distributed Net-worksCyril GavoilleEcole Normale Superieure deLyonStephane Perennes

Optimal Routing TablesHarry Buhrman and Jaap-HenkHoepmanCWIPaul M. B. VitanyiCWI and University of Amster-dam

Spreading Rumors RapidlyDespite an AdversaryJames Aspnes and Will HurwoodYale

=>Fast, Long-Lived RenamingImproved and Simplified

M

S5

S6

19


Grand Ballroom

Mark MoirUniversity of Carolina at ChapelHillJuan A. GarayIBM T.J. Watson

=>The Complexity of DataMining on the WebEvangelos Kranakis and DannyKrizancCarleton UniversityAndrzej PelcUniversite de Quebec a HullDavid PelegWeizmann Institute

=>Efficient Token-based Con-trol in RingsEsteban FeuersteinUniversidad de Buenos Aires andUniversidad de General Sacra-mentoStefano Leonardi and AlbertoMarchetti-SpaccamelaUniversita di Roma “La sapienza”Nicola SantoroCarleton University

=>Efficient Traffic Laws forMobile RobotsSonne PremingerWeizmann InstituteEli UpfalWeizmann Institute and IBMAlmaden


Session 7Saturday, May 25, 199611:20 am – 12:35 pm

Yoram Moses, ChairWeizmann Institute

Strong-Feasibilities of Equiva-lence-CompletionsYuh-Jzer JoungNational Taiwan University

Polylog Randomized Wait-Free ConsensusTushar Deepak ChandraIBM T.J. Watson

=>Asynchrony versus Bulk-Synchrony in QRQW PRAMModelsPhillip B. Gibbons and YossiMatiasAT&T Bell LaboratoriesVijaya RamachandranUniversity of Texas at Austin

=>Constructing a ReliableTest&set Bit(Extended Abstract)

S7

Frank StompAT&T Bell LaboratoriesGadi TaubenfeldAT&T Bell Laboratories andIsrael Open University

=>Space-efficient Construc-tion of Buffer-optimal 1-Writer 1-Reader MultivaluedAtomic VariableS. HaldarTata InstituteK. VidyasankarMemorial U. of Newfoundland

=>Randomized AdaptiveVideo on DemandC. Bouras, V. Kapoulas, T.Pantziou and P. SpirakisPatras University

=>Message and Time EfficientDistributed Algorithms forSparse k-connectivity Certifi-catesEsther Jennings and LenkaMatyckovaLulea University of Technology


James Aspnes, ChairYale

Randomness in Private Com-putationsEyal KushilevitzTechnionYishay MansourTel-Aviv University

Distributed Pseudo-RandomBit Generators: A New Way toSpeed-Up Shared Coin TossingMihir BellareU.C. San DiegoJuan GarayIBM T.J. WatsonTal RabinMIT

A Randomized ByzantineAgreement Protocol with Con-stant Expected Time andGuaranteed Termination inOptimal (Deterministic) TimeArkady ZamskyTechnion

=>Early-Stopping TerminatingReliable Broadcast Protocol forGeneral Omission FailuresMarcel-Catalin RosuCornell University

S8

=>Baked Potatoes: DeadlockPrevention Via SchedulingShlomi DolevBen-Gurion UniversityEvangelos Kranakis and DannyKrizancCarleton University

=>Witness-based Crypto-graphic Program Checking andRobust Function Sharing(Announcement)Yair Frankel and Peter GemmelSandia National LaboratoriesMoti YungIBM T.J. Watson

=>On the Convergence Com-plexity of Optimistic RateBased Flow Control Algo-rithmsYehuda Afek, Yishay Mansourand Zvi OstfeldTel-Aviv University



Eli Gafni, ChairU.C. Los Angeles

The Power of Multi-objectsYehuda AfekTel-Aviv UniversityMichael MerrittAT&T Bell LaboratoriesGadi TaubenfeldAT&T Bell Laboratories andIsrael Open University

Universal Operations: Unaryversus BinaryHagit Attiya and Eyal DaganTechnion

Real-Time Object Sharing withMinimal System SupportSrikanth Ramamurthy, MarkMoir and James H. AndersonUniversity of North Carolina atChapel Hill

=>Space Bounds for Transac-tional SynchronizationJohn ValoisRensselaer Polytechnic Institute

=>What Critical AlgebraicProperty Allows Operations ofConcurrent Abstract DataTypes to be Fast?Martha J. KosaTennessee Technological Univer-sity

S9

=>The Role of Data-Race-FreePrograms in Recoverable DSMSoma ChaudhuriIowa UniversitySundar Kanthadai and JenniferWelchTexas A & M University

=>Crash Failures vs. Crash +Link FailuresAnindya Basu and Sam TouegCornell UniversityBernadette Charron-BostEcole Polytechnic


Ambuj K. Singh, ChairU.C. Santa Barbara

Crash Failures Can Drive Pro-tocols to Arbitrary StatesMahesh Jayaram and GeorgeVargheseWashington University in St.Louis

Time and Space Lower Boundsfor Non-Blocking Implementa-tionsPrasad JayantiDartmouth CollegeKing Tan and Sam TouegCornell University

Simple, Fast, and PracticalNon-Blocking and BlockingConcurrent Queue AlgorithmsMaged Michael and MichaelScottUniversity of Rochester

=>A Proof of a Theorem inAlgebraic Topology by a Dis-tributed AlgorithmEli GafniU.C. Los Angeles

=>Wait-Free Solvability viaCombinatorial TopologyMarios MavronicolasUniversity of Cyprus

=>Simulation as an IteratedTaskEli GafniU.C. Los Angeles

=>On the Decidability of Dis-tributed Decision TasksMaurice HerlihyBrown UniversitySergio RajsbaumUNAM Mexico

S10


Sessions

20

Committees


Session 11Sunday, May 26, 199611:20 am – 12:35 pm

Tal Rabin, ChairMIT

Counting Networks are Practi-cally LinearizableNancy Lynch and Alex Shvarts-manMITNir ShavitTel-Aviv University and MITDan TouitouTel-Aviv University

How to be an Efficient Snoop,or the Probe Complexity ofQuorum SystemsDavid Peleg and Avishai WoolWeizmann Institute

Eventually-Serializable DataServicesAlan FeketeUniversity of SidneyDavid Gupta, Victor Luchangco,Nancy Lynch and Alex Shvarts-manMIT

=>From Serializable to CausalTransactions for CollaborativeApplicationsM. Raynal and G. ThiakimeIRISA, Campus de BeaulieuM. AhamadGeorgia Institute of Technology

=>The Strength of CountingNetworksCostas Busch and MariosMavronicolasUniversity of Cyprus

S11

=>Tight Bounds on the Cumu-lative Profit of Distributed Vot-ersPeter AuerUC Santa CruzPasquale CaianielloUniversita dell’AquilaNicolo Cesa-BianchiUniversita di Milano

=>The Offset ProblemLenore CowenJohns Hopkins UniversityRudolph MatharAachen University of Technology


Sergio Rajsbaum, ChairUNAM Mexico

Fail-Awareness in Timed Asyn-chronous SystemsChristof Fetzer and Flaviu Cris-tianU.C. San Diego

A New Look at MembershipServicesGil NeigerIntel Corporation

On the Impossibility of GroupMembershipTushar Deepak ChandraIBM T.J. WatsonVassos HadzilacosUniversity of TorontoSam TouegCornell UniversityBernadette Charron-BostEcole Polytechnic

S12

=>Collective ConsistencyCynthia Dwork, Ching-Tien Hoand Ray StrongIBM Almaden

=>Perfect Failure Detectorsand (Repeated) Reliable Broad-castAleta RicciardiUniversity of Texas at Austin

=>A Framework for Partition-able Membership ServiceDanny DolevHebrew UniversityDalia MalkiAT&T Bell LaboratoriesRay StrongIBM Almaden

=>Evaluating Quorum SystemsOver the InternetYair AmirHebrew UniversityAvishai WoolWeizmann Institute

James E. BurnsBellcore

General Chair

Yoram MosesWeizmann Institute

Program Chair

Brian CoanBellcore

Finance Chair

STEERING COMMITTEEMaurice HerlihyBrown University

Chair

James E. BurnsBellcore

Brian CoanBellcore

Vassos HadzilacosUniversity of Toronto

Barbara LiskovMIT


David PelegWeizmann Institute

PROGRAM COMMITTEEJames AspnesYale University

Benny ChorTechnion

Pierre FraigniaudLIP--CNRS

Eli GafniU.C. Los Angeles


Tal RabinMIT

Sergio RajsbaumUNAM Mexico

Ambuj K. SinghU.C. Santa Barbara

Ray StrongIBM Almaden

Douglas B. TerryXerox PARC

Mark R. TuttleDEC CRL

Jeannette M. WingCMU

Job ZwiersUniversity of Twente


Sessions

21

Philadelphia

“The Nation’s Friendliest City”

Conde Nast Traveler

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

Sessions



Sue Whitesides, ChairMcGill University

9:15 amNew Lower Bounds for ConvexHull Problems in Odd Dimen-sionsJeff Erickson

9:40 amShadows and Slices of Poly-topesNina Amenta and Günter Ziegler

10:05 amVertical Decomposition of aSingle Cell in a Three-Dimen-sional Arrangement of Sur-faces and its ApplicationsOtfried Schwarzkopf and MichaSharir

10:30 amOn the Number of Arrange-ments of PseudolinesStefan Felsner


Session 2Friday, May 24, 199611:20 am - 12:35 pm

Marshall Bern, ChairXerox PARC

11:20 amOn Triangulating Three-Dimensional PolygonsGill Barequet, Matthew Dicker-son and David Eppstein

11:45 amAn Aspect Ratio Bound for Tri-angulating a d-Grid Cut by aHyperplaceScott A. Mitchell and Stephen A.Vavasis

R

S1

S2

12:10 pmLinear Complexity HexahedralMesh GenerationDavid Eppstein


Nicholas Patrikalakis, ChairMIT

2:00 pmCombinatorial and Experimen-tal Results for RandomizedPoint Matching AlgorithmsSandy Irani and PrabhakarRaghavan

2:25 pmTemporally Coherent Conser-vative VisibilitySatyan Coorg and Seth Teller

2:50 pmSplitting a Complex of ConvexPolytopes in any DimensionChandrajit L. Bajaj and ValerioPascucci

3:15 pmA Computational Algorithmfor Origami DesignRobert J. Lang



Pankaj K. Agarwal, ChairDuke University

4:05 pmA Near-Linear Algorithm forthe Planar 2-Center ProblemMicha Sharir

4:30 pmOn Piercing Sets of ObjectsMatthew J. Katz and FranckNielsen

S3

S4

Registration for the 12th Annual ACM Symposium on Computational Geometry includes a welcoming recep-tion, business meeting, an evening excursion, continental breakfasts, coffee breaks, a copy of the conferenceproceedings, and a copy of the video proceedings. Student registration fee includes all of the above except theevening excursion. The conference is sponsored by the ACM Special Interest Group on Algorithms and Com-putation Theory (SIGACT) and the ACM Special Interest Group on Graphics (SIGGRAPH).

4:55 pmRectilinear and Polygonal p-Piercing and p-Center Prob-lemsMicha Sharir and Emo Welzl

Business MeetingFriday, May 24, 19967:30 pm

Joseph Mitchell, ChairSUNY-Stony Brook


Victor Milenkovic, ChairUniversity of Miami

9:15 amParallel Robust Algorithms forConstructing Strongly ConvexHullsWei Chen, Koichi Wada andKimio Kawaguchi

9:40 amRobust Adaptive Floating-Point Geometric PredicatesJonathan Shewchuk

10:05 amOn the Bit Complexity of Mini-mum Link Paths: Superqua-dratic Algorithms for ProblemsSolvable in Linear timeSimon Kahan and Jack Snoey-ink

10:30 amChecking Geometric Pro-grams or Verification of Geo-metric StructuresKurt Mehlhorn, Stefan Näher,Michael Seel, Raimund Seidel,Thomas Schilz, Stefan Schirraand Christian Uhrig


Session 6Saturday, May 25, 199611:20 am - 12:35 pm

M

S5

S6

Pankaj K. Agarwal, ChairDuke University

11:20 amOn Computing Voronoi Dia-grams by Divide-Prune-and-ConquerNancy M. Amato and Edgar A.Ramos

11:45 amFaster Output-Sensitive Paral-lel Convex Hulls for d < 3:Optimal Sublogarithmic Algo-rithms for Small OutputsNeelima Gupta and Sandeep Sen

12:10 pmDeveloping a Practical Projec-tion-Based Parallel DelaunayAlgorithmGuy Blelloch, Gary L. Miller andDafna Talmor


Joseph O’Rourke, ChairSmith College

2:00 pmApproaching the Largest -Skeleton within a MinimumWeight TriangulationSiu-Wing Cheng and Yin-FengXu

2:25 pmThe Exact Minimum WeightTriangulationMatthew T. Dickerson and MarkH. Montague

2:50 pmFlipping Edges on Triangula-tionsF. Hurtado, M. Noy and J. Urru-tia

3:15 pmEnumeration of Regular Trian-gulationsTomonari Masada, Hiroshi Imaiand Keiko Imai


S7

β

22


Grand Ballroom

morning afternoon evening

23

P1

Monday, May 20 Tuesday, May 21 Wednesday, May 22 Thursday, May 23

PROGRAM AT A GLANCE

P2

morning afternoon evening morning afternoon evening morning afternoon evening morning afternoon evening

Friday, May 24

P3

T3A

T3B

T3C

T1A

T1B

T1C

T4A

T4B

T4C

T2

S2

S1 S3

S6S4

S5

S8

S7 S9

S2A

S2B

S3S5A

S5B

S6A

S6B

S7A

S7B

S8 M S9 S10

T

S2S1 S4

S3

RS1A

S1B

S6S3A

S3B

S4A

S4B

S5A

S5B

S2A

S2B

S7A

S7B

S8A

S8B

MS9A

S9B

S10A

S10B

S11A

S11B

S12

S2S1 S4S3

S2S1 S4

S3

S2S1 S4S3 M

M

S5

S2S1

S2S1 S4

S3

S6S5 S8

S7

S10S9R

R

T1

T3 T4

T1 S2S1 S4S3

S2S1

S3

S4

S6

D1 D2

S6S5 S8S7 S10S9

S1 S2

R

R

L

L

L

L

LL

L

M

R

S1 S4

M

ISC

AM

ETR

ICS

FC

RC

SC

GPO

DC

Care

ers

Com

ple

xit

yS

TO

CIC

SW

AC

GFLIC

PLD

IW

OPA

ICFP

IOPA

DS

SPD

TPA

DS

NIM

E E E TH

RT1B

T2B

T1A

T2A

LT2

T5

R

T2 R

R S5

R

morning afternoon evening

24

Science Museum

LunchL

Saturday, May 25 Sunday, May 26 Monday, May 27 Tuesday, May 28

T

S Session

Tutorial

MeetingM

D Panel Discussion

ReceptionR

PlenariesP

ISC

AM

ETR

ICS

FC

RC

SC

GPO

DC

Care

ers

Com

ple

xit

yS

TO

CIC

S

morning afternoon evening morning afternoon evening morning afternoon evening

WA

CG

FLIC

PLD

IW

OPA

ICFP

IOPA

DS

SPD

TPA

DS

NIM

S1A

S1B

S2S3A

S3B

S4S6A

S6B

S7A

S7B

S5S8A

S8B

S9

S10A

S10BS11A

S11B

S13S12

L

S6S5 S8S7

S7S6 S9S8

S6S5 S8S7

S3S1 S6S5 S8S7 S10S9

S2S1 S4

S3

S1

S4S3 S6

S5

S8S7 S9

S2S1

S3

S4 S6S5

S7

S8

S10S9 S12S11

S10S9 S12S11

S11S10 S12

S14S13 S15

S6S5 S7 S8 S10S9

M

L L

L

S2 S3

P4 P5E E

ExhibitsE

CRA Town HallTH

R

S13

S2

L

S4

Sessions

Poster Session(Short Communications)Saturday, May 25, 19964:05 pm – 5:45 pm

Experimental Results of a Ran-domized Clustering AlgorithmMary Inaba, Hiroshi Imai andNaoki Katoh

Animating Geometric Algo-rithms over the WebJames E. Baker, Isabel F. Cruz,Giuseppe Liotta and RobertoTamassia

Simple Traversal of a Subdivi-sion Without Extra StorageMark de Berg, Marc van Kreveld,René van Oostrum and MarkOvermars

The Graph of Triangulations ofa Convex PolygonF. Hurtado and M. Noy

Partial Surface Matching byUsing Directed FootprintsGill Barequet and Micha Sharir

On the Sectional Area of Con-vex PolytopesD. Avis, P. Bose, T. Shermer, J.Snoeyink, G. Toussaint and B.Zhu

Smallest Enclosing CylindersElmar Schomer, Jurgen Sellen,Marek Teichmann and Chee Yap

Curve Based Stereo MatchingUsing the Minimum HausdoffDistanceKlara Kedem and YanaYarmovski

Approximate GeometricMatching of 3d Bronchial TreeStructuresChandrasekhar Pisupati,Lawrence Wolff, Wayne Mitznerand Elias Zerhouni


Olivier Devillers, ChairINRIA, Sophia-Antipolis

9:15 amAlgorithms to Compute theConvolution and MinkowskiSum Outer-Face of Two SimplePolygonsG. D. Ramkumar

S8

S9

9:40 amA Polynomial-time Algorithmfor Computing a Shortest Pathof Bounded Curvature AmidstModerate ObstaclesJean-Daniel Boissonnat andSylvain Lazard

10:05 am-Optimal Motion for a Rod

Tetsuo Asano, David Kirkpatrickand Chee K. Yap

10:30 amOptimal Robot Localization inTreesKathleen Romanik and SvenSchuierer


Session 10Sunday, May 26, 199611:20 am - 12:35 pm

Marc van Kreveld, ChairUtrecht University

11:20 amFast Randomized Point Loca-tion Without Preprocessing inTwo-and Three-DimensionalDelaunay TriangulationsErnst P. Mücke, Isaac Saias andBinhai Zhu

11:45 amFixed-Dimensional Linear Pro-gramming Queries Made EasyTimothy M. Chan

12:10 pmPseudo-Triangulations: The-ory and ApplicationsMichel Pocchiola and Gert Vegter


Subhash Suri, ChairWashington University

2:00 pmImprovements on BottleneckMatching and Related Prob-lems Using GeometryAlon Efrat and Alon Itai

d1

S10

S11

2:25 pmApproximating MonotonePolygonal Curves Using theUniform MetricKasturi R. Varadarajan

2:50 pmConvex Drawings of Graphs inTwo and Three DimensionsMarek Chrobak, Michael T. Goo-drich and Roberto Tamassia

3:15 pmApproximate Shortest Pathson a Convex Polytope in 3-dKasturi R. Varadarajan



Imre Barany, ChairHungarian Academy

4:05 pmMonotonicity of RectilinearGeodesics in d-SpaceJoonsoo Choi and Chee-KengYap

4:30 pmDisk Packings and Planar Sep-aratorsDaniel A. Spielman and Shang-Hua Teng

4:55 pmRamsey-Type Results for Geo-metric GraphsGyula Karolyi, Janos Pach andGeza Toth

SCG/WACG Invited TalkMonday, May 27, 19968:00 am - 9:00 am

David DobkinPrinceton University

Computational Geometry -Where Did it Come From,What is it Good For?

S12

S13

Michael T. GoodrichJohns Hopkins University

Conference Chair

Leonidas J. GuibasStanford University

Program Chair

PROGRAM COMMITTEEPankaj K. AgarwalDuke University

Imre BaranyHungarian Academy

Marshall Bern(Xerox PARC

Olivier DevillersINRIA, Sophia-Antipolis

Marc van KreveldUtrecht University

Jean-Claude LatombeStanford University

Chris LevcopoulosLund University

Victor MilenkovicUniversity of Miami

Joseph O’RourkeSmith College

Nicholas PatrikalakisMIT

Gunter RoteTechnische Universitat Graz

Subhash SuriWashington University

Sue WhitesidesMcGill University

Committees

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

25

Registration for the First Workshop on Applied Computational Geometry includes continental breakfasts, cof-fee breaks, and workshop proceedings. Student registration fee includes all of the above. The workshop issponsored by the ACM Special Interest Groups for Graphics (SIGGRAPH) and Algorithms & ComputationTheory (SIGACT).


Sessions

SCG/WACG Invited TalkMonday, May 27, 19968:00 am - 9:00 am

David DobkinPrinceton University

Computational Geometry -Where Did it Come From,What is it Good For?

WACG Welcomeand Opening RemarksMonday, May 27, 19969:00 am – 9:20 am

Molecular ModelingMonday, May 27, 19969:20 am – 10:40 am

Ming Lin, ChairArmy Research Office & UNCChapel Hill

9:20 amSmooth Surfaces for Multi-Scale Shape RepresentationHerbert EdelsbrunnerUniversity of Illinois

10:00 amGeometric Manipulation ofFlexible LigandsD. Halperin, L. Kavraki, J.Latombe, R. Motwani, C. Sheltonand S. VenkatasubramanianStanford University

10:20 amApplication of the Ray-Repre-sentation to Problems of Pro-tein Structure and FunctionMichael G. PrisantDuke University


Solid Modeling and Geo-metric RobustnessMonday, May 27, 199611:00 am – 12:50 pm

Dinesh Manocha, ChairUniv. of N. Carolina, Chapel Hill

S1

S2

S3

S4

11:00 amHow Solid is Solid ModelingChristoph HoffmannPurdue University

11:40 amPANEL DISCUSSION onRobustness IssuesSteve Fortune, Panel ChairAT & T Bell LabsLeo GuibasStanford UniversityFranco PreparataBrown University

ManufacturingMonday, May 27, 19961:50 pm – 3:40 pm

Chee Yap, ChairNew York University

1:50 pmComputational Geometry inDesign and ManufacturingMichael J. WoznyDepartment of Commerce

2:30 pmApplications of Computa-tional Geometry in MechanicalEngineering Design and Manu-facturingMichael PrattNational Institute of Standards &Technology

3:00 pmColumn-Based Strip Packingusing Ordered and CompliantContainmentV. MilenkovicUniv. of MiamiK. DanielsHarvard University

3:20 pmComputing a flattest, under-cut--free parting line for a con-vex polyhedron, withapplication to mold designJ. Majhi, P. Gupta and R. Janar-danU. of Minnesota


S5

MACHINE LEARNING,VISION & COMPUTA-TIONAL ROBOTICSMonday, May 27, 19964:00 pm – 5:40 pm

Leo Guibas, ChairStanford University

4:00 pmGeometric Pattern Matchingand Computer VisionDan HuttenlocherCornell University

4:40 pmGeometric Problems inMachine LearningDavid Dobkin and DimitriosGunopulosPrinceton University

5:00 pmMatching convex polygons andpolyhedra, Allowing for Occlu-sionRonen BasriWeizmann InstituteDavid JacobsNEC

5:20 pmStably Placing PiecewiseSmooth ObjectsChao-Kuei Hung and Doug Ier-ardiUniversity of Southern CA

Geometric Applications ITuesday, May 28, 19969:00 am – 10:45 am

Dinesh Manocha, ChairUniv. of N. Carolina, Chapel Hill

9:00 amOn Some Applications of Com-putational Geometry in VirtualEnvironmentsJoseph MitchellSUNY Stony Brook

9:35 amGeometric Issues Arising fromN-Manifold Geometry in BRL-CADMichael MuussArmy Research Laboratory

10:05 amA beam-tracing algorithm forindoor radio propagationSteve FortuneAT & T Bell Labs

10:25 amExtracting Geometric Informa-tion from Architectural Draw-ingsBrian KernighanAT & T Bell LabsChris Van WykDrew


Geometric Software andVisualizationTuesday, May 28, 199611:00 am – 12:50 pm

Joe Mitchell, ChairSUNY Stony Brook

11:00 amUsing the visibility complexfor radiosity computationR. Orti, F. Durand, S. Riviere andC. PuechIMAG-INRIA

11:20 amThe CGAL kernel: A basis forgeometric computationA. FabriINRIAG. GierzemanUtrecht Univ.L. Kettner and S. SchonherrFreie Univ.S. SchirraMax-Planck Institut fur Informatik

11:40 amPANEL DISCUSSION on Geo-metric Software & Visualiza-tionMark Overmars, Panel ChairUtrecht UniversityDavid DobkinPrinceton UniversityD. T. LeeNorthwestern UniversityKurt MehlhornMax-Planck-Institut fuer Informa-tik

S6

S7

S8

26



Sessions

Geometric Applications IITuesday, May 28, 19961:50 pm – 3:50 pm

David Dobkin, ChairPrinceton

1:50 pmGrid Generation for Computa-tional Field SimulationJoe ThompsonMississippi State University

2:30 pmComputational Geometryissues in VLSI Design Verifica-tionV. T. RajanIBM T.J. Watson Research Center

3:00 pmNear Linear Time for Ray Trac-ing

S9Tony WooUniversity of Washington

3:30 pmTriangle: Engineering a 2DQuality Mesh Generator andDelaunay TriangulatorJonathan Richard ShewchukCarnegie-Mellon U.


Geometric EngineeringTuesday, May 28, 19964:00 pm – 5:40 pm

Ming Lin, ChairU.S. Army Research Office &UNC-Chapel Hill

S10Ming C. LinU.S. Army Research Office & UNC-Chapel

General Chair

Dinesh ManochaUniversity of North Carolina, ChapelHill

Program Chair

Ming C. LinU.S. Army Research Office & UNC-Chapel Hill

Finance Chair

ADVISORY COMMITTEEHerbert EdelsbrunnerUniversity of Illinois, Urbana

Michael GoodrichJohns Hopkins University

Leo GuibasStanford University

Kurt MehlhornMax-Planck-Institut fuer Informatik,Germany

Joseph MitchellSUNY, Stony Brook

Emo WelzlFachbereich Mathematik, Freie Univer-sitat, Germany

Chee YapNew York University

PROGRAM COMMITTEEDavid DobkinPrinceton University

Leo GuibasStanford University

Joe MitchellSUNY, Stony Brook

Chee YapNew York University

Committees

27

Registration for the 4th Workshop on Parallel Algorithms includes two lunches, continental breakfasts, anexcursion, and coffee breaks. Student registration fee includes all of the above except the excursion. The con-ference is sponsored by the University of Maryland Institute for Advanced Computer Studies (UMIACS) andthe ACM Special Interest Group on Algorithms and Computation Theory (SIGACT).


Sessions


Grand Ballroom


9:15 amRecent Developments in Paral-lel Asychronous Computing(invited presentation)Michael O. RabinHarvard University andHebrew University

10:15 amSelf-Stabilizing Synchroniza-tion AlgorithmsShlomi DolevBen-Gurion University of theNegev


S1


11:00 amEstimation Algorithms for Effi-cient Parallel Query Process-ing(invited presentation)Phillip B. GibbonsAT&T Bell Laboratories

12:00 pmFine-Grain Parallelism: PRAMAlgorithms and Instruction-Level-ParallelismRimon Orni and Uzi VishkinUniversity of Maryland, Col-lege Park and Tel Aviv Univer-sity


S2

L


2:15 pmParallel Multisearch: RecentResults and Open Problems(invited presentation)Mikhail J. AtallahPurdue University



3:45 pmModels, Algorithms and Archi-tectures: Immediate Familyor Distant Cousins?(invited presentation)Satish RaoNEC Research Institute

S3

S4


9:15 amBuilding Parallel Machines:How Useful Is Theory?(invited presentation)Marc SnirIBM T. J. Watson Research Cen-ter

10:15 amProgramming and AnalyzingParallel Algorithms in the CilkMultithreaded LanguageRobert Blumofe, Matteo Frigo,Charles E. Leiserson and KeithRandallThe University of Texas at Aus-tin and MIT


S5

4:00 pmIssues in Geometric Toleranc-ingChee YapNew York University

4:40 pmPANEL DISCUSSIONOn the Future Trend of Geo-metric Computing

Committees


Sessions


11:00 amLogP Network Characteriza-tion by Microbenchmarks(invited presentation)David CullerUniversity of California at Ber-keley

12:00 pmCommunication-EfficientBulk-Synchronous ParallelComputingMichael T. GoodrichJohns Hopkins University



S6

L

S7

2:15 pmAlgorithm Design for ParallelScientific Computation(invited presentation)Gary MillerCarnegie Mellon University



3:45 pmThe Random-Adversary Tech-niquePhilip D. MacKenzieSandia National Laboratories

4:15 pmHow Can We DemonstrateIncreasing Parallel Complexi-ties?Chuzo Iwamoto and KazuoIwamaKyushu Institute of Design,Japan

S8

Uzi VishkinUniversity of Maryland and TelAviv University

General Chair

Joseph JaJaUniversity of Maryland

Program Chair

Johanna WeinsteinUniversity of Maryland

Publicity and Publications Chair

Johanna WeinsteinUniversity of Maryland

Finance Chair

ADVISORY COMMITTEERichard KarpUniversity of California at Berke-ley

Ken KennedyRice University

Kurt MehlhornMax Planck Institute

Michael RabinHarvard University and HebrewUniversity

Vijay RamachandranUniversity of Texas at Austin

John ReifDuke University

Burton SmithTera Computer

Leslie ValiantHarvard University

STEERING COMMITTEERichard ColeNew York University

Zvi KedemNew York University

Alan SiegelNew York University

Uzi VishkinUniversity of Maryland and TelAviv University

Committees

28

Registration for the ACM SIGPLAN ‘96 Conference on Programming Language Design and Implementationincludes three continental breakfasts, two lunches, a joint reception with ICFP, an evening excursion, coffeebreaks, and conference proceedings. Student registration includes all of the above except for the eveningexcursion. The conference is sponsored by the ACM Special Interest Group on Programming Languages (SIG-PLAN).Registration for the full day of ACM SIGPLAN ‘96 tutorials includes a continental breakfast, lunch, coffeebreaks and tutorial notes. Registration for the morning tutorial includes a continental breakfast, a coffeebreak, and tutorial notes. Registration for afternoon tutorials includes a coffee break and tutorial notes.

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

Tutorials


Grand Ballroom

Richard J. LeBlancGeorgia Institute of Technology

Tuesday, May 21, 19969:00 am – 12:00 pm

Object-Oriented Analysis andDesignThis tutorial will introduce theprinciples of object-oriented soft-ware development and providean overview of object-orientedanalysis and design techniques.The basic concepts of object-ori-ented software, such as object,class, message and inheritance,will be defined and discussed.Object-oriented analysis will bepresented as a way of modelinguser requirements and the high-

T1level architecture of correspond-ing software solutions. Object-oriented design concepts will bedescribed as a systematic meansof implementing the results ofobject-oriented analysis. Somepopular analysis and designtechniques will be compared.The presentation of these tech-niques will not depend on thefeatures of any particular pro-gramming language.

This tutorial is intended for peo-ple who are familiar with tradi-tional imperative styleprogramming and who want tolearn about object technology. Itwill provide valuable language-independent skills for those whowish to begin programming inobject-oriented languages.

Richard J. LeBlanc is a Professorand the Associate Dean of theCollege of Computing of theGeorgia Institute of Technology.His current teaching andresearch interests include objecttechnology, in which he fre-quently teaches continuing edu-cation courses.

10:30 am Coffee BreakFor Tutorial T1

12:00 pm – 1:30 pmLuncheonFor full day tutorial registrants

Owen AstrachanDuke University

T2

Tuesday, May 21, 19961:30 pm – 4:30 pm

Teaching C++ in Introduc-tory CoursesC++ is a large and complex lan-guage. It’s still a very reasonablechoice for the first year of Com-puter Science courses providedthat careful choices are madeabout what parts of the languagewill be covered and what classesare provided for student use.We’ll survey different approachesto using C++, discuss how todevelop and manage C++ as astudent’s first language, and dis-cuss practical methods forinstructors and students to getup-to-speed with C++ andobject-oriented programming.



Tutorials and Sessions

This tutorial is intended for any-one interested in practical infor-mation on how best to teach C++in introductory Computer Sci-ence courses. The primary focuswill be on the first course (CS1)with attention to the second,data structures course (CS2).Prior experience with C++ is notmandatory.

Owen Astrachan is an AssistantProfessor of the Practice of Com-puter Science, and Director ofUndergraduate Studies at DukeUniversity. He has been involvedin Computer Science educationfor many years, and has givennumerous invited talks at edu-cation conferences and work-shops.

Luca CardelliDigital Equipment Corporation

Tuesday, May 21, 19961:30 pm– 2:50 pm

Object-based vs. Class-basedLanguagesClass-based object-oriented pro-gramming languages take objectgenerators as central, whileobject-based languages empha-size the objects themselves.Class-based languages havebecome relatively well-under-stood, widely debated, andhugely popular. In contrast, thearea of object-based languages isstill underdeveloped. Nonethe-less, object-based languages areintrinsically simpler and moregeneral than traditional class-based languages, and holdpromise for the future of object-oriented programming. I discussthese two categories of object-oriented languages, giving themequal weight, and concentratingon the variations and potentialsof object-based languages.

This tutorial is intended for peo-ple interested in understandingthe principal concepts behindobject-oriented languages. Peo-ple interested in typed object-ori-ented programming, but not justC++, and in untyped object-ori-ented programming, but not justSmalltalk. A general knowledgeof at least one class-based lan-guage is assumed.

Luca Cardelli is a senior com-puter scientist at Digital Equip-ment Corporation, SystemsResearch Center in Palo Alto. Hismain interests are in type theoryand operational semantics,mostly for applications to lan-

T3

guage design, semantics, andimplementation.

2:50 pm Coffee BreakFor Tutorials T2, T3 and T4.

Guy L. Steele Jr.Sun Microsystems Laboratories

Tuesday, May 21, 19963:10 pm – 4:30 pm

The Java Programming Lan-guageJava is a small, simple, object-oriented programming languagethat is attracting a lot of interestfor use on the World Wide Web.Just as HTML allows Web usersto access text with embeddedpictures, sound clips, and mov-ies with a simple point-and-clickinterface, Java allows a Web userto access programs: a mouseclick in a Java-capable browsercan retrieve and execute a pro-gram on a local machine. Thissimple concept raises importantlanguage design issues, includ-ing security, privacy, andauthentication. We discuss thedesign of the Java language withan emphasis on how the designchoices make Java suitable forits intended applications.

This tutorial is intended for thoseinterested in using the Java pro-gramming language and thoseinterested in the problems ofprogramming language design.

Guy L. Steele Jr., is a Distin-guished Engineer at Sun Micro-systems Laboratories. Hishonors include ACM Grace Mur-ray Hopper Award (1988), AAAIFellow (1990), and ACM Fellow(1994).

Instruction SchedulingWednesday, May 22, 19969:30 am – 10:30 am

Monica Lam, ChairStanford University

9:30 amSoftware Pipelining Show-down: Optimal vs. HeuristicMethods in a Production Com-pilerJohn Ruttenberg and W. Licht-ensteinSilicon GraphicsG.R. Gao and A. StouchininMcGill University

T4

S1

10:00 amA Reduced MultipipelineMachine Description that Pre-serves Scheduling ConstraintsAlexandre E. Eichenberger andEdward S. DavidsonUniversity of Michigan


Testing and VerificationWednesday, May 22, 199611:00 am – 12:30 pm

Dirk Grunwald, ChairUniversity of Colorado

11:00 amTeapot: Language Support forWriting Memory CoherenceProtocolsSatish Chandra, Brad Richardsand James LarusUniversity of Wisconsin, Madison

11:30 amTarget-Sensitive Constructionof Diagnostic Programs forProcedure Calling SequenceGeneratorsMark W. Bailey and Jack W.DavidsonUniversity of Virginia

12:00 pmReplay For Concurrent Non-Deterministic Shared MemoryApplicationsMark Russinovich, BryceCogswell and Zary SegallUniversity of Oregon


Parallelizing CompilersWednesday, May 22, 19962:00 pm – 3:30 pm

Kathryn S. McKinley, ChairUniversity of Massachusetts

2:00 pmCommutativity Analysis: ANew Analysis Framework forParallelizing CompilersMartin C. Rinard and Pedro C.DinizUniversity of California, SantaBarbara

2:30 pmGlobal Communication Analy-sis and OptimizationSoumen ChakrabartiUniversity of California, BerkeleyManish Gupta and Jong-DeokChoiIBM T.J. Watson Research Center

3:00 pmGUM: A Portable ParallelImplementation of HaskellP.W. Trinder, K. Hammond andS.L. Peyton JonesGlasgow UniversityJ.S. Mattson Jr.Hewlett PackardA.S. PartridgeUniversity of Tasmania


Program AnalysisWednesday, May 22, 19964:00 pm – 5:30 pm

William Landi, ChairSiemens Corporate Research

4:00 pmData Flow Frequency AnalysisG. RamalingamIBM T.J. Watson Research Center

4:30 pmA New Framework for Exhaus-tive and Incremental DataFlow Analysis Using DJ GraphsVugranam Sreedhar and GuangGaoMcGill UniversityYong-fong LeeIntel Corporation

5:00 pmGeneralized Dominance andControl DependenceGianfranco BilardiUniversita di PadovaKeshav PingaliCornell University

Report by the ProgramChairWednesday, May 22, 19965:30 pm – 6:00 pm

Michael Burke, Program ChairIBM Thomas J. Watson ResearchCenter

S2

L

S3

S4

M

29

Sessions

New DirectionsThursday, May 23, 19969:30 am – 10:30 am

Michael Burke, ChairIBM Thomas J. Watson ResearchCenter

9:30 amPractical Program AnalysisUsing General Purpose LogicProgramming SystemsSteven Dawson, C.R.Ramakrishnan and David S.WarrenSUNY, Stony Brook

10:00 amEfficient and Language-Inde-pendent Mobile ProgramsAli-Reza Adl-Tabatabai, GeoffLangdale, Steven Lucco andRobert WahbeCarnegie Mellon University


Run-time Code Genera-tionThursday, May 23, 199611:00 am – 12:30 pm

Bernhard Steffen, ChairUniversity of Passau

11:00 amOptimizing ML with Run-Time Code GenerationPeter Lee and Mark LeoneCarnegie Mellon University

11:30 amFast, Effective Dynamic Com-pilationJ. Auslander, M. Philipose, C.Chambers, S. Eggers and B. Ber-shadUniversity of Washington

12:00 pmVCODE: a Retargetable, Exten-sible, Very Fast Dynamic CodeGeneration SystemDawson R. EnglerM.I.T. Laboratory for ComputerScience


S5

S6

L

MLThursday, May 23, 19962:00 pm – 3:30 pm

Fritz Henglein, ChairDIKU, University of Copenhagen

2:00 pmSimple Objects for StandardMLJohn Reppy and Jon RieckeAT&T Bell Laboratories

2:30 pmTIL: A Type-Directed Optimiz-ing Compiler for MLD. Tarditi, G. Morrisett, P.Cheng, C. Stone, R. Harper andP. LeeCarnegie Mellon University

3:00 pmFlow-directed InliningSuresh Jagannathan andAndrew WrightNEC Research Institute


Currying/Partial Evalua-tionThursday, May 23, 19964:00 pm – 5:30 pm

Room:

Tom Reps, ChairUniversity of Wisconsin, Madison

4:00 pmRealistic Compilation by Par-tial EvaluationM. Sperber and P. ThiemannUniversitaet Tuebingen

4:30 pmData SpecializationT. Knoblock and E. RufMicrosoft Research

5:00 pmRelocating Machine Instruc-tions by CurryingNorman RamseyPurdue University

5:30 pm - 6:00 pmOpen SIGPLAN Meeting

S7

S8

Joint Reception withICFPThursday, May 23, 19966:30 pm – 8:30 pm

Friday, May 24, 19969:30 am – 11:00 am

Robert Halstead, ChairDEC Cambridge Research Lab

9:30 amStatic Debugging: Browsingthe Web of Program InvariantsCormac Flanagan, K. Shriram,Stephanie Weirich and MatthiasFelleisenRice University

10:00 amSource-Level Debugging ofScalar Optimized CodeAli-Reza Adl-Tabatabai and Tho-mas GrossCarnegie Mellon University

10:30 amStatic Detection of DynamicMemory ErrorsDavid EvansM.I.T. Laboratory for ComputerScience


Implementation Tech-niquesFriday, May 24, 199611:30 am – 1:00 pm

Robert Cartwright, ChairRice University

11:30 amSimple Garbage-Collector-SafetyHans-J. BoehmXerox PARC

12:00 pmRepresenting Control in thePresence of One-Shot Continu-ationsCarl Bruggeman, Oscar Waddelland R. Kent DybvigIndiana University

12:30 pmPrinting Floating-Point Num-bers Quickly and AccuratelyRobert G. Burger, R. Kent DybvigIndiana University

R

S9

S10


30

Charles N. FischerUniversity of Wisconsin, Madison

General Chair

Michael BurkeIBM Thomas J. Watson ResearchCenter

Program Chair

Susan HorwitzUniversity of Wisconsin, Madison

Tutorials Chair

Linda TorczonRice University

Finance Chair

ADVISORY COMMITTEEBarbara RyderRutgers University

Mary Lou SoffaUniversity of Pittsburgh

Marc ShapiroUniversity of Wisconsin, Madison

PROGRAM COMMITTEEPreston BriggsTera Computer

Michael BurkeIBM Thomas J. Watson ResearchCenter

Robert CartwrightRice University

Dirk GrunwaldUniversity of Colorado

Robert HalsteadDEC Cambridge Research Lab

Fritz HengleinDIKU, University of Copenhagen

Wen-mei HwuUniversity of Illinois

Monica LamStanford University

William LandiSiemens Corporate Research

Mark LintonSilicon Graphics

Kathryn S. McKinleyUniversity of Massachusetts

Tom RepsUniversity of Wisconsin, Madison

Bernhard SteffenUniversity of Passau

Committees

Registration for the workshop includes morning coffee break. The first 50 registrants will receive a free copy ofThe Little Schemer, 4th edition, courtesy of MIT Press. The workshop is sponsored by ACM SIGPLAN, NECResearch, and MIT Press, and is held in conjunction with the International Conference on Functional Pro-gramming.

Workshop of Functional Languages in Introductory Computing (FLIC)

Sessions

WelcomeOver the past ten years, Schemehas rapidly become the program-ming language of choice formany introductory computingcourses. Other functional lan-guages, especially SML andHaskell, have recently beenadopted at a number of universi-ties. Approximately 50 depart-ments in the US and 95 world-wide use functional languages astheir introductory programminglanguages. Some 20 secondaryschools in the US have coursesbased on the functional philoso-phy. All preparatory schools inFrance use CAML.

This workshop will presentspeakers who discuss their expe-rience with using Scheme, SML,and Haskell in the introductorycurriculum. They will report onsuccesses, recent changes, andthe relationship of their coursesto other parts of the curriculum.


Matthias Felleisen, ChairRice University

9:15 amWelcomeMatthias FelleisenRice University

9:20 amProgramming as a Medium forTeachingGerald J. SussmanMITDaniel P. FriedmanIndiana University

S110:05 amTeaching Computation The-ory Of and With SchemeAlbert MeyerMIT

10:35 amScheme in Pre-College Class-roomsIan FergusonSchemer’s Inc.


Session 2Friday, May 24, 199611:20 am – 12:50 pm

Christopher Haynes, ChairIndiana University

11:20 amProgramming Languages andTechniquesCarl GunterUniversity of Pennsylvania

11:50 amCAML at ENSGuy Cousineau

12:20 pmAn FP-based Series of Under-graduate Lectures using GoferS. Doaitse SwierstraUniversity of Utrecht

S2

This Workshop is part of

Registration for the International Conference on Functional Programming includes a reception (held jointlywith PLDI), an evening excursion, one luncheon, continental breakfasts, coffee breaks, and conference pro-ceedings. Student registration includes all of the above except the evening excursion. The conference is spon-sored by ACM SIGPLAN in cooperation with IFIP Working Group 2.8.

ACM SIGPLAN International Conference on Functional Programming (ICFP)

Sessions

Joint Reception withPLDIThursday, May 23, 19966:30 pm – 8:30 pm


Olivier Danvy, ChairAarhus University

2:00 pmLet-floating: Moving bindingsto give faster programs

R

S1

Simon Peyton Jones, Will Partainand André SantosUniversity of Glasgow

2:30 pmA reflection on call-by-valueAmr SabryChalmers UniversityPhilip WadlerUniversity of Glasgow

3:00 pmFunctional back-ends withinthe lambda-sigma-calculusThèrése HardinLITP and INRIA RocquencourtLuc MarangetINRIA RocquencourtBruno PaganoLITP and INRIA Rocquencourt



Olin Shivers, ChairMIT

4:00 pmLag, drag, void and use --space-efficient compilationColin Runciman and NiklasRöjemoUniversity of York

4:30 pmStatic and dynamic partition-ing of pointers as links andthreadsDavid S. Wise and Joshua Wal-genbachIndiana University

5:00 pmStorage use analysis and itsapplicationsManuel SerranoUniversity of Montreal & INRIARocquencourtMarc FeeleyUniversity of Montreal


Paul Hudak, ChairYale University

9:30 amThe role of lazy evaluation inamortized data structuresChris OkasakiCarnegie Mellon University

S2

S3

ICFP, with an additionalfee of $50.


Grand Ballroom

31


Sessions

10:00 amDeriving structural hylomor-phisms from recursive defini-tionsZhenjiang Hu, Hideya Iwasakiand Masato TakeichiUniversity of Tokyo



John Launchbury, ChairOregon Graduate Institute

11:00 amAnalysis and caching of depen-denciesMartín AbadiDigital Systems Research CenterButler LampsonMicrosoftJean-Jacques LévyINRIA Rocquencourt

11:30 amOptimality and inefficiency:What isn’t a cost model of thelambda calculus?Julia L. LawallIRISAHarry G. MairsonBrandeis University

12:00 pmInductive, coinductive, andpointed typesBrian T. HowardKansas State University



Didier Rémy, ChairINRIA

2:00 pmA new look to pattern match-ing in abstract data typesPedro Palao Gostanza, RicardoPeña Marí and Manuel NúñezGarciaUniversidad Complutense deMadrid

S4

L

S5

2:30 pmSimplifying subtyping con-straintsFrançois PottierENS Paris & INRIA Rocquencourt

3:00 pmComplexity of kernel Fun sub-type checkingGiorgio GhelliUniversita’ di Pisa



Matthias Felleisen, ChairRice University

4:00 pmThe semantics of Scheme withfutureLuc MoreauUniversity of Southampton

4:30 pmFirst-class synchronizationbarriersFranklyn TurbakWellesley College

5:00 pmpHluid: The design of a parallelfunctional language imple-mentationCormac FlanaganRice UniversityRishiyur S. NikhilDigital Equipment Corporation

Sessions 7Sunday, May 26, 19969:30 am – 10:30 am

Peter Lee, ChairCarnegie Mellon University

9:30 amCogen in six linesPeter ThiemannUniversität Tübingen

10:00 amA probabilistic approach to theproblem of automatic selec-tion of data representationsTyng-Ruey Chuang and Wen L.HwangAcademia Sinica


S6

S7


John Reppy, ChairAT&T Research

11:00 amA theory of weak bisimulationfor core CMLWilliam Ferreira, Matthew Hen-nessy and Alan JeffreySussex University

11:30 amA provable time and space effi-cient implementation of NESLGuy E. Blelloch and JohnGreinerCarnegie Mellon University

12:00 pmSynchronous Kahn networksPaul Caspi and Marc PouzetVERIMAG


Andrew Wright, ChairNEC Research

2:00 pmEnriching the lambda calculuswith contexts: Toward a the-ory of incremental programconstructionShinn-Der Lee and Daniel P.FriedmanIndiana University

2:30 pmSharing code through first-class environmentsChristian QueinnecEcole Polytechnique & INRIA Roc-quencourtDavid DeRoureUniversity of Southampton

3:00 pmMixin modulesDominic Duggan and Constanti-nos SourelisUniversity of Waterloo

S8

S9

Robert HarperCarnegie Mellon University

General Chair

R. Kent DybvigIndiana University

Program Chair

Robert KesslerUniversity of Utah

Finance Chair

ADVISORY COMMITTEEArvindMIT

Robert KesslerUtah

Robert HarperCarnegie Mellon

Simon Peyton-JonesGlasgow

Guy L. Steele, Jr.Sun Microsystems

John WilliamsIBM

PROGRAM COMMITTEELuca CardelliDEC

Olivier DanvyAarhus University

Matthias FelleisenRice University

Richard GabrielParcPlace

Paul HudakYale University

John LaunchburyOregon Graduate Institute

Peter LeeCarnegie Mellon University

Atsushi OhoriKyoto University

Didier RemyINRIA

John ReppyAT&T

Olin ShiversMIT

Andrew WrightNEC

Committees

ACM SIGPLAN International Conference on Functional Programming (ICFP)

32

Registration for the 10th Workshop on Parallel and Distributed Simulation (PADS’96) includes a reception, anevening excursion, the PADS business meeting, continental breakfasts, coffee breaks, and conference pro-ceedings. Student registration fee includes all of the above except the reception and evening excursion. Theconference is sponsored by the ACM Special Interest Group on Simulation (SIGSIM), the IEEE ComputerSociety Technical Committee on Simulation, and the Society for Computer Simulation.



Richard FujimotoCollege of ComputingGeorgia Institute of Technology

Tuesday, May 21, 19969:00 am – 12:00 pm

Parallel Discrete Event Sim-ulationDiscrete event simulation iswidely used in the design andevaluation of complex systemsand processes, e.g., large com-puter systems, communicationnetworks, air traffic systems,and battlefield strategies, tomention a few. The goal of thistutorial is to introduce research-ers and practitioners to the cur-rent state of the art concerningthe execution of discrete eventsimulation programs on parallelcomputers. The tutorial will firstreview fundamental concepts indiscrete event simulation. Clas-sical synchronization algorithmssuch as the Chandy/Misra/Bry-ant “null message” algorithmand Jefferson’s “Time Warp” pro-tocol will be discussed, as well asmore recent algorithms andtechniques. Work concerningother important issues related toparallel execution (e.g., memorymanagement and load balanc-ing) will also be described, aswell as experiences in utilizingthis technology. Algorithmsexploiting temporal parallelismto simulate systems such ascache memories and queueingnetworks will be discussed, aswell as current trends in thefield.

Researchers interested in thehigh performance parallel dis-crete event simulation field, andpractioners with large scale sim-ulation problems that could ben-efit from concurrent execution.No prior knowledge of discreteevent simulation is assumed.

Presenter to be determinedOrganized by Richard Fujimoto

Tuesday, May 21, 19961:00 pm – 4:00 pm

Distributed Interactive Sim-ulation and the High LevelArchitecture

T1

T2

Distributed Interactive Simula-tion (DIS) is an infrastructure forbuilding large-scale virtualworlds from a set of independentsimulator nodes. DIS isintended to support a mixture ofsimulation types: real-time,human-in-the-loop “virtual” sim-ulations; real platforms includ-ing “live” systems, sensors, andtactical links; and event drivenwargames, known as “construc-tive” simulations. While DIS isbeing developed by the Depart-ment of Defense to supporttraining, DIS goes far beyondmilitary applications. The DIStechnology is applicable to trans-portation, medicine, education,emergency management, andentertainment, to name just afew.

The next generation of DIS isknown as the High Level Archi-tecture (HLA). The HLA is aframework into which specificsimulation architectures can bedefined. Like DIS, it is based ona composable approach to con-struct federations of autono-mous simulations. HLAestablishes the rules that mustbe followed to achieve properinteractions of simulations dur-ing a federation execution. Itincludes means for specifyingobject models to achieve interop-erability among simulations, aset of interface definitions and aRun Time Infrastructure (RTI)for managing the execution ofthe federation.

This tutorial will present an over-view of DIS and the HLA, anddiscuss differences betweenwork in these fields and the highperformance parallel discreteevent simulation community.Fundamental design principalsand concepts in DIS such asautonomy of simulation nodesand dead reckoning will bedescribed. The central compo-nents of the HLA will bedescribed, with particularemphasis on object model tem-plates and services provided bythe RTI.

Researchers and practitionersinterested in on-going work toenable interoperability amongseparately developed simulationsin geographically distributedcomputing environments.

Researchers in the parallel dis-crete event simulation commu-nity with no prior knowledge ofDIS or the HLA are particularlyencouraged to attend.


Welcome and KeynoteAddressWednesday, May 22, 19969:20 am – 10:50 am

Mary L. Bailey, ChairUniversity of Arizona

9:30 amPADS Keynote AddressTen Years of PADS:Where We’ve Been, WhereWe’re GoingRichard M. FujimotoGeorgia Institute of Technology


Techniques I: Load Bal-ancing in Parallel Simula-tionWednesday, May 22, 199611:10 am – 12:40 pm

Stephen J. Turner, ChairUniversity of Exeter, UK

11:10 amExperiments in AutomatedLoad BalancingLinda F. WilsonNASADavid M. NicolCollege of William and Mary

11:40 amBackground Execution of TimeWarp ProgramsChristopher D. Carothers andRichard M. FujimotoGeorgia Institute of Technology

12:10 pmThe Dynamic Load Balancingof CTW for Logic Simulation

Herve Avril and Carl TropperMcGill University, CA

Applications I: ATM andNetwork SimulationWednesday, May 22, 19962:00 pm – 3:30 pm

Samir R. Das, ChairUniversity of Texas at San Anto-nio

2:00 pmConservative Parallel Simula-tion of ATM NetworksJohn G. Cleary and Jya-JangTsaiUniversity of Waikato, NZ

2:30 pmMassively Parallel Simulationof Asynchronous TransferMode (ATM) SystemsKrishnan KumaranRutgers UniversityBoris LubachevskyAT&T Bell Labs

3:00 pmParallel Simulation of a High-Speed Wormhole Routing Net-workRajive Bagrodia, Mario Gerla,Bruce Kwan, Jay Martin, Pras-asth Palnati and Simon WaltonUniversity of California at LosAngeles


PADS, DIS, and the DoDHigh Level Architecture:What is PADS’ Role?Wednesday, May 22, 19963:50 pm – 5:20 pm

Richard M. Fujimoto, ChairGeorgia Institute of Technology

3:50 pmTime Management in the DoDHigh Level ArchitectureRichard M. FujimotoGeorgia Institute of TechnologyRichard WeatherlyMITRE Corporation

R

S1

S2

S3

S4


Grand Ballroom

33

12:10 pmImproving Conservative VHDLSimulation PerformanceJoel F. Hurford and Thomas C.HartrumAir Force Institute of Technology

12:30 pmOn Extending More Parallelismto Serial SimulatorsDavid NicolCollege of William and MaryPhilip HeidelbergerIBM T. J. Watson Research Center

Mary L. BaileyUniversity of Arizona

General Chair

Wayne M. Loucks and Bruno R.PreissUniversity of Waterloo, CA

Program Chair

STEERING COMMITTEEMary L. BaileyUniversity of ArizonaAdel S. ElmaghrabyUniversity of LouisvilleRichard M. FujimotoGeorgia Institute of TechnologyC. Michael OverstreetOld Dominion UniversitySteve J. TurnerUniversity of Exeter, UKBrian W. UngerUniversity of Calgary, CA

PROGRAM COMMITTEED. K. ArvindEdinburgh University, UKR. AyaniRoyal Institute of Technology, SER. BagrodiaUniversity of California at Los AngelesR. D. ChamberlainWashington UniversityJ. G. ClearyUniversity of Waikato, NZS. R. DasUniversity of Texas at San AntonioR. M. FujimotoGeorgia Institute of TechnologyA. G. GreenbergAT&T Bell LabsP. HeidelbergerIBM T. J. Watson Research CenterD. NicolCollege of William and MaryV. RegoPurdue UniversityJ. S. SteinmanJet Propulsion Laboratory and Califor-nia Institute of TechnologyS. J. TurnerUniversity of Exeter, UKB. W. UngerUniversity of Calgary, CAP. A. WilseyUniversity of Cincinnati

Sessions

4:20 pmPanel DiscussionRichard M. Fujimoto, ModeratorGeorgia Institute of Technology

Techniques II: State-Sav-ing and Synchronizationin Optimistic SimulationThursday, May 23, 19969:20 am – 10:50 am

Rajive Bagrodia, ChairUniversity of California at LosAngeles

9:20 amTransparent Incremental StateSaving in Time Warp ParallelDiscrete Event SimulationRobert Ronngren, Michael Liljen-stam and Rassul AyaniRoyal Institute of Technology, SEJohan MontagnatEcole National Superieure deCachan, FR

9:50 amAutomatic Incremental StateSavingDarin WestScience Applications InternationalCorporationKiran PanesarGeorgia Institute of Technology

10:20 amReducing SynchronizationOverhead in Parallel Simula-tionUlana Legedza and William E.WeihlMassachusetts Institute of Tech-nology


Techniques III: Granular-ity and Partitioning inParallel SimulationThursday, May 23, 199611:10 am – 12:40 pm

Wayne M. Loucks, ChairUniversity of Waterloo, CA

11:10 amConcurrency Preserving Parti-tioning (CPP) for Parallel LogicSimulationHong K. Kim and Jack JeanWright State University

S5

S6

11:40 amHierarchical Strategy ofModel Partitioning for VLSI-Design Using an ImprovedMixture of Experts ApproachK. Hering, R. Haupt, and Th.VillmannUniversitaet Leipzig, DE

12:10 pmThe APOSTLE Simulation Lan-guage: Performance Data andGranularity ControlPaul Wonnacott and DavidBruceDefence Research Agency, UK

Applications II: Logicand Circuit SimulationThursday, May 23, 19962:00 pm – 3:30 pm

Rassul Ayani, ChairRoyal Institute of Technology, SE

2:00 pmConservative Circuit Simula-tion on Shared-Memory Multi-processorsJoerg Keller, Thomas Rauber,and Bernd RederlechnerUniversitaet des Saarlandes, DE

2:30 pmActor Based Parallel VHDLSimulation Using Time WarpVenkatram Krishnaswamy andPrithviraj BanerjeeUniversity of Illinois

3:00 pmOptimistic Simulation of Par-allel Architectures Using Pro-gram ExecutablesSashikanth Chandrasekaranand Mark D. HillUniversity of Wisconsin


Work In ProgressThursday, May 23, 19963:50 pm – 5:20 pm

Phil A. Wilsey, ChairUniversity of Cincinnati

PADS Business MeetingThursday, May 23, 19965:20 pm – 6:20 pm

S7

S8

M

Potpourri: Languages,Models, and AlgorithmsFriday, May 24, 19969:20 am – 10:50 am

Bruno R. Preiss, ChairUniversity of Waterloo, CA

9:20 amDesign of High Level Model-ling/High Performance Simu-lation EnvironmentsBernard P. Zeigler and DoohwanKimUniversity of Arizona

9:50 amQueueing Models and Stabil-ity of Message Flows in Dis-tributed Simulators of OpenQueueing NetworksManish Gupta, Anurag Kumarand Rajeev ShoreyIndian Institute of Science (Ban-galore), IN

10:30 amDiscrete-Event Simulation andthe Event Horizon, Part 2:Event List ManagementJeff SteinmanJet Propulsion Laboratory


Short PapersFriday, May 24, 199611:10 am – 12:50 pm

John G. Cleary, ChairUniversity of Waikato, NZ

11:10 amA Performance EvaluationMethodology for Parallel Simu-lation ProtocolsVikas Jha and Rajive BagrodiaUniversity of California at LosAngeles

11:30 pmEstimating the Cost of Throt-tled Execution in Time WarpSamir R. DasUniversity of Texas at San Anto-nio

11:50 pmParallel Simulation of BilliardBalls using Shared VariablesPeter McKenzie and Carl TropperMcGill University, CA

S9

S10

Committees


34

Registration for the SIGMETRICS Symposium on Parallel and Distributed Tools includes an evening recep-tion, two lunches, continental breakfasts, coffee breaks, and conference proceedings. Student registration feeincludes all of the above. The conference is sponsored by the ACM Special Interest Group on Measurementand Evaluation.

ACM SIGMETRICS Symposium on Parallel and Distributed Tools (SPDT)


Performance TuningWednesday, May 22, 19969:20 am – 10:40 am

Barton Miller, ChairUniversity of Wisconsin

Performance Tuning with Car-nivalWagner Meira Jr., Thomas J.LeBlanc and Alexander PoulosUniversity of Rochester

An On-line Computation ofCritical Path ProfilingJeffrey K. HollingsworthUniversity of Maryland, CollegePark


Debugger TechniquesWednesday, May 22, 199610:55 am – 12:40 pm

Al Malony, ChairUniversity of Oregon

Event and State-Based Debug-ging in TAU: A PrototypeSameer Shende, Janice Cuny,Lars Hansen, Joydip Kundu,Stephen McLaughry and OdileWolfUniversity of Oregon

Debugging Race Conditions inMessage-Passing ProgramsRobert H.B. Netzer and TimothyW. BrennanBrown UniversitySuresh K. Damodaran-KamalConvex Computer Corp.

Debugging HeterogeneousApplications with PangaeaLeesa Hicks and Francine Ber-manUniversity of California, SanDiego

R

S1

S2


Performance MonitoringWednesday, May 22, 19962:00 pm – 3:20 pm

Bert Halstead, ChairDEC Cambridge Research Lab

Execution Analysis of DSMApplications: A Distributedand Scalable ApproachLionel Brunie, Laurent Lefevreand Olivier ReymannEcole Normale Superieure deLyon

The SHRIMP PerformanceMonitor: Design and Applica-tionsMargaret Martonosi, Douglas W.Clark and Malena MesarinaPrinceton University


Tools: What’s Right,What’s WrongWednesday, May 22, 1996

3:45 pm – 5:00 pm

Joan Francioni, ModeratorUniversity of Southwest Louisi-ana

Debugger ArchitecturesThursday, May 23, 19969:20 am – 10:30 am

Doug Kimelman, ChairIBM T.J. Watson Research Center

Experiences with Building Dis-tributed DebuggersMichael S. Meier, Kevan L. Miller,Donald P. Pazel and Josyula R.RaoIBM T.J. Watson Research Center

KDB: A Multi-Threaded Debug-ger for Multi-Threaded Appli-cations

L

S3

D1

S4

Peter A. BuhrUniversity of WaterlooMartin KarstenUniversitaet Mannheim


Performance AnalysisThursday, May 23, 199610:45 am – 12:30 pm

Diane Rover, ChairMichigan State University

Automatic Performance Pre-diction to Support CrossDevelopment of Parallel Pro-gramsMatthias SchumannTechnische UniversitaetMuenchen

Three Performance ToolDesign Issues and CHITRA’sSolutionsMarc Abrams, Randy Ribler andAnup MathurVirginia Polytechnic Institute andState University

Event Graph Visualization forDebugging Large ApplicationsDieter Kranzlmueller and JensVolkertJohannes Kepler University Linz


Debugger InterfacesThursday, May 23, 19962:00 pm – 3:20 pm

Doug Pase, ChairIBM Power Parallel Systems

The Mantis Parallel DebuggerSteven S. Lumetta and David E.CullerUniversity of California, Berkeley

The p2d2 Project: Building aPortable Distributed DebuggerRobert HoodNASA Ames Research Center

S5

L

S6


New Frontiers, or Backto the FutureThursday, May 23, 1996

3:45 pm – 5:00 pm

Dan Reed, ModeratorUniversity of Illinois, Urbana-Champaign

Barton MillerUniversity of Wisconsin-Madison

General Chair

Joan FrancioniUniversity of Southwestern Loui-siana

Daniel ReedUniversity of Illinois, Urbana-Champaign

Program Chairs

PROGRAM COMMITTEEAl GeistOak Ridge National LabCherri PancakeOregon State UniversityBert HalsteadDEC Cambridge Res. LabDoug PaseIBM Power Parallel SystemsDoug KimelmanIBM T.J. Watson Res. CenterMendel RosenblumStanford UniversityAllen MalonyUniversity of OregonDiane RoverMichigan State UniversityJohn Mellor-CrummeyRice UniversityKarsten SchwanGeorgia TechRobert NetzerBrown UniversityJerry YanNASA Ames Research Center

LOCAL ARRANGEMENTSJeffrey HollingsworthUniversity of Maryland, CollegePark

D2

Sessions

Committees


Grand Ballroom

35

Registration for the Fourth Annual Workshop on I/O in Parallel and Distributed Systems (IOPADS) includesproceedings published by ACM Press, technical sessions, continental breakfast, lunch, and coffee breaks.Student registration fee includes all of the above. The conference is sponsored by ACM SIGACT, ACMSIGARCH, ACM SIGOPS, and IEEE TCOS, in cooperation with ACM SIGMETRICS.

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

Applications and Lan-guage SupportMonday, May 27, 19969:00 am – 10:30 am

Charles Koelbel, ChairRice University

9:00 amEfficient Data-Parallel Files viaAutomatic Mode DetectionJason A. MooreOregon State UniversityPhilip J. HatcherUniversity of New HampshireMichael J. QuinnOregon State University

9:30 amTuning the Performance of I/OIntensive Parallel ApplicationsAnurag Acharya, Mustafa Uysal,Robert Bennett, Assaf Mendel-son, Michael Beynon, Jeffrey K.Hollingsworth, Joel Saltz andAlan SussmanUniversity of Maryland

10:00 amThe Design and Implementa-tion of SOLAR, a PortableLibrary for Scalable Out-of-Core Linear Algebra Computa-tionsSivan Toledo and Fred G.GustavsonIBM T. J. Watson


Caching and Architec-tural IssuesMonday, May 27, 199611:00 am – 12:30 pm

John Wilkes, ChairHewlett-Packard Laboratories

S1

S2

11:00 amEvaluating Approximately Bal-anced Parity-Declustered DataLayouts for Disk ArraysEric J. Schwabe, Ian M. Suther-land and Bruce K. HolmerNorthwestern University

11:30 amENWRICH: A Compute-Proces-sor Write Caching Scheme forParallel File SystemsApratim Purakayastha andCarla Schlatter EllisDuke UniversityDavid KotzDartmouth College

12:00 pmPrefetching in Segmented DiskCache for Multi-Disk SystemsValery V. SolovievNorth Dakota State University


File SystemsMonday, May 27, 19962:00 pm – 3:30 pm

David Womble, ChairSandia National Laboratories

2:00 pmPerformance of the Galley Par-allel File SystemNils Nieuwejaar and David KotzDartmouth College

L

S3

Sessions

2:30 pmHFS: A Performance-OrientedFlexible File System Based onBuilding-Block CompositionsOrran Krieger and MichaelStummUniversity of Toronto

3:00 pmScalable Message Passing inPandaY. Chen, M. Winslett, K. E. Sea-mons, S. Kuo, Y. Cho and M.SubramaniamUniversity of Illinois


Theory and AlgorithmsMonday, May 27, 19964:00 pm – 5:00 pm

Jeffrey Vitter, ChairDuke University

4:00 pmBounds on the Separation ofTwo Parallel Disk ModelsChris ArmenUniversity of Hartford

4:30 pmStructured Permuting in Placeon Parallel Disk SystemsLeonard F. WisniewskiDartmouth College

S4

Committees

David KotzDartmouth College

General Chair

Thomas H. CormenDartmouth College

General Chair

Ravi JainBellcore

General Chair

Alok ChoudharySyracuse University

Program Chair


Publicity and Publications Chair


Finance Chair

PROGRAM COMMITTEESandra Johnson BaylorIBM T. J. WatsonAlok ChoudharySyracuse UniversityThomas H. CormenDartmouth CollegeDenise EcklundIntel SSDGarth GibsonCarnegie Mellon UniversityCharles KoelbelRice UniversityDavid KotzDartmouth CollegeEthan MillerUniversity of Maryland, BaltimoreCountyRichard MuntzUCLADaniel A. ReedUniversity of Illinois at Urbana-ChampaignJeffrey VitterDuke UniversityJohn WilkesHewlett-Packard LaboratoriesDavid WombleSandia National Laboratories


36

“Philadelphia is ranked as the safest of the nation’s 12

largest metropolitan areas.”

A recent FBI Crime index

Session 1Monday, May 27, 19969:30 am – 11:45 am

Sampath Kannan, ChairUniversity of Pennsylvania

9:30 amClyde MonmaBellcore

Telecommunications Net-work Design: Opportunitiesand Challenges for the Math-ematical SciencesThe telecommunications indus-try is going through a period ofvery rapid change due to manyfactors, including the impact ofnew and emerging technologies;the convergence of computing,communications and entertain-ment; and government regula-tory policies in response to globalcompetition.

The current situation providesan exciting opportunity for themathematical and computa-tional sciences to make a signifi-cant impact and to help shapethe future of the telecommunica-tions industry.

This talk will describe some ofthe opportunities and chal-lenges for researchers in thisnew environment. The talk willalso include some specific exam-ples illustrating the impact

S1the development of security fea-tures in a wide range of networkservices. (Joint work with MattBlaze and Jack Lacy.)


Panel DiscussionMonday, May 27, 19963:45 pm – 5:15 pm

Barry LeinerARPAHenry BayardMITRE CorporationPeter WeinbergerAT&T Research

The panel will discuss the futureof networks research and therole of mathematics and theoret-ical computer science in thisarea. Panelists will include peo-ple from academia, industry,and funding agencies.

PROGRAM ORGANIZERS:Sampath KannanDepartment of Computer andInformation ScienceUniversity of PennsylvaniaJill MesirovDepartment of Computer ScienceSTSS, IBMBoston University

S3

searching one disk to searchingthe whole Internet. I will also dis-cuss how to combine global datawith local processing to makeInternet access much more pro-ductive.

2:30 pmJoan FeigenbaumAT&T Research

Managing Trust in Large Net-worksThe speaker will identify the“trust management problem” asa distinct and important compo-nent of security in network ser-vices. Aspects of the trustmanagement problem includeformulating security policies andsecurity credentials, determiningwhether particular sets of cre-dentials satisfy the relevant poli-cies, and specifying anddeferring trust to third parties.Existing systems that supportsecurity in networked applica-tions, including X.509 and PGP,address only narrow subsets ofthe overall trust managementproblem and often do so in amanner that is appropriate toonly one application. This paperpresents a comprehensiveapproach to trust management,based on a simple language forspecifying trusted actions andtrust relationships. It alsodescribes a prototype implemen-tation of a new “trust manage-ment system,” called“PolicyMaker,” that will facilitate

which research advances inmathematics and computingare already having on the tele-communications industry.


10:45 amTitle to be determinedVan JacobsonLawrence Berkeley Laboratory

Session 2Monday, May 27, 19961:15 pm – 3:30 pm

Jill P. Mesirov, ChairSTSS, IBMBoston University

1:15 pmUdi ManberUniversity of Arizona

Finding Useful InformationThrough the InternetInformation is now available invast amounts from numerousdiverse sources on every topic.But finding the right informationand figuring what to do with it isstill hard. There is a great needfor better tools to locate relevantinformation and process it. I willdiscuss several new search andfiltering systems we developed(Glimpse, GlimpseHTTP, Warm-list, Siff, Harvest) ranging from

S2

Registration for the Symposium on Networks and Information Management includes continental breakfastsand coffee breaks. The Symposium on Networks and Information Management is sponsored by the Societyfor Industrial and Applied Mathematics (SIAM) in cooperation with the Department of Computer and Informa-tion Science, University of Pennsylvania

SIAM Symposium on Networks and Information Management (NIM)

Sessions


37

“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

HOTEL

Philadelphia Marriott Hotel1201 Market StreetPhiladelphia PA 19107Phone: (215) 625-2900FAX: (215) 625-6097

Location/Transportation FactsConnected to Pennsylvania Convention Center and Gallery Mall in downtown Philadelphia. Eight milesfrom Philadelphia International Airport. Two blocks from City Hall, six blocks from Independence Halland four blocks from the cultural district.

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

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

AccommodationsPhiladelphia’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 theMarriott) and at the Best Western Center City, 501 N. 22nd Street (approximately 13 blocks from theMarriott).

Dining/EntertainmentAllie’s American Grille serves breakfast, lunch and dinner. Outdoor Cafe for breakfast, lunch and din-ner. JW’s Steakhouse serves dinner. Lobby Bar, Atrium Lounge and Champions Restaurant and SportsBar offer a variety of locations for your enjoyment.

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

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

Child CareAttendees requiring child care should contact the hotel independently.

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

AttractionsEven 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 inde-pendence in 1776.

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

The second largest city on the East Coast and the fifth largest city in the U.S., Philadelphia is home tomore 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 thePhiladelphia Museum of Art; the great sculptures of the Rodin Museum; one of America’s leading sci-ence museums at the Franklin Institute Science Museum (site of FCRC Excursions on Wednesday andSaturday evenings); the world’s best dinosaur exhibit and natural history at the Academy of NaturalSciences; and the Free Library. The Pennsylvania Academy of the Fine Arts, the Philadelphia Museumof Art, the Rodin Museum and the Barnes Foundation in Merion, comprise the strongest collection ofImpressionist 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, andoutstanding sculpture.

Advance HotelRegistration DeadlineApril 19, 1996

38

HOTEL REGISTRATION FORM

Credit Authorization

Reservation Request

Name Arrival Date Arrival Time

❑ American Express ❑ Visa❑ MasterCardCredit card type

Credit card number Expiration date

Print name as it appears on the card

Signature

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

Arrival date

❑❑ Quad $173Double $133

❑ Single $133

❑ Non-smoking room requested

Expected time of arrival AM/PM

Departure date

Name

Organization

Phone

Address

City State Zip

❑ Triple $153

Advance Deposit

To avoid duplication, please do not mail in this form if you make your reservation

PLEASE MAKE SURE ALL INFORMATION IS COMPLETE BEFORE SEALING ENVELOPE.

by telephone or telefax.

Philadelphia Marriott Hotel Conference Headquarters1201 Market StreetPhiladelphia, PA 19107(215) 625-2900 Fax: (215) 625-6097

Position/title

Fax

❑ Double, Triple, and Quad $100

❑ Single $95


Holiday Inn Express1305 Walnut Street (two blocks from the Marriott)Philadelphia, PA 19107(215) 735-9300 Fax: (215) 732-2682

Deadline April 19, 1996


❑ Single $63

Best Western Center City501 N. 22nd Street (approximately 13 blocks from the Marriott)Philadelphia, PA 19130(215) 568-8300 Fax: (215) 557-9448

❑ Double $69

A limited number of economy rate rooms have been set aside forattendees at the following nearby hotels.

39

40

REGISTRATION FORM

Continued on next page

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 125Half day Tutorial 175 250 220 250 55 70Full day Tutorial 250 300 310 375 100 125

❑ ACM or IEEE membership #_______________________

3. ICS 330 405 385 460 125 175Full day Tutorial 200 250 250 300 200 200

❑ ACM membership #_______________________

4. METRICS 300 375 350 425 105 155Tutorial with Conference 485 640 585 740 180 260Tutorial 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 150Half day Tutorial (T1 or T2 or (T3 and T4)) 55 75 75 90 30 40Full 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 150Half day Tutorial 150 200 200 250 150 150Full 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 $______ $______ $______ $______ $______ $______

Conference Selection

Individual Conference Registration

EARLY REGISTRATIONDEADLINE APRIL 26, 1996

Multiple Conferences Registration

Single Day Registration

Subtract $50 (non-student) or $25 (student) from the Conference Total if registering for any one of the following pairs of conferences: STOC andComplexity, 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 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.

✂C

ut

alo

ng d

ott

ed lin

e

Please circle the appropriate amount(s), compute the total, and write it in the Conference Total box on thenext page. Check membership box and provide number if applicable. Refer to individual conference pages forinformation about what is included in the fee for each conference. To the extent the facilities allow, attendeesare free to attend technical sessions of other conferences being held at the same time as the conferences theyare registered for.

REGISTRATION FORM (continued)

❑ Check or money orderU.S. bank onlyPayble to:

FCRC ‘96

$

Electronic

Identification

Registration Information

❑

• Complete both sides of thisform. Use the back side of thisform to select options and calcu-late costs.• Enclose payment.

Name

Position

Organization

Address

First name, Middle initial, Surname

Street

City, State/Province, Postal Code, Country

Method of Payment

NumberMaster Card

Exp date

Name exactly as it appears on credit card

Signature

Total Payment Enclosed $

Send your registration to:

FCRC Conference3 Church Circle, Suite 194Annapolis, MD 21401

❑ Visa

Area code, Number

Mail Address

Phone

Area code, Number

Fax

Franklin Institute

My name and address may be distributed beyond the FCRC attendance list:

❑ Approved (unlimited use) ❑ Limited to sponsor and sister organizations ❑ Attendee list only

❑ Do you have any special needs?

Conference Totals (from prior page) $

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

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

• Mail or fax both sides to:

FCRC Conference3 Church Circle, Suite 194Annapolis, MD 21401or fax to:FCRC Conference(410) 267-0332

• CancellationsYou may cancel and receive arefund less a $50 processing feeif a request is received in writingon or before April 19, 1996, atthe Annapolis address shownon this form. Substitutions areacceptable.

Conference Totals

41

✂C

ut a

lon

g d

otte

d lin

e

EXCURSIONS

An Evening of Fellowship andFun at the Franklin Institute

Dominated by a gigantic statueof Benjamin Franklin, FranklinHall is just one part of theFranklin Institute ScienceMuseum that will be open tothose participating in theWednesday, May 22 or the Sat-urday, May 25 Excursions. Par-ticipants will enjoy Philadelphiastyle food and beverage whileviewing fun, hands-on scienceexhibits in the Halls of Inven-tions, Electricity and Aviation.Approximately 11 blocks fromthe Marriott Hotel, round tripbus service will be provided.

The fee for the Evening at theFranklin Institute ScienceMuseum is included in most ofthe participating Conferences’

Registration fee. Additional tick-ets can be ordered in advance at$60.00 each. See the Registra-tion form of page 41. Tickets willbe sold on-site for $65.00 eachup to 24 hours prior to eachevent if space is available.

Date: Wednesday, May 22 orSaturday, May 25

Time: 6:00 pm – 10:00 pmCost: $60 per person with

advance registration$65 per person on-siteif space is available.

ExhibitsFCRC week also features exhib-its consisting of book and educa-tional software displays anddemostrations.

Date: Wednesday, May 22throughSunday, May 26

Time: 9:00 am – 6:00 pmRoom: Franklin Hall

E

USAir agrees to offer an exclusive low fare for the attendeesof the Federated Computing Research Conference, May 20-28, 1996, in Philadelphia, PA. This special fare will offer a5% discount off First Class and any published USAir pro-motional round trip fares. A 10% discount off unrestrictedcoach fares will apply with 7 day advance reservations andticketing required. These discounts are valid providing allfare rules and restrictions are met and is applicable fortravel from the Continental United States, Bahamas, Ber-muda, Canada, and San Juan, PR. Meeting discounts arenot 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-86448:00 AM - 9:00 PM (Eastern Time)

Refer to Gold File Number 63930014Once your reservations are confirmed, we will mail the tick-ets to you or suggest several other convenient methods ofpurchase.

If you normally use the services of a travel agent or corpo-rate travel department, please have them place the call sothat they may obtain the same advantages for you. The spe-cial meeting fare is only available through the Meeting andConvention Reservation Office.

TRANSPORTATION

Airline Discount

42

EXHIBITS

HOTEL MAP

43

HOTEL MAP

44

NOTES

45

NOTES

46

ASSOCIATIONFORCOMPUTINGMACHINERY

1515 Broadway

New York, NO 10036-5701 USA

Non-Profit OrganizationU.S. Postage

P A I DPhillipsburg, NJPermit No. 187

fcrc ‘96 federated computing 23rd annual acm/ieee …acm-stoc.org/stoc1996/program96.pdforganizing...

Documents