Newsgroups: comp.parallel From: pizka@informatik.tu-muenchen.de (Markus Pizka) Subject: HICSS-32: CFP-Reminder Organization: Technische Universitaet Muenchen, Germany Date: 22 May 1998 12:48:13 GMT Message-ID: <6k3s6d$9st$1@encore.ece.cmu.edu> ----------------------------------------------------------------------- As June 1st is approaching soon, we want to remind you on the CFP and deadlines for the 32nd Hawai'i International Conference on Systems Sciences (HICSS-32). ------------------------------------------------------------------------ CALL FOR PAPERS for the "Distributed Caching and Replication" Minitrack Part of the "Software Technology" Track of the Thirty-second Annual Hawai'i International Conference on Systems Sciences (HICSS) Maui, HI - January 5 - 8, 1999 http://www.in.tum.de/~pizka/HICSS-32/ Topics of interest: =================== * operating system support for caching/replication * compiler supported caching and replication techniques * replicated servers * DSM systems (distributed shared memory) and object replication * distributed information systems (including the WWW) * client/server-caching techniques * replication control techniques * allocation techniques * combinations of caching and replication techniques * unifying frameworks of combined approaches for replication and caching * prototype implementations of combined approaches * performance measurements of combined approaches vs. single techniques * interplay between allocation and replication/caching Description: ============ In distributed systems such as information systems like the Word-Wide Web (WWW) but also distributed shared memory (DSM) systems, data is either locally available or must be hauled from remote severs, often over extremely long distances. It is the latter type of data retrieval which contributes to the shortage of precious resources such as communication bandwidth. Additionally, fetching data over long distances often results in unacceptable long response time. A key idea for solving the problem is to reduce the number of remote data retrieval operations or at least to reduce the number of data retrieval operations over excessive distances. This can be achieved in multiple ways. Two particularly interesting approaches are distributed caching and replication. By locally storing (i.e. caching) frequently retrieved data at the point of usage, communication bandwidth can be saved and response time shortened. Depending on the user behavior or on the user application, different cache consistency strategies can be adopted leading to a more or less optimal cache exploitation. Distributed caching as described works "from the user's point of view." In contrast, one can also cache data "from the data provider's point of view." Here, the provider or synonymously: the owner of the data caches copies at multiple places, preferably close to the intended users. Caching from the data provider's point of view is known as replication. The management of replicas (i.e. cached copies) at the servers is solely controlled by the data provider. Since the provider can be assumed as being best informed about the nature of data, management control protocols such as allocation and consistency control schemes can be optimized on a per data item basis. Although the above discussion indicates that distributed caching and replication can in fact be used independently in an efficient manner, the question arises whether one can do better if the two techniques are combined. Questions of how caching and replication can support each other, how they restrict the use of certain consistency and allocation control schemes, and how a particular combination performs under which conditions, are only a few important question which arise in this context. The aim of the interdisciplinary minitrack "Distributed Caching and Replication" is to bring together researchers with database, operating systems, compiler, and hardware/software distributed shared memory system backgrounds currently working on bridging the gap between distributed caching and replication. Particular attention will be given to unifying frameworks, operating system support, compiler support and prototype implementations as well as performance evaluations of "combined" approaches compared to approaches solely relying upon either distributed caching or replication. Deadlines: ========== June 1 , 1998: Full papers submitted to minitrack chairs Aug. 31, 1998: Notification of accepted papers mailed to authors Oct. 1 , 1998: Accepted manuscripts, camera-ready, sent to minitrack chairs; author(s) must register by this time. Nov. 15, 1998: All other registrations must be received. Registrations received after this deadline may not be accepted due to space limitations. Minitrack Chairs: ================= * Markus Pizka Technische Universitaet Muenchen Department of Computer Science Germany - 80290 Munich Phone/Fax: +49 +89 - 289 {28197/22037} email: pizka@in.tum.de * Oliver Theel Darmstadt University of Technology Department of Computer Science Alexanderstrasse 10 Germany - 64283 Darmstadt Phone/Fax: +49 +6151 - 16 {5306/5410} email: Theel@Informatik.TU-Darmstadt.De ---------------------------------------------------------------------- HICSS-32 consists of eight tracks: Collaboration Systems and Technology Track Digital Documents Track Emerging Technologies Track Health Care Track Internet and the Digital Economy Modeling Technologies and Intelligent Systems Organizational Systems and Technology Track Software Technology Track For more information about these tracks and a list of minitracks each consist of, please check the HICSS web page http://www.cba.hawaii.edu/hicss ---------------------------------------------------------------------- -- ***************************************** Markus Pizka Tel/FAX: +49 +89 - 289 - {28197 / 22037} EMail : pizka@in.tum.de WWW : http://www.in.tum.de/~pizka smail : Technische Universitaet Muenchen Institut fuer Informatik - G2 80290 Munich (Germany) visit : Barerstrasse 38/40, Room G207 ***************************************** -- Articles to bigrigg+parallel@cs.cmu.edu (Admin: bigrigg@cs.cmu.edu) Archive: http://www.hensa.ac.uk/parallel/internet/usenet/comp.parallel