This is the August 2002 Digest of SIGARCH Messages (sigarch-aug02): * International Symposium on Low Power Electronic and Design (ISPLED'02) Advance Program http://www.ee.ucla.edu/~islped/ Submitted by Mary Jane Irwin <mji@cse.psu.edu> * DynamoRIO dynamic code modification system announcement http://cag.lcs.mit.edu/dynamorio Submitted by Saman Amarasinghe <saman@ceylon.lcs.mit.edu> * Minority students in CSE conference support available http://www.npaci.edu/Outreach/CDC/conf.app Submitted by Pat Teller <pteller@cs.utep.edu> * Passing of a giant in computer architecture (John Cocke) http://www.interesting-people.org/archives/interesting-people/ Submitted by Dave Farber <dave@farber.net> * ASPLOS-X call for participation http://www.cs.wisc.edu/asplos-X/ Submitted by Luiz Barroso <luiz@google.com> * ACM Symposium on Applied Computing-SAC 2003 Special Track on Parallel and Distributed Systems and Networking http://www.cslab.ece.ntua.gr/sac03-pdsn Submitted by Nectarios G. Koziris <nkoziris@cslab.ece.ntua.gr> * Call For Participation, IFIP WG7.3 Int'l Symp. on Computer Performance Modeling, Measurement and Evaluation http://perf2002.uniroma2.it/ Submitted by John C.S. Lui <cslui@cse.cuhk.edu.hk> --Doug Burger SIGARCH Information Director infodir_SIGARCH@acm.org * Archive: http://www.cs.wisc.edu/~lists/archive/sigarch-members/maillist.html * Web pages: http://www.cs.wisc.edu/~arch/www/, http://www.acm.org/sigarch/ * To remove yourself from the SIGARCH mailing list: mail listserv@acm.org with message body: unsubscribe SIGARCH-MEMBERS ----------------------------------------------------------------- Doug Burger Office: 3.432 ACES Assistant Professor Phone: 512-471-9795 Department of Computer Sciences Assistant: 512-471-9442 University of Texas at Austin Fax: 512-232-1413 Taylor Hall 2.124 E-mail: dburger@cs.utexas.edu Austin, TX 78712-1188 USA www.cs.utexas.edu/users/dburger ----------------------------------------------------------------- * DynamoRIO dynamic code modification system announcement The binary release of the DynamoRIO dynamic code modification system by Hewlett-Packard and MIT. In the new world of software, which heavily utilizes dynamic class loading, dynamically linked libraries, and interconnected components, the power and reach of static analysis is diminishing. An exciting new paradigm of dynamic program optimization -- improving the performance of a program while it is being executed -- is emerging. However, research in this area is difficult due to lack of tools, especially tools that are able to handle real applications in their entirety. A collaboration between HP Labs and MIT has produced DynamoRIO, a dynamic code modification system for the IA-32 platform. The DynamoRIO system is meant to be an infrastructure for not only dynamic optimization but other applications such as program introspection and security. DynamoRIO can be used to build tools ranging from simple profilers that instrument the code stream to gather statistics to full-fledged dynamic optimization passes. DynamoRIO operates on unmodified native binaries and requires no special hardware or operating system support. It is implemented for both IA-32 Windows and Linux, and is capable of running large desktop applications, such as Microsoft Office and Adobe photoshop. HP and MIT are offering a free release of DynamoRIO for non-commercial use. The release includes the DynamoRIO binaries and an interface for building custom dynamic code modifiers. The interface supports applications such as dynamic instrumentation and optimization, with a powerful API for manipulating IA-32 instructions. The release is available from: <http://cag.lcs.mit.edu/dynamorio> http://cag.lcs.mit.edu/dynamorio References: [1] V. Bala, E. Duesterwald, and S. Banerjia. Dynamo: A transparent runtime optimization system. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'00), June 2000. [2] Derek Bruening, Evelyn Duesterwald, and Saman Amarasinghe. Design and Implementation of a Dynamic Optimization Framework for Windows. 4th ACM Workshop on Feedback-Directed and Dynamic Optimization (FDDO-4), December 1, 2001, Austin, Texas. [3] Vladimir Kiriansky, Derek Bruening, Saman Amarasinghe. Secure Execution Via Program Shepherding. 11th USENIX Security Symposium, August 2002, San Francisco, California. ---------------------------------------------------------------------- ---------------------------------------------------------------------- * Minority students in CSE conference support available APPLICATIONS NOW BEING ACCEPTED FOR CONFERENCE SUPPORT FOR MINORITY STUDENTS IN CSE _______________________________________________ COALITION TO DIVERSIFY COMPUTING INVITES INTERESTED STUDENTS AND MENTORS TO APPLY ________________________________________ Attending a professional conference is both exciting and challenging for students: Which sessions do you attend? Whom should you get to know? Do you submit a poster, or a paper? Do you sign up to be a student volunteer? To help students break through the ice and learn to enjoy conferences, the Coalition to Diversify Computing (http://www.npaci.edu/Outreach/CDC/) is offering support for minority students to attend technical conferences with their mentors. Students and mentors will attend a professional conference as a team, providing the opportunity for the students to benefit from introductions to key researchers at the conference while they gain insight from their mentors into the dynamics of a professional event. Each team will consist of at least one student (up to three students may apply) and one mentor; up to $1,000 is available to support each student. When eligible, the mentor can receive up to $1,000 in support. According to Pat Teller, University of Texas, El Paso, the coordinator of this CDC project, "Attending a professional conference is a critical step in a student's academic career. It exposes them to the process of preparing and presenting a talk to colleagues, and enlightens them about the networking possibilities at such events. Students always come away much more prepared to submit a poster or paper of their own after having spent time with a mentor at a conference, showing them the ins and outs of this aspect of our professional lives." Applications will be accepted twice this year for review: Deadlines are September 1, 2002, and March 1, 2003. Applications, which are available at http://www.npaci.edu/Outreach/CDC/conf.app, must be complete for both the student(s) and their mentor before the application will be reviewed. (The related home page is at http://www.npaci.edu/Outreach/CDC/conf-support/.) The student application requires information on the student's field of study, academic career goals, and academic standing, in addition to information about the conference and how the student expects to benefit from attending. Students will be selected based on their achievements and application. Students will be required to write a report on their experiences at the conference and suggested recommendations for improving the program. Mentor applications require information on the professor's willingness to mentor the student and his/her own perspective on the value of the conference. The CDC focuses its efforts on programs that increase the visibility of minorities, and on providing networking opportunities for minority researchers, faculty, and students. Projects include a CDC Web site (http://www.npaci.edu/Outreach/CDC/), the Richard Tapia Celebration of Diversity in Computing conference, a database of contacts who have an interest in helping minorities pursue research careers, opportunities for conference participation, and a publication that highlights best practices in recruiting and retaining minority students. The Coalition to Diversify Computing is a joint committee of the Association of Computing Machinery (ACM), the Computing Research Association (CRA), and the Institute of Electrical and Electronic Engineering (IEEE) Computer Society. Currently, CDC projects are sponsored by the NSF's Education, Outreach, and Training Partnership for Advanced Computational Infrastructure (EOT-PACI) program, CRA, and ACM. For more information on CDC, see http://www.npaci.edu/Outreach/CDC. --------------------------------------------------------------------- Patricia J. Teller Phone: 915 747 5939 Associate Professor Fax : 915 747 5030 Assistant Dean, Graduate Studies, pteller@cs.utep.edu College of Engineering The University of Texas at El Paso Department of Computer Science El Paso, TX 79968-0518 ---------------------------------------------------------------------- ---------------------------------------------------------------------- * Passing of a giant in computer architecture (John Cocke) Note: message originally sent on July 17th. John Cocke died yesterday afternoon after being in the hospital for several weeks and seeming to be on the mend. Those of us who knew John will deeply miss him. He was influential in so many areas of computer science. I first met him when I visiting IBM to talk with the Stretch design team. At that time, the architecture group was housed in a vault at IBM (converted). Not that it was classified but that that was the only free space available. To get to them you rang a bell and the door then was opened. Anyway, John was so broad that almost anything you wanted to discuss he was happy to be an expert at .. from skiing to the Fortran compiler to floating point arithmetic to good food to risc architectures to how telephone systems should have been built -- all accompanied in those old days by the chewed cigarette butts -- the mark John had been there (as well as the burn marks in our couch in California). I especially remember stories (I saw the desk draws) about the un cashed paychecks and un-vouched expenses that drove IBM up the wall. We will all miss John, a giant has left us and will be missed. The brief bio from the Franklin Award given to John: John Cocke earned a Bachelor of Science in mechanical engineering in 1946 and a Ph.D. in mathematics in 1953 - both from Duke University. Dr. John Cocke was with the IBM Research Division from 1956 to 1992. During that time he also served as a visiting professor for a year at MIT and for two years at NYU's Courant Institute of Mathematical Sciences. He has written 21 journal papers, and holds 22 patents. Honors and awards received: From IBM in 1979: the Corporate Outstanding Award for the system architecture concepts of the 801 Minicomputer System - the first RISC machine; from IBM in 1990: the John E. Bertram Award for Sustained Excellence. He is a member of the National Academy of Engineering and the National Academy of Sciences, and a fellow of the American Academy of Arts and Sciences. His many awards include the Turing Award from the Association for Computing Machinery (ACM), the Pioneer Award from the Computer Society of the Institute of Electrical and Electronics Engineers (IEEE). In 1991, he received a National Medal of Technology, and in 1994 he was awarded a National Medal of Science. Now therefore, for invention, development, and implementation of Reduced Instruction Set Computer architecture and program optimization technology, THE FRANKLIN INSTITUTE AWARDS its CERTIFICATE OF MERIT to JOHN COCKE. The citation for the Turing award: For significant contributions in the design and theory of compilers, the architecture of large systems and the development of reduced instruction set computers (RISC); for discovering and systematizing many fundamental transformations now used in optimizing compilers including reduction of operator strength, elimination of common subexpressions, register allocation, constant propagation, and dead code elimination. For archives see: http://www.interesting-people.org/archives/interesting-people/ ---------------------------------------------------------------------- ---------------------------------------------------------------------- * ASPLOS-X call for participation The ASPLOS-X Advanced Program and online registration are now available at: http://www.cs.wisc.edu/asplos-X/ ASPLOS-X takes place Oct. 5-9, 2002, at the Fairmont Hotel, San Jose, CA. The deadline for early registration is September 7. Submission deadlines for the ASPLOS-X Workshops are just around the corner: . Workshop on Evaluating and Architecting System dependabilitY (EASY-02) * DEADLINE: August 9 Information: http://www.crhc.uiuc.edu/EASY/ . Workshop on Modeling, Analysis and Middleware Support for Electronic Textiles (MAMSET) * DEADLINE: August 12 Information: http://www.ece.cmu.edu/~dianam/mamset02/ At the conference web site you can also register for the ASPLOS-X tutorials: . Designing and Evaluating Dependable Systems (adjunct to EASY-02) Information: http://www.crhc.uiuc.edu/EASY/tutorial.html . On The Run -- Building Dynamic Program Modifiers for Optimization, Introspection and Security Information: http://www.cs.wisc.edu/asplos-X/on_the_run.htm or submit your entry to the Wild and Crazy Idea Session III: http://www.cs.wisc.edu/asplos-X/wildNcrazy/wild-and-crazy-2002.html ---------------------------------------------------------------------- --------------------------------------------------------------------- * ACM Symposium on Applied Computing-SAC 2003 Special Track on Parallel and Distributed Systems and Networking Melbourne, Florida, USA March 9-12, 2003 http://www.cslab.ece.ntua.gr/sac03-pdsn CALL FOR PAPERS A special track on Parallel and Distributed Systems and Networking will = be held in SAC2003. This track aims to be a forum for scientists, engineers and = practitioners in academia, industry and research institutes to share technical ideas, experiences = and results and to present their latest findings in any aspects of Parallel and Distributed = Computing and Networking. The Track will emphasize the design, architecture and software of = parallel, distributed and networking systems with their scientific and engineering applications. Authors are invited to submit original manuscripts that demonstrate = current research in all areas of parallel, distributed and networking systems. The track solicits novel papers on a = broad range of topics, including but not limited to: * Parallel and Distributed Architectures * Parallel and Distributed Algorithms * Compilers, Programming Languages and Tools for Parallel Computing = Systems * Load Sharing and Balancing * Task Mapping and Job Scheduling * Resource Allocation and Management * Applications for Clusters and Grids - Grid Computing * Architecture and Operating system support for Parallel Systems * Communication Protocols, Networking and Interconnect Technologies * Supercomputing Applications * Scalable Servers * Internet and WWW-based Computing * Network-based and Cluster Computing Network Server Architectures * Reliability and Fault-Tolerance * Performance Analysis * High-Speed Networking Architectures and Protocols * Routing * Quality of Service (QoS) * Network Modeling * Traffic Engineering and Characterization * Congestion and/or Flow Control * High-performance Transport Protocols * Network Management * Hierarchical Networks Original papers from the above-mentioned or other related areas will be = considered. This includes three categories of submissions: 1) original and = unpublished research; 2) reports of innovative computing applications in the arts, sciences, = engineering, business, government, education and industry; and 3) reports of successful = technology transfer to new problem domains. Each submitted paper will be fully refereed and undergo a blind review = process by at least three referees. Accepted papers in all categories will be published in the ACM SAC'03 = proceedings. Submit your paper electronically to www.cslab.ece.ntua.gr/sac03-pdsn in = PDF or postscript (see the track web page for details). The author(s) name(s) and = address(es) must not appear in the body of the paper, and self-reference should be in the third person. = This is to facilitate blind review. Because the review process is blind, authors' names and affiliations = should appear only on the electronic submission form. The final version (camera-ready) of the accepted papers = should be submitted in PDF format so that they can be included in the proceedings as well as in the ACM = Digital Library. Important Dates Paper Due: September 6, 2002 Author Notification: October 18, 2002 Camera-Ready Paper Due: November 8, 2002 Track Program Chairs Robert van Engelen, Florida State University, USA Turgay Korkmaz, The University of Texas at San Antonio, USA Nectarios Koziris, National Technical University of Athens, Greece Kleanthis Psarris, The University of Texas at San Antonio, USA ---------------------------------------------------------------------- --------------------------------------------------------------------- * Call For Participation, IFIP WG7.3 Int'l Symp. on Computer Performance Modeling, Measurement and Evaluation Call For Participation IFIP WG7.3 International Symposium on Computer Performance Modeling, Measurement and Evaluation Rome, Italy September 23 - 27, 2002 The IFIP WG7.3 International Symposium on Computer Performance Modeling, Measurement and Evaluation will be held in Rome, Italy on September 23-27, 2002. The tutorials will be held on Sept 23 and 24, 2002. The advance program, hotel and conference registration forms, tutorials, STUDENT TRAVEL SUPPORT can be found on the following web page: http://perf2002.uniroma2.it/ **********Student Travel Grant: ************ A number of student grants will be available. The grants will cover the registration fees of the conference and of the tutorials. Full time students can apply for a grant by sending an application, in Postscript or PDF format, to grants@perf2002.uniroma2.it no later than July 15, 2002. Applications, not exceeding 3 pages, should include a cv and a brief description of the research interests of the applicants. *********************************************************************** Deadline for early conference registration: on or before July 25, 2002 Hotel reservation: on or before July 30, 2002. PLEASE MAKE SURE TO MAKE YOUR HOTEL RESERVATIONS AS SOON AS POSSIBLE. SEPTEMBER IS A VERY VERY HIGH SEASON AND IT MIGHT BE VERY DIFFICULT TO FIND AN ACCOMMODATION AT THE LAST MINUTE!!!!!!!!! *********************************************************************** Papers for the Technical Program: Output Models of MAP/PH/1(/K) Queues for an Efficient Network Decomposition Armin Heindl, Miklos Telek Second Order Stochastic Fluid Models with Fluid Dependent Flow Rates Dongyan Chen, Yiguang Hong, Kishor S. Trivedi Solving Dimensioning Tasks for Proportionally Fair Networks Carrying Elastic Traffic Pal Nilsson, Michal Pioro Non-Cooperative Routing in Loss Networks Eitan Altman, Rachid El Azouzi, Vyacheslav Abramov Service Differentiation for Delay-Sensitive Applications: An Optimisation-Based Approach Peter Key, Larent Massoulie, Jonathan K. Shapiro Forwarders vs. Centralized Server: An Evaluation of Two Approaches for Locating Mobile Agents Sara Alouf, Fabrice Huet, Philippe Nain User-level performance of elastic traffic in integrated-services networks S.C. Borst, R. Nunez-Queija, M.J.G. van Uitert Analysis of Two Competing TCP/IP Connections E. Altman, T. Jimenez, R. Nunez-Queija Asymptotic Convergence of Scheduling Policies with respect to Slowdown Mor Harchol-Balter, Karl Sigman, Adam Wierman Insensitivity in processor-sharing networks T. Bonald, A. Proutiere Worst Case Burstiness Increase due to FIFO Vicent Cholvi, Juan Echague, Jean-Yves Le Boudec An Iterative Bounding Method for Stochastic Automata Networks Peter Buchholz A Closed Form Formula for Long-Lived TCP Connections Throughput Augustin Chaintreau, Danny De Vleeschauwer The Combined Gated-Exhaustive Vacation System in Discrete-time Dieter Fiems, Stijn De Vuyst, Herwig Bruneel A MAP-based Poisson cluster model for Web traffic Guy Latouche, Marie-Ange Remiche Open-loop Video Distribution with Support of VCR Functionality Ernst W. Biersack, Alain Jean-Marie, Philippe Nain A Case Study of Web Server Benchmarking Using Parallel WAN Emulation R. Simmonds, C. Williamson, M. Arlitt, R. Bradford, B. Unger Multi-path Continuous Media Streaming: What are the Benefits? L. Golubchik, J.C.S. Lui, T.F. Tung, A.H.H. Chow, W.J. Lee, G. Franceschinis, C. Anglano A mean-field model for multiple TCP connections through a buffer Francois Baccelli, David McDonald, Julien Reynier Continuous-time Hidden Markov Models for Network Performance Evaluation Wei Wei, Bing Wang, Donald Towsley Capturing the spatio-temporal behavior of real traffic data Mengzhi Wang, Anastassia Ailamaki, Christos Faloutsos Direct Measurement Versus Indirect Inference for Determining Network Internal Delays Kostas G. Anagnostakis, Michael B. Greenwald A Comparative Performance Analysis of Reliable Group Rekey Transport Protocols for Secure Multicast Sanjeev Setia, Sencun Zhu, Sushil Jajodia Comparison of Inter-Area Rekeying Algorithms Chun Zhang, Brian Decleene, Jim Kurose, Don Towsley Shared Cache Architecture for Decision Support Systems Michel Dubois, Jaeheon Jeong, Ashwini Nanda Response Times in a Two-Node Queueing Network with Feedback R.D. van der Mei, B.M.M. Gijsen, N. in `t Veld, J.L. van den Berg G-Networks with Resets Erol Gelenbe, Jean-Michel Fourneau Asymptotic shape of the Erlang capacity region of a multi-service shared resource John A. Morrison, Debasis Mitra Calculating Mean Throughputs in a multi-service system supporting Elastic and Rate Adaptive Traffic Sandor Racz, Balazs Peter Gero, Gabor Fodor Delimiting the Range of Effectiveness of Scalable On-Demand Streaming Haonan Tan, Derek Eager, Mary Vernon ****************************************************************************** Tutorials : please refer to http://perf2002.uniroma2.it/tutorials_program.html ****************************************************************************** General Chair: Salvatore Tucci, University of Roma "Tor Vergata" (tucci@torvergata.it) Pogram Chairs: Lorenzo Donatiello, University of Bologna (donat@cs.unibo.it) Mark Squillante, IBM Research Lab (mss@watson.ibm.com) Don Towsley, University of Massachusetts (towsley@cs.umass.edu) Tutorial Chair: Maria Carla Calzarossa, University of Pavia (mcc@alice.unipv.it) Corporate sponsors: * Wind * Microsoft Italia * IBM Italia * Banca di Roma * Nova Systems Roma * Promozione Castelli Romani * Bnl Multiservizi * Universit degli Studi di Roma ''Tor Vergata'' * Associazione Italiana per l'Informatica ed il Calcolo Automatico