PROGRAM FOR SPAA 2000

July 9, 2000, Sunday

19:00 - 21:00

Reception, Oakes Mansion

July 10, 2000, Monday

8:00 - 8:45	Continental breakfast, Deck
8:45 - 9:00	Welcome to SPAA 2000, Acadia North
9:00 - 10:40	Session 1: Scheduling and Load Balancing, Acadia North
9:00 - 9:25	The Data Locality of Work Stealing Umut Acar, Guy Blelloch and Robert Blumofe
9:25 - 9:50	Scheduling Cilk Multithreaded Parallel Programs on Processors of Different Speeds Michael A. Bender and Michael O. Rabin
9:50 - 10:15	Optimal Schedules for Data-Parallel Cycle-Stealing in NOWs Arnold L. Rosenberg
10:15 - 10:40	Diffusive Load Balancing Schemes on Heterogeneous Networks R. Elsaesser, B. Monien and R. Preis
10:40 - 11:00	Break, Deck
11:00 - 12:00	Invited Talk, Acadia North Title: TBA Daniel Lewin, CTO, Akamai Technologies, Inc.
12:00 - 13:30	Lunch, Cadillac
13:30 - 15:10	Session 2: Communication, Acadia North
13:30 - 13:55	Interprocessor Communication with Memory Constraints Ali Pinar and Bruce Hendrickson
13:55 - 14:20	Efficient On-line Communication in Cellular Networks Ioannis Caragiannis, Christos Kaklamanis, and Evi Papaioannou
14:20 - 14:45	Connection Caching under Various Models of Communication Edith Cohen, Haim Kaplan, and Uri Zwick
14:45 - 15:10	Fault tolerant graphs with small degree Li Zhang
15:10 - 15:30	Break, Deck
15:30 - 17:10	Session 3: Caching and Scheduling, Acadia North
15:30 - 15:55	Generalized Connection Caching Susanne Albers
15:55 - 16:20	Comparing the Effectiveness of Fine-Grain Memory Caching against Page Migration/Replication in Reducing Traffic in DSM Clusters An-Chow Lai and Babak Falsafi
16:20 - 16:45	Asynchronous Scheduling of Redundant Disk Arrays Peter Sanders
16:45 - 17:10	Infinite Parallel Job Allocation Petra Berenbrink, Artur Czumaj, Tom Friedetzky and Nikita Vvedenskaya
17:10 - 20:00	Dinner on your own
20:00 - 22:00	Business Meeting, Acadia North

July 11, 2000, Tuesday

7:45 - 8:30	Continental breakfast, Deck
8:30 - 10:10	Session 4: Data Movement, Acadia North
8:30 - 8:55	Data Management in Hierarchical Bus Networks Friedhelm Meyer auf der Heide, Harald Raecke, and Matthias Westermann
8:55 - 9:20	Efficient, Distributed Data Placement Strategies for Storage Area Networks Andre Brinkmann, Christian Scheideler, Kay Salzwedel
9:20 - 9:45	Broadcast Scheduling Optimization for Heterogeneous Cluster Systems Pangfeng Liu and Tzu-Hao Sheng
9:45 - 10:10	DCAS-Based Concurrent Deques O. Agesen, D. Detlefs, C. Flood, and A. Garthwaite
10:10 - 10:30	Break, Deck
10:30 - 12:00	Session 4: SPAA Revue Invited Talks, Acadia North
10:30 - 11:15	Fabricating an 8-Issue Ultrascalar Processor in a 0.18 micron Copper Technology Bradley C. Kuszmaul, Yale
11:30 - 12:00	FFT in Four Styles: Teaching Paradigms of Parallel Programming Thomas H. Cormen, Dartmouth
12:00 - 13:30	Lunch, Cadillac
13:30 - 14:45	Session 5: SPAA Revue Invited Talk, Acadia North Parallel Branch and Bound for Mixed-Integer Programming Cynthia A. Phillips, Sandia National Laboratories
15:00 - 17:30	Tour of Acadia National Park Meet in hotel lobby
19:00 - 22:00	Banquet, Deck

July 12, 2000, Wednesday

7:45 - 8:30	Continental breakfast, Deck
8:30 - 10:10	Session 6: Parallel Algorithms, Acadia North
8:30 - 8:55	No-Busy-Wait Parallel Algorithms: A Balanced Tree Paradigm Uzi Vishkin
8:55 - 9:20	Algorithmic Foundations for a Parallel Vector Access Memory System Binu K. Mathew, Sally A. McKee, John B. Carter and Al Davis
9:20 - 9:45	An Experimental Study of a Simple, Edge Coloring Algorithm Madhav Marathe, Alessandro Panconesi, and Larry D. Risinger
9:45 - 10:10	Multithreaded Algorithms for Fast Fourier Transform Parimala Thulasiraman, Kevin Theobald, Ashfaq Khokhar, and Guang Gao
10:10 - 10:30	Break, Deck
10:30 - 12:10	Session 7: Routing and Layout, Acadia North
10:30 - 10:55	A (2.954 + e)n Oblivious Routing Algorithm on 2D Meshes Kazuo Iwama and Eiji Miyano
10:55 - 11:20	VLSI Layout and Packaging of Butterfly Networks Chi.-Hsiang Yeh, B. Parhami, E. A. Varvarigos, and Hua Lee
11:20 - 11:45	Compact, Multilayer Layout for Butterfly Fat-Tree Andre' DeHon
11:45 - 12:10	An Efficient Self-Simulation Algorithm for Reconfigurable Meshes Susumu Matsumae and Nobuki Tokura
12:10	END. See you next year

Links on This Page

The links in this document should provide you with access to the fullest versions of the papers that are available. In some cases, different versions are listed. Please consult the authors' home pages for further information and for email address by which you might inquire for future versions or related papers.  If you find the links to be broken, please contact the authors (and not SPAA).

Authors of SPAA papers wishing to be listed here (links to papers and/or home pages) should send email with the appropriate URL's to Cindy Phillips (caphill@sandia.gov).