|Summer Institute: Parallel and Distributed Computing firstname.lastname@example.org (1998-03-07)|
|From:||email@example.com (Pei-Zong Lee)|
|Date:||7 Mar 1998 22:43:23 -0500|
* Call for Participation Please Post *
The Summer Institute on
"Parallel and Distriubted Computing"
Center for Applied Science and Engineering
Institute of Information Science
Nankang, Taiwan, Republic of China
July 23-29, 1998
Organizer: Prof. D. T. Lee, Department of ECE
Evanston, IL 60208, U.S.A.
Phone (847) 491-5007. Fax (847) 467-4144.
Zvi M. Kedem, Professor of Computer Science
New York University
Professor Kedem received his BSc, MSc, and DSc degrees in Mathematics
from the Technion - Israel Institute of Technology, the last of these
in 1974. He has he taught at Columbia University, MIT, University of
Texas - Dallas, and SUNY at Stony Brook. Currently he is a Professor
in the Department of Computer Science at the Courant Institute at New
York University, where he previously also served as department chair.
He has conducted research in among others: algebraic and VLSI
complexity, design of efficient algorithms, computer graphics,
databases, data mining, and parallel computing. Currently his
research focuses on effective of utilization of distributed platforms
for high performance and collaborative computations.
Charles E. Leiserson, Professor of Computer Science and Engineering
Massachusetts Institute of Technology
Professor Leiserson received the B.S. degree in computer science
and mathematics from Yale University in 1975 and the Ph.D. degree
in computer science from Carnegie Mellon University in 1981. He is
now a Professor in the MIT Department of Electrical Engineering and
Computer Science, and head of the Supercomputing Technologies
research group in the MIT Laboratory for Computer Science.
His research centers on the theory of parallel computing. His recent
work has focused on dynamic, asynchronous parallel computing.
His textbook, Introduction to Algorithms, coauthored with
Ronald L. Rivest and Thomas H. Cormen, was named Best 1990
Professional and Scholarly Book in Computer Science and Data
Processing by the Association of American Publishers and is
currently the leading textbook on computer algorithms.
Shlomo Moran, Professor of Computer Science,
Technion, Israel Institute of Technology
Professor Moran received his BSc and DSc degrees in Mathematics at
the Technion, Israel, in 1975 and 1979, resp. He is a Professor in
the Depatrment of Computer Science at the Technion and now visiting
University of Arizona. He has published works in various areas of
theoretical computer science, and currently his main research
interests are in the area of distributed algorithms.
Bruce Maggs, Professor of Computer Science
Carnegie Mellon University
Professor Maggs received the S.B., S.M., and Ph.D., degrees in
computer science from the Massachusetts Institute of Technology
in 1985, 1986, and 1989, respectively. His research interests lie
in the area of networks for parallel and distributed computing
systems. After spending one year as a Postdoctoral Associate
at MIT, he joined NEC Rsearch Institute in Princeton, New Jersey,
where he was employed as a Research Scientist from 1990 to 1993.
At present he is an Associate Professor of Computer Science at
Carnegie Mellon University. In 1986, he became the first winner
(with Charles Leiserson) of the Daniel L. Slotnick Award for
Most Original Paper at the International Conference on Parallel
Processing, and in 1994 he received an NSF National Young
Investigator Award. He was co-chair of the 1993-1994 DIMACS
Special Year on Massively Parallel Computation and has served
on the program committees of the SPAA, SODA, STOC, SPDP, ISPAN, IPPS,
CATS, and PCDS conferences.
Shang-Hua Teng, Professor of Computer Science
University of Illinois at Urbana-Champaign
Professor Teng received the B.S. degree in computer science
and the B.A. degree in electrical engineering from Shanghai
Jiao Tong University in 1985, the M.S. degree in computer science
from University of Southern California in 1988, and the Ph.D. degree
in computer science from Carnegie Mellon University in 1991.
He is now an Associate Professor in the Department of Computer Science,
University of Illinois at Urbana-Champaign (UIUC).
He taught as a faculty in the Departemnt of Mathematics of MIT and
in the Computer Science Department of the University of Minnesota.
He has worked and consulted for IBM Almaden Research Center, Intel
Corporation, Xerox PARC, Cray Research/SGI, Thinking Machine
Corporation, and NASA Ames Research Center.
He is an Alfred P. Sloan Fellow and has received NSF Faculty Early
Career Development Award.
His research centers on effecient algorithm design and implementation.
His recent interests include large scale information organization,
distributed web-crawling, profile matching and generation,
parallel scientific computing, computational geometry, VLSI and
circuit simulation, combinatorial optimization, probabilistic
analysis, distributed computing and cryptography. He has received
a US Patent for his work on a compiler optimization technology.
Robert (Bobby) Blumofe, Professor of Computer Science
University of Texas at Austin
Professor Blumofs received his Bachelor's degree from Brown
University in 1988 and his Ph.D. from MIT in 1995. He started his
research career working on computer graphics with Andy van Dam at
Brown. He did his Ph.D. work on algorithms and systems for parallel
multithreaded computing with Charles Leiserson at MIT, for which he
received the George M. Sprowls Doctoral Dissertation Award from the
MIT Department of Electrical Engineering and Computer Science. As
part of this dissertation work, Bobby developed an algorithmic theory
of multithreaded computation, and he designed and implemented a
multithreaded language and runtime system, called Cilk, that is
based on the algorithmic theory. In addition, he developed an
adaptive and fault-tolerant version of Cilk, called Cilk-NOW,
that runs on networks of workstations. He is now an Assistant
Professor at the University of Texas at Austin.
This course is concerned with the broad area of parallel and
NOW (Network of Workstations) computing systems and the means of
managing and scheduling applications to run on these systems are
becoming increasingly important. Key issues that need to be
investigated include management of heterogenity, load balancing
and work migration, fault tolerance, security and parallelizing
compilers. Parallel and distributed algorithms for scientific
computing, performance evaluation of parallel and distributed
systems, and other issues, theoretical or applied, related to the
main theme of the Summer Insitute will be discussed.
The following is a tentative list of topics to be addressed.
1. parallel/distributed algorithms
2. coarse-grain parallel algorithms and applications
3. parallel scientific computation
4. interconnection networks
5. parallel and distributed computing on network of
7. languages and compiler techniques for parallel programming
8. theory of parallel/distributed computing.
This is a one-week course, and will be supplemented with guest
lectures presented by leading specialists from both academia and
industry. It will be open to researchers, engineers,
and graduate students who are interested to learn more about
parallel and distributed computing and its applications.
Lecture notes will be distributed in class. Participants are
encouraged to talk about their own research. A selected group
of four to seven participants will stay on for additional three
weeks and will conduct research in collaboration with the
There are no fees for the course. Selected participants from
abroad will be provided support by the Center for Applied Science
and Engineering and the Institute of Information Science, Academia
Sinica to cover their local expenses (meals and lodging).
To apply, send a short resume and a cover letter stating whether
you wish to attend only the course or if you would like to
participate in the research experience. If you would like to
be considered for financial support, indicate this in your cover
lettter and arrange for two letters of recommendation to be sent
Prof. D. T. Lee, Department of ECE
Evanston, IL 60208, U.S.A.
Phone (847) 491-5007. Fax (847) 467-4144.
Applications requesting financial support should be received by
April 15, 1998, and notification of a decision will be sent by
May, 15. Other applications will be considered until June 10.
Academia Sinica is the national research institution in Taiwan.
It undertakes academic research on various subjects in the
sciences and humanities. It is located in the outskirts of the
capital city Taipei, population 1.8 million, and has very good
public transportation, buses or taxis, to downtown Taipei.
The weather in Taipei in July and August is warm, about
25-35 degrees Centigrade (or 75-95 degrees Fahrenheit).
There are many attractions in Taipei, including the world famous
National Palace Museum and the Yangmingshan National Park.
The Academic Activity Center in Academia Sinica provides lodging
for visiting researchers. Located at the first floor of the
Academic Activity Center is a fairly good northern style
Chinese restaurant serving breakfast, lunch, and dinner.
The course will be held at the Institute of Information Science
in Academia Sinica.
The Institute has networked UNIX-based workstations with access to
the Internet. Its Computer Science Library is one of the best
professional libraries in the island with more than 15,000
computer-related titles and journals published after 1980.
Within 5-minute walking distance is the Nation's best
Mathematics Library which has most of the mathematics-related
titles and older titles of computer science. Those above-mentioned
facilities will be made available to participants of the
For more information about Taiwan, please see the Web pages:
Information about Academia Sinica can be found in the Web pages:
URL:http://www.sinica.edu.tw. Information about the Institute of
Information Science can be found in the Web pages:
Return to the
Search the comp.compilers archives again.