Newsgroups: comp.arch,comp.sys.super,comp.theory,comp.parallel.pvm
From: panda@cis.ohio-state.edu (Dhabaleswar Panda)
Subject: Panel session on `Interconnection Networks' at ICPP '94
Organization: The Ohio State University Dept. of Computer and Info. Science
Date: 16 Jun 1994 21:36:43 -0400
Message-ID: <2tqunbINNjjs@lion.cis.ohio-state.edu>

1994 International Conf. on Parallel Processing
St. Charles, IL.

Date: August 16 (Tuesdasy), 7:00 - 9:30 PM

Panel: Sea of Interconnection Networks: What's Your Choice?

Moderator: Lionel M. Ni, Michigan State University

Panelists:
   Suresh Chittor, Intel Supercomputer Systems Division
   Toshiyuki Nakata, NEC C&C Research Lab. 
   Steve Scott, Cray Research Inc.
   Kang Shin, University of Michigan 
   H.J. Siegel, Purdue University
   Craig Stunkel, IBM Watson Research Center


There are hundreds, if not thousands, of interconnection
networks that have been proposed in academia for constructing
parallel computers. In industry, less than 10 are being used.
Six panelists, all with real network building experience,
are invited to address the following issues:

1. What's your choice?
2. Why industry is not interested in those theoretically
   wonderful academic networks?
3. Is wormhole routing the choice of switching techniques?
4. Is adpative routing useful?
5. Is it necessary to have hardware support for broadcast/multicast?
6. Is embedding important?
7. How important is fault-tolerant routing?
8. What are the characteristics/issues for the system aspects of
   interconnection networks that have been over-emphasized or ignored
   in most interconnection network papers?
9. If you have a chance to redesign your network, what improvements
   you are going to make?

Each panelist will have 15 minutes to address the above questions.

-----posted on behalf of Prof. Lionel Ni
-- 
Dhabaleswar K. Panda, Asst. Professor        e-mail: panda@cis.ohio-state.edu
Dept. of Computer and Information Science    Office: (614) 292-5199 (Tel)
Ohio State University, Columbus, OH 43210-1277, USA. (614) 292-2911 (Fax)

