Mailing List Archives
Mail Index
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
SIGARCH-MSG: April 2001 Digest of SIGARCH Messages
Attached is the SIGARCH mailing list digest for April 2001
(grep sigarch-apr01):
* The Rise and Fall of Multiprocessor Papers in ISCA
(NOT An April Fool's Joke)
* ISCA 2001 Student Travel Grants
* ISCA 2001 Workshop on Memory Performance Issues
* FAST 2002 The Conference on File and Storage Technologies
* ACM Sigmetrics 2001 / Performance 2001
* 13th Symposium on Computer Architecture & High Performance Computing (Brazil)
* Removing yourself from SIGARCH mailing list
--Mark D. Hill
infodir_SIGARCH@acm.org
SIGARCH Information Director
----------------------------------------------------------------------
Mark D. Hill Office 6373 CSS
Professor & Romnes Fellow Phone 608-262-2196
Computer Sciences Department Asstnt 608-265-3402
University of Wisconsin-Madison FAX 608-262-9777
1210 West Dayton Street E-mail markhill@cs.wisc.edu
Madison, WI 53706-1685 USA http://www.cs.wisc.edu/~markhill
----------------------------------------------------------------------
The Rise and Fall of Multiprocessor Papers in the
International Symposium on Computer Architecture (ISCA)
Mark D. Hill and Ravi Rajwar
Computer Sciences Dept.
University of Wisconsin-Madison
{markhill,rajwar}@cs.wisc.edu
Filed at http://www.cs.wisc.edu/~markhill/mp2001.html
29 March 2001
Several researchers have anecdotally noted that the number of
multiprocessor papers appears to be in decline (despite industry's
continued interest in the subject).
To examine this hypothesis we placed papers from the first 28 ISCA
(1973-2001) into categories. Any selection of and assignment to
categories is somewhat subjective and error-prone. We attempted
to be generous to the multiprocessor category. For ISCA 2001,
for example, we included a paper on compiler/verification techniques
("A Simple Method for Automatically Extracting Formal Specifications
from FLASH Cache Coherence Protocol Code") and another on a parallel
implementation of the sequential programming model ("Removing
Architectural Bottlenecks to the Scalability of Speculative
Parallelization"). Additional categories were dataflow, fault
tolerance, interconnection networks, and other.
Below we present ISCA multiprocessor paper data in histogram form
and then give tabular data for all categories. We find that:
* Multiprocessor papers have averaged 30% of the total ISCA papers.
* To first order, the number of multiprocessor papers expanded from
the 1975 to 1985 and then declined thereafter.
* The total number of papers follows a similar but less dramatic
trend.
As a research community, we should reflect on whether such trends are
deliberate and appropriate or the result of unintended consequences.
Several researchers predict an inflection point in multiprocessing due
to the the ubiquitous parallelism offered by multithreading and chip
multiprocessing. Perhaps we need to expand the "normal science" needed
to accelerate this inflection point [c.f., Thomas S. Kuhn, The Structure
of Scientific Revolutions, University of Chicago Press, Chicago, 1962].
----------------------------------
Histogram for Absolute Number of Papers:
http://www.cs.wisc.edu/~markhill/mp2001-absolute.gif
----------------------------------
Histogram for Relative Percent:
http://www.cs.wisc.edu/~markhill/mp2001-relative.gif
----------------------------------
Total MP
ISCA# Year Papers Papers Histogram
1 1973 28 5 (17%) *****
2 1974 38 2 ( 5%) **
- 1975 -- No ISCA --
3 1976 40 8 (20%) ********
4 1977 27 10 (37%) **********
5 1978 38 7 (18%) *******
6 1979 27 6 (22%) ******
7 1980 40 11 (28%) ***********
8 1981 41 15 (37%) ***************
9 1982 35 9 (26%) *********
10 1983 54 19 (35%) *******************
11 1984 46 16 (35%) ****************
12 1985 51 25 (49%) *************************
13 1986 50 19 (38%) *******************
14 1987 35 10 (29%) **********
15 1988 50 21 (42%) *********************
16 1989 46 14 (30%) **************
17 1990 34 15 (44%) ***************
18 1991 38 12 (32%) ************
19 1992 39 14 (36%) **************
20 1993 32 15 (47%) ***************
21 1994 34 12 (35%) ************
22 1995 37 13 (35%) *************
23 1996 28 11 (39%) ***********
24 1997 30 8 (27%) ********
25 1998 33 7 (21%) *******
26 1999 26 5 (19%) *****
27 2000 29 3 (10%) ***
28 2001 24 2 ( 8%) **
----------------------------------
Categories:
There are roughly 5 categories:
1. Others: everything not in the remaining categories. Also included in
this category are uniprocessor memory systems, I/O and disk subsystems,
programming languages, and special/general purpose uniprocessor
architectures (eg. superscalar, multiscalar, and SMT processors).
2. Multiprocessors (MP): anything to do with multiple processors and
a shared-memory, message passing or some other parallel programming
model. Thus array processors and such also find themselves in
this category. We have also counted the 2000 and 2001 papers on
"speculative parallelization of sequential code and running it on a
shared-memory system" in this category, although strictly speaking
they should be in the "Others" category similar to the Multiscalar
and other such paradigms.
3. Dataflow
4. Fault tolerance (Fault Tol.)
5. Interconnection networks (ICN)
Total Others Multi. Data Fault ICN
Proc Flow Tol.
ISCA01:1973 28 18 (63%) 5 (17%) 0 4 1
ISCA02:1974 38 35 (92%) 2 ( 5%) 1 0 0
ISCA03:1976 40 28 (70%) 8 (20%) 1 0 3
ISCA04:1977 27 15 (56%) 10 (37%) 0 0 2
ISCA05:1978 38 24 (63%) 7 (18%) 1 4 2
ISCA06:1979 27 14 (52%) 6 (22%) 0 1 6
ISCA07:1980 40 20 (50%) 11 (28%) 1 3 5
ISCA08:1981 41 16 (39%) 15 (37%) 3 1 6
ISCA09:1982 35 14 (40%) 9 (26%) 2 3 7
ISCA10:1983 54 20 (37%) 19 (35%) 8 4 3
ISCA11:1984 46 19 (41%) 16 (35%) 1 6 4
ISCA12:1985 51 17 (33%) 25 (49%) 3 2 4
ISCA13:1986 50 23 (46%) 19 (38%) 5 1 2
ISCA14:1987 35 19 (54%) 10 (29%) 3 0 3
ISCA15:1988 50 20 (40%) 21 (42%) 2 2 5
ISCA16:1989 46 22 (48%) 14 (30%) 5 0 5
ISCA17:1990 34 16 (47%) 15 (44%) 1 0 2
ISCA18:1991 38 22 (58%) 12 (32%) 1 0 3
ISCA19:1992 39 19 (49%) 14 (36%) 2 0 4
ISCA20:1993 32 14 (47%) 15 (47%) 0 2 1
ISCA21:1994 34 17 (50%) 12 (35%) 0 4 1
ISCA22:1995 37 17 (46%) 13 (35%) 2 2 3
ISCA23:1996 28 15 (54%) 11 (39%) 0 0 2
ISCA24:1997 30 18 (60%) 8 (27%) 0 1 3
ISCA25:1998 33 25 (76%) 7 (21%) 0 0 1
ISCA26:1999 26 20 (77%) 5 (19%) 0 0 1
ISCA27:2000 29 25 (86%) 3 (10%) 0 1 0
ISCA28:2001 24 21 (88%) 2 ( 8%) 0 0 1
---- --- --- --- --- ---
1030 553 (54%) 314 (30%) 42 41 80
Submitted by: Mark D. Hill <markhill@cs.wisc.edu>
----------------------------------------------------------------------
STUDENT TRAVEL GRANTS FOR ISCA 2001
SIGARCH is providing funds for a limited number of travel grants for student members of SIGARCH to attend ISCA 2001. Grants can cover transportation, symposium registration, and lodging, but not meals. The application deadline is APRIL 20, 2001 and recipients will be notified approximately one week later.
The size of grants may be limited due to budgetary constraints. In particular there may be upper bounds on specific items, and we may set different upper bounds based upon the level of involvement (symposium speaker, vs. workshop speaker, vs. coauthor for example).
Grants will be paid on submission of original travel receipts and a brief trip report. Grant application forms are available at http://www.ee.princeton.edu/~isca2001. To apply for a grant, email or snail mail a completed application form to:
Allan Gottlieb
NEC Research Institute
4 Independence Way
Princeton NJ 08540
E-mail: gottlieb@nyu.edu
Submitted by Margaret Martonosi <mrm@ee.princeton.edu>
----------------------------------------------------------------------
CALL FOR PAPERS
Workshop on Memory Performance Issues
Held in conjunction with the
28th International Symposium on
Computer Architecture (ISCA28)
Goteborg, Sweden, June 30 - July 4, 2001
Organizers:
Haldun Hadimioglu, Polytechnic University, haldun@photon.poly.edu
David Kaeli, Northeastern University, kaeli@ece.neu.edu
Jeff Kuskin, Atheros Communications, jsk@atheros.com
Ashwini Nanda, IBM TJ Watson Research Center, ashwini@watson.ibm.com
Josep Torrellas, University of Illinois at Urbana-Champaign, torrellas@cs.uiuc.edu
Topics:
This workshop combines two existing workshops (Scalable Shared Memory
Multiprocessors and Solving the Memory Wall). The goal of this new
workshop is to provide a forum for researchers and practitioners
from industry and academia to discuss advances in
technology, architecture, and algorithms that address the
need for scalability in multiprocessors and the growing gap between
CPU/network and memory speeds. Both hardware and software approaches to
addressing scalability and speed disparities are encouraged.
We are especially interested in attracting new, experimental or
paper techniques, technologies and algorithms that address these
issues.
Submissions:
Please submit a 10 page extended abstract for review by the program
committee. Authors of accepted abstracts will have an opportunity to
present a 30-minute talk on their work. We hope to encourage presentations
of work in early stages of development. A workshop post-proceedings in the
form of a book will help to document the research presented. An informal
proceedings containing all papers will be provided to all attendees.
Possible topics for talks include, but are not limited to:
* Scalable cache coherence
* Processors in memory
* Novel RAM architectures
* RAM technology issues
* Reconfigurable memory systems
* Intelligent disks
* Bus/interconnect architectures
* Network memory
* Off-chip interconnect design
* Compilation techniques
* Real-time memory compression
* Operating system memory management
* Hardware and software fault tolerance of memory systems
* Multiprocessing on a single device (chip)
* Scalable memory access using a network of workstations
* Software cache coherence
* Virtual memory systems
Keynote speaker
* 2 keynotes will be invited
Program Committee
* TBD
Submissions:
Please send your 10 page extended abstract in ps or pdf
to either of the workshop co-chairs by April 13, 2001.
David Kaeli
Northeastern University
kaeli@ece.neu.edu
Josep Torrellas
University of Illinois at Urbana-Champaign
torrellas@cs.uiuc.edu
Important Dates:
Abstracts due: April 13, 2001
Notification to authors: May 4, 2001
Final papers due: May 25, 2001
Submitted by Josep Torrellas <torrella@cs.uiuc.edu>
----------------------------------------------------------------------
The Conference on File and Storage Technologies (FAST 2002)
January 28-29, 2002
Monterey, CA USA
http://www.usenix.org/events/fast
The Call for Papers with submission guidelines and suggested
topics is now available at http://www.usenix.org/events/fast/cfp
Submissions are due July 13, 2001
=========================================
The Conference on File and Storage Technologies (FAST 2002) is sponsored by
USENIX, the Advanced Computing Systems Association, and ACM SIGOPS
=========================================
File and storage systems are critical to business and society,
holding the "crown jewels" of most Information Age organizations and
dictating the performance of most computer systems. Storage density
has increased at 100% per year for the past three years (60% per year
for the past 30 years), but this is barely enough to keep up with the
storage demands of the modern economy. Digital media and electronic
commerce stretch storage system design with problems not encountered
a few years ago.
FAST brings together the top storage systems researchers and
practitioners, providing a premier forum for discussing the design,
implementation, and uses of storage systems. It aims to bring
together the best work in file and storage systems in one venue. The
large number of file systems papers presented at all operating system
conferences shows that there is no shortage of research in this area.
FAST will be the successor to IOPADS, which for several years was the
top conference dedicated to parallel and distributed IO systems.
The conference will consist of two days of technical presentations,
including refereed papers, invited talks, and an introductory keynote
address. A session of work-in-progress presentations is planned, and
informal Birds-of-a-Feather sessions may be organized by attendees.
Refereed papers will be published in the Proceedings, provided free
to technical session attendees, and available for purchase from
USENIX.
The FAST 2002 Program Committee invites you to contribute your ideas,
proposals and papers for tutorials, invited talks program, refereed
papers track, workshops, work-in-progress reports, and symposia
tracks. We welcome submissions that address any and all issues
relating to File and Storage Systems.
The Call for Papers with submission guidelines and suggested topics
is now available at: http://www.usenix.org/events/fast/cfp/
Submissions are due July 13, 2001.
We look forward to seeing you in Monterey in January 2002!
Sincerely,
Darrell Long, Program Chair
Submitted by Tiffany Peoples <tiffany@usenix.org>
----------------------------------------------------------------------
Call For Participation
ACM Sigmetrics 2001 / Performance 2001
Jointly sponsored by ACM SIGMETRICS and IFIP WG 7.3
Cambridge, Massachusetts, USA June 16-20, 2001
The ACM SIGMETRICS 2001 / PERFORMANCE 2001 Joint International
Conference on Measurement and Modeling of Computer Systems will be
held in Cambridge, Massachusetts on June 16-20th, 2001.
The tutorials and workshops will be held on June 16 and 17
while the technical sessions will be held from June 18 to 20th, 2001.
KEYNOTE ADDRESS:
The Challenges of Delivering Content on the Internet.
Tom Leighton, Akamai.
TECHNICAL PROGRAM:
Monday, June 18th, 2001
=======================
7:45 Breakfast
8:30-8:45 Welcome
8:45-10:00 Keynote Address
10:00 - 10:30 Break
10:30 - 12:00 Session 1: Network Routing and Forwarding
"Performance modeling for fast IP lookup"
by Girija Narlikar, Francis Zane, Bell Labs
"Scheduling Computations on a Software-Based Router"
by Xiaohu Qie, Andy Bavier, Larry Peterson, Scott Karlin,
Princeton
"Dynamic multi-path routing: asymptotic approximation
and simulations"
by Xun Su, Gustavo de Veciana, UT Austin
12:00 - 13:15 Lunch
13:15 - 15:15 Session 2: System Performance
"Predictability Requirements of a Soft Modem"
by Michael B. Jones, Stefan Saroiu,
Microsoft Research, University of Washington
"Improving Dynamic Voltage Scaling Algorithms with PACE"
by Jacob R. Lorch;Alan Jay Smith, Berkeley
"Analysis and Implementation of Software Rejuvenation in Cluster
Systems"
by Kalyanaraman Vaidyanathan, Richard E. Harper,
Steven W. Hunter, Kishor S. Trivedi, Duke University, IBM
"A Time-Stamping Algorithm for Efficient Performance Estimation of
Superscalar Processors" by Gabriel H. Loh,
Yale University
15:15 - 15:45 Break
15:45 - 17:15 Session 3: Network Performance and Modeling
"Impact of Fairness on Network Stability and Performance"
by T. Bonald, L. Massoulie, France Telecom, Microsoft Research
"Hidden Markov Modeling for network communication channels"
by Mohammad R. Salamatian, Sandrine Vaton, LIP6-Universit Pierre
et Marie Curie, ENST Bretagne
"On the Nonstationarity of Internet Traffic",
by Jin Cao, William S. Cleveland, Dong Lin, Don X. Sun,
Bell Labs
Banquet
Tuesday, June 19th, 2001
========================
8:30 - 10:00 Session 4: Mobile and Wireless Networks
"Performance Comparison of Cellular and Multi-hop Wireless Networks:
A Quantitative Study", by Hung-Yun Hsieh, Raghupathy Sivakumar,
Georgia Institute of Technology
"Blocking in Large Mobile Cellular Networks with Bursty Traffic"
by Nidhi Hegde, Khosrow Sohraby, University of Missouri-Kansas
City
"Capacity Evaluation of Frequency Hopping Based Ad-hoc Systems"
by Apurva Kumar, Rajeev Gupta, IBM India Research Lab
10:00 - 10:30 Break
10:30 - 12:00 Session 5: Network Protocols and Performance Modeling
"A New Predictive Flow Control Scheme for Efficient Network
Utilization and QoS", by Dongyu Qiu, Ness B. Shroff,
Purdue University
"Model-Based Estimation of Buffer Overflow Probabilities from
Measurements"
by Ioannis Ch. Paschalidis, Spyridon Vassilaras, Boston Univ
"On Optimal Traffic Grooming in WDM Rings"
by Rudra Dutta, George N. Rouskas
North Carolina State University
12:00 - 13:00 Lunch
13:00 - 14:30 Poster Session
14:30 - 15:30 Session 6A: Network Modeling
"Some properties of variable length packet shapers"
by Jean-Yves Le Boudec, EPFL-DSC
"On the Performance of Multiplexing Independent Regulated Inputs"
by Cheng-Shang Chang, Wheyming Song, Yuh-ming Chiu
National Tsing Hua University
14:30 - 15:30 Session 6B: Memory Systems
"Characterizing the Memory Behavior of Java Workloads: A Structured
View and Opportunities for Optimizations" by Yefim Shuf,
Mauricio Serrano, Manish Gupta, Jaswinder Pal Singh,
Princeton, Intel, IBM
"A Study of Memory System Performance of Multimedia Applications"
by Sohum Sohoni, Zhiyong Xu, Rui Min, Yiming Hu,
University Of Cincinnati
15:30 - 16:00 Break
16:00 - 17:00 Session 7: TCP
"Fixed Point Approximations for TCP Behavior in an AQM Network"
by Tian Bu, Don Towsley, UMass
"Understanding TCP Vegas: A Duality Model"
by Steven Low, Larry Peterson, Limin Wang, CalTech, Princeton
17:00 - 18:00 Work in Progress
Wednesday, June 20th, 2001
==========================
8:30 - 10:00 Session 7: Web
"Controlling the Robots of Web Search Engines"
by Jerome Talim, Zhen Liu, Philippe Nain, Ed. G. Coffman Jr,
University of Saskatchewan, IBM, INRIA, Columbia University
"What TCP/IP Protocol Headers Can Tell Us About the Web"
by F. Donelson Smith, Felix Hernandez, Kevin Jeffay,
David Ott, UNC
"The Effects of Wide-Area Conditions on WWW Server Performance"
by Erich M. Nahum, Marcel Rosu, Srini Seshan, Jussara Almeida,
IBM, CMU, Univ of Wisconsin
10:00 - 10:30 Break
10:30 - 12:30 Session 8: Performance Analysis Techniques & Automation
"An M/M/1 queue in a semi-Markovian environment"
by Philippe Nain, Redusindo Nunez Queija, INRIA,
CWI
"Analysis of SRPT Scheduling: Investigating Unfairness"
by Nikhil Bansal, Mor Harchol-Balter, CMU
"Interval Parameters for Capturing Uncertainties in an EJB Performance
Model" by Johannes Luethi, Catalina M. Llado,
Universitaet der Bundeswehr Muenchen,
Imperial College of Science, Technology and Medicine
"Automation Support for Software Performance Engineering"
by Hesham El-Sayed, Don Cameron, Murray Woodside,
Nortel Networks, Carleton University
=====LIST OF POSTERS:===========
"Periodic Broadcast and Patching Services - Implementation, Measurement,
and Analysis in an Internet Streaming Video Testbed"
by Michael Bradshaw, Bing Wang, Subhabrata Sen, Jim Kurose,
Prashant Shenoy, Don Towsley, UMass
"Towards Scalable and Reliable Group Key Management"
by Yang Richard Yang, Xiaozhou Li, Xincheng Zhang, Simon S. Lam
UT Austin
"Restoration by path concatenation: fast recovery of MPLS paths"
by Yehuda Afek, Anat Bremler-Barr, Edith Cohen, Haim Kaplan,
Michael Merritt, Tel-Aviv University, AT&T Labs
"On Modelling Networks of Wireless Micro-Sensors"
by Andreas Savvides, Sung Park, Mani B. Srivastava
UCLA
"Evaluating The Performance of Non-Blocking Synchronisation on
Shared-Memory Multiprocessors"
by Philippas Tsigas, Yi Zhang, Chalmers University of Technology
"Obtaining High Performance for Storage Outsourcing"
by Wee Teck Ng, Bruce K. Hillyer, Bell Labs
"Determining the Geographic Location of Internet Hosts"
by Venkata N. Padmanabhan, Lakshminarayanan Subramanian,
Microsoft Research, UC Berkeley
"Load characterization, overload prediction and load anomaly
detection in voice over ip traffic", by Michel Mandjes,
Iraj Saniee, Sasha Stolyar, Bell Labs
"The structural cause of file size distributions" by Allen B. Downey,
Wellesley College
"Using Approximate Majorization to Characterize Protocol Fairness"
by Rishi Bhargava;Ashish Goel;Adam Meyerson,
USC, Stanford
"On Providing Useful Information for Analyzing and Tuning Applications"
by John Mellor-Crummey, Robert Fowler, David Whalley,
Rice University, Florida State University
"Alternative Techniques for the Efficient Acquisition of Haptic Data"
by Cyrus Shahabi, Mohammad Reza Kolahdouzan, Greg Barish,
Roger Zimmermann, Didi Yao, Kun Fu, Lingling Zhang
USC
"Online Prediction of the Running Time of Tasks"
by Peter A. Dinda, Northwestern University
"Analyzing Robot Behavior in E-Business Sites"
by Virgilio Almeida, Daniel Menasce, Rudolf Riedi,
Rodrigo Fonseca, Wagner Meira, Flavia Ribeiro,
Federal University of Minas Gerais, George Mason University,
Rice University
"Characterization of User Access to Streaming Media Files"
by Jussara M. Almeida, Jeffrey Krueger, Mary K. Vernon,
University of Wisconsin-Madison
"Performance modeling of elastic traffic in overload"
by Thomas Bonald, James Roberts, France Telecom
"Fast Firewall Implementations for Software-based Routers"
by Lili Qiu, George Varghese, Subhash Suri,
Cornell University, UCSD, Washington University
CONFERENCE TUTORIALS INCLUDE :
1. TCP Congestion Controls: Algorithms and Optimization Models.
Steven Low, CS Dept, California Institute of Technology.
2. Internet Traffic: Characteristics and Models.
Joachim Charzinski, Siemens Information Communication Networks
3. An Introduction to Control Theory and Its Application to Computer
Science.
Joe Hellerstein and Sujay Parekh, IBM Research.
4. Modeling and Analyzing CPU Power and Performance:
Metrics, Methods, and Abstractions.
M. Martonosi, D. Brooks (Princeton University), P. Bose (IBM
Research).
5. Performance Tradeoffs in Priority Scheduling.
Jeffrey P. Buzen, BMC Software.
6. Performance and Modeling Issues in Disk Array Systems.
Eitan Bachmat, EMC Corporation.
CONFERENCE WORKSHOPS INCLUDE:
1) Job Scheduling Strategies for Parallel Processing (JSSPP), June 16,
2001.
2) Performance and Architecture of Web Servers (PAWS), June 16,17, 2001.
3) MAthematical (performance) Modeling and Analysis (MAMA 2001), June
20-21, 2001.
The advance program, hotel and conference registration forms, workshops,
tutorials, airline discount and student travel support can be
found on the following web page:
http://www.cs.umd.edu/conference/sigmetrics2001/
Deadline for early conference registration: on or before May 18, 2001.
Deadline for hotel reservation: on or before May 26, 2001.
(Since the hotel is relatively small and quite popular,
conference attendees are advised to make their hotel
reservations as early as possible.)
General Chair: Philip Heidelberger (philiph@us.ibm.com)
Program Co-Chairs: Ernst Biersack (erbi@eurecom.fr),
Leana Golubchik (leana@cs.umd.edu)
Tutorial Chair: Mor Harchol-Balter (harchol@cs.cmu.edu)
Corporate sponsors:
AT&T Labs - Research
Intel Corporation
IBM T.J. Watson Research Center
TeleGIF (a nonprofit corporation)
Submitted by John ??? <cslui@cse.cuhk.edu.hk>
----------------------------------------------------------------------
----------------------------------
SBAC-PAD'2001 - CALL FOR PAPERS
----------------------------------
13th Symposium on Computer Architecture and
High Performance Computing
September 10th - 15th, 2001
San Marco Hotel
Brasilia-DF-Brazil
web: http://www.cptec.inpe.br/sbac2001
mail: sbac2001@cptec.inpe.br
Sponsored by
Brazilian Computer Society - SBC
in cooperation with (pending)
International Federation for Information Processing - IFIP
Organized by
Computer Science Department - UnB - Universidade de Brasilia
Center for Weather Prediction and Climate Studies - CPTEC - INPE
SCOPE
SBAC-PAD is an international annual conference,
started in 1988, devoted to new developments,
applications and trends in distributed and parallel
computing technologies. SBAC-PAD is open for faculty,
researchers, specialists and graduate students around
the world.
Authors are invited to submit unpublished research
on parallel or distributed computer systems, over
either experimental or commercial systems, encompassing
scientific and commercial applications or theoretical
foundations.
Topics of Interest (not limited to):
- Benchmarking and Measurement
- CPU Architectures
- Cache and Memory Architectures
- Cluster Computing
- Distributed Computing
- Fault Tolerant Architectures and Systems
- Grid Computing
- High Performance Applications
- IO Architectures
- Interconnection Networks
- Languages Compilers and Tools
- Models of Parallel Computation
- Operating Systems
- Parallel Algorithms
- Performance Evaluation
- Schedule and LoadBalancing
PAPER SUBMISSION
Papers, in english, should describe unpublished original
research and conform to SBAC formatting standards.
SBAC styles and sample papers for Microsoft Word and Latex
are available at the conference web page.
Paper length is limited to 8 letter pages in postscript or
PDF formats.
Papers are submitted by the web. Follow instructions
at the conference web page.
Submissions will be reviewed internationally.
Accepted papers are expected to be submitted camera-ready
in full length and to be presented at the conference.
Simultaneous submission to other conferences with published
proceedings is strongly discouraged.
Proceedings will be published by SBC.
IMPORTANT DATES
Submission of manuscripts: April 27th, 2001
Notification of Acceptance: June 15th, 2001
Camera-ready Submission: July 2nd, 2001
GENERAL CHAIR
Alba Cristina Melo Brasilia, Brazil
PROGRAM COMMITTEE
Alba C. M. A. Melo Brasilia, Brazil
Alvaro L. G. A. Coutinho Rio de Janeiro, Brazil
Bertil Folliot Paris, France
Celso L. Mendes Urbana, USA
Cesar De Rose Porto Alegre, Brazil
Claude Girault Paris, France
Claudio F. R. Geyer Porto Alegre, Brazil
Claudio L. Amorim Rio de Janeiro, Brazil
David Padua Urbana, USA
Edil S. T. Fernandes Rio de Janeiro, Brazil
Eduardo Bergamini Sao Jose dos Campos, Brazil
Frank Dehne Ottawa, Canada
Guang R. Gao Newark, USA
Hans Ulrich Heiss Paderborn, Germany
Horst Simon Berkeley, USA
Jack Dongarra Knoxville, USA
Jairo Panetta (Chair) Cachoeira Paulista, Brazil
Jean-Luc Gaudiot Los Angeles, USA
Jose Hiroki Saito Sao Carlos, Brazil
Julio Salek Aude Rio de Janeiro, Brazil
Kei Hiraki Tokyo, Japan
Liria Matsumoto Sato Sao Paulo, Brazil
Liviu Iftode Rutgers, USA
Mario Nemirovsky Santa Cruz, USA
Nader Baherzadeh Irvine, USA
Orlando Loques Niteroi, Brazil
Philippe O. A. Navaux Porto Alegre, Brazil
Rafael D. Lins Recife, Brazil
Ricardo Bianchini Rutgers, USA
Ronaldo A. Goncalves Maringa, Brazil
Sergio Bampi Porto Alegre, Brazil
Sergio Takeo Kofuji Sao Paulo, Brazil
Siang W. Song Sao Paulo, Brazil
Tiaraju A. Diverio Porto Alegre, Brazil
Valmir C. Barbosa Rio de Janeiro, Brazil
Yale Patt Austin, USA
Submitted by Jairo Panetta <panetta@cptec.inpe.br>
----------------------------------------------------------------------
Removing Yourself from SIGARCH Mailing List
If your email address exactly matches the email address
recorded on the SIGARCH list (no forwarding), you can
remove yourself with:
mail listserv@acm.org
with message body (not subject):
unsubscribe SIGARCH-MEMBERS
If your email address does *not* match, mail me at
infodir_SIGARCH@acm.org, and I will work to remove
you from the list.
----------------------------------------------------------------------
----------------------------------------------------------------------
[Other mailing list archives]
[CS Dept. Home Page]