{"title":"Optimal within a constant schedules for forest dags on parallel architectures","authors":"K. Kalpakis, Y. Yesha","doi":"10.1109/APADS.1993.588930","DOIUrl":"https://doi.org/10.1109/APADS.1993.588930","url":null,"abstract":"The authors provide optimal within a constant explicit upper bounds on the makespan of schedules for bounded degree forest structured programs on mesh arrays of processors with links of unit bandwidth and arbitrary positive integer propagation delay, and provide polynomial time algorithms to find schedules with makespan matching these bounds. Thus, The authors provide the first polynomial time approximation algorithm for this NP-hard problem, with performance ratio that is a constant. Programs with forest structure arise often in important classes of algorithms. The mesh array architecture is widely used for actual parallel computers. Further, the authors provide polynomial time computable schedules for forest structured programs on a wide class of parallel architectures. They also show how to schedule, in polynomial time, a complete binary tree structured program on a linear array with optimal within a factor of 1 + o(1) makespan.","PeriodicalId":164521,"journal":{"name":"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125554216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Critical issues in the design of large-scale distributed systems","authors":"S. Howell, N.-D. Hoang, C. Nguyen, N. Karangelen","doi":"10.1109/APADS.1993.588738","DOIUrl":"https://doi.org/10.1109/APADS.1993.588738","url":null,"abstract":"The requirements for the design of large-scale, complex, software-intensive applications include real-time, time-critical, performance, dependability, security, and financial limitations. These requirements have put dramatic burdens on the systems engineers in designing these applications. In order to eliminate the system engineering shortcomings, technology must be developed to: (1) provide a rigorous means for systems engineers to identify and specify the necessary information for the design, (2) provide annotation capabilities for the system design to capture design goals/criteria that relate to the requirements and Measures of Effectiveness (MOEs), and (3) provide mechanisms to optimize the design given the design goals. A framework is described here which provides this ability to assess and optimize system designs and their implementations.","PeriodicalId":164521,"journal":{"name":"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117070993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Recovery in distributed mobile environments","authors":"P. Krishna, N. Vaidya, D. Pradhan","doi":"10.1109/APADS.1993.588798","DOIUrl":"https://doi.org/10.1109/APADS.1993.588798","url":null,"abstract":"Mobile computing is a rapidly emerging trend in distributed computing. The new mobile computing environment presents many challenges due to the mobile nature of the hosts. The authors present some fault-tolerant data management strategies for a distributed mobile environment. These strategies need to be different from the traditional fault-tolerance approaches because of the resource limitations of mobile computing environment.","PeriodicalId":164521,"journal":{"name":"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123979188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Caching location data in mobile networking","authors":"S.F. Wu, C. Perkins, P. Bhagwat","doi":"10.1109/APADS.1993.588785","DOIUrl":"https://doi.org/10.1109/APADS.1993.588785","url":null,"abstract":"Each Location Directory (LD) provides the information to locate the forwarding address of a Mobile Host (MH) in a mobile networking system. The LD should be updated when the MH moves from one access zone to another access zone. If an Internet Access Point (IAP) (or base station) could cache some useful LD information entries, then, after receiving a packet from an MH in its access zone, the IAP could check its cached LD and make an optimal routing decision. With the LD distributed over the Internet Access Points, the authors avoid Dogleg Routing because they no longer need to forward the packet to the Mobile Router (MR) where a master copy of the LD is located. The authors investigate how the LD data structure is used, updated, and distributed among Mobile Routers, Internet Access Points and Mobile Hosts. Furthermore, they present the LD design and implementation in the mobile IP network.","PeriodicalId":164521,"journal":{"name":"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123514412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Adaptive fault tolerance","authors":"J. Goldberg, I. Greenberg, T. Lawrence","doi":"10.1109/APADS.1993.588861","DOIUrl":"https://doi.org/10.1109/APADS.1993.588861","url":null,"abstract":"The goal of adaptive fault tolerance (AFT) is to expand the envelope of dependable system operation in distributed, real-time systems. Such systems often experience substantial run-time changes in the types and distributions of faults, in the availability of resources, in data distribution, and in users' requirements for dependability and performance. Preliminary examples, such as Adaptable Distributed Recovery Blocks (Kim) and distributed crash recovery, illustrate how adaptive fault tolerance can provide useful tradeoffs among service properties such as error-recovery latency, throughput, and precision, over a wide range of operating conditions. A general methodology for AFT system design must address issues of (1) rapid, incremental diagnosis/estimation of environmental and internal state, (2) safe and effective control, and (3) efficient, parametric or multimode fault-tolerant implementations. A major challenge is to achieve the additional flexibility without excessive complexity, both for performance and reliability concerns. Reflective architecture, a form of meta-design, is an attractive framework for AFT system design and for adaptive systems in general. It provides for the monitoring and redefinition of system behavior in a hierarchical manner that may be integrated with conventional \"uses-based hierarchical design.","PeriodicalId":164521,"journal":{"name":"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125776045","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Join query optimization in parallel database systems","authors":"A. Jhingran, S. Padmanabhan, A. Shatdal","doi":"10.1109/APADS.1993.588851","DOIUrl":"https://doi.org/10.1109/APADS.1993.588851","url":null,"abstract":"The authors present a new framework for studying query optimization. They first note that scheduling and optimization must go together in a parallel environment. They introduce the concept of response time envelopes which integrates scheduling and optimization. It is shown that it can be used effectively to develop parallel query optimization algorithms which have same order of complexity as the traditional sequential query optimization algorithms and produce provably optimal or near optimal join plans.","PeriodicalId":164521,"journal":{"name":"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121673997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A hierarchical asynchronous replication protocol for large scale systems","authors":"N. Adly, M. Nagi, J. Bacon","doi":"10.1109/APADS.1993.588929","DOIUrl":"https://doi.org/10.1109/APADS.1993.588929","url":null,"abstract":"The authors present a new asynchronous replication protocol that is especially suitable for wide area and mobile systems, and allows reads and writes to occur at any replica. Updates reach other replicas using a propagation scheme based on nodes organized into a logical hierarchy. The hierarchical structure enables the scheme to scale well for thousands of replicas, while ensuring reliable delivery. A new service interface is proposed that provides different levels of asynchrony, allowing strong consistency and weak consistency to be integrated into the same framework. Further, the scheme provides the ability to offer different levels of staleness, depending upon the needs of various applications, by querying from different levels of the hierarchy. Also, it allows a selection from a number of reconciliation techniques based on delivery order mechanisms. Restructuring operations are provided to build and reconfigure the hierarchy dynamically without disturbing normal operation. The scheme tolerates transmission failures, node failures and network partitions.","PeriodicalId":164521,"journal":{"name":"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125276744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"WANCE: A wide area network communication emulation system","authors":"Yongguang Zhang, Bharat Bhargava","doi":"10.1109/APADS.1993.588744","DOIUrl":"https://doi.org/10.1109/APADS.1993.588744","url":null,"abstract":"Experimentation in wide area computer networks such as the Internet is difficult. One difficulty is the lack of experimental hosts for individual researches or research groups. The authors have developed a new approach to overcome this problem. The approach is to emulate a remote site using one local machine, and to emulate a true Internet communication environment in a local area network, by rotating the inter-site communication through actual Internet hosts. This approach provides a way to conduct experiments with large scale geographically dispersed distributed systems without any designated experimental sites except for the local ones. The authors have studied this approach and observed that it is feasible and reliable. They have realized this approach in a communication package called the WANCE tool, which can be used to experiment distributed software in this new approach. They have also evaluated this approach by comparing it with real experiments, using a distributed database application. The relative errors they measured are within 3%.","PeriodicalId":164521,"journal":{"name":"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129771293","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Data reorganization in parallel database systems","authors":"C. Baru, D. Zilio","doi":"10.1109/APADS.1993.588822","DOIUrl":"https://doi.org/10.1109/APADS.1993.588822","url":null,"abstract":"Parallel database systems are suitable for use in applications with high capacity and high performance and availability requirements. The trend in such systems is to provide efficient online capability for performing various system administration functions such as, index creation and maintenance, backup/restore, reorganization, and gathering of statistics. For some of these functions the online capability can be efficiently supported by the use of incremental algorithms, i.e., algorithms that achieve the function in several, relatively small (i.e., less time-consuming) steps, rather than in a single, large step. Incremental algorithms ensure that only small parts of the database become inaccessible for short durations as opposed to nonincremental algorithms which may lock large portions of the database or the entire database for a longer duration. The authors discuss issues in providing concurrent data reorganization capability using incremental algorithms in parallel database systems.","PeriodicalId":164521,"journal":{"name":"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116238490","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On benchmarking the ORACLE parallel server on nCUBE2","authors":"S. Costicoglou, M. Podgorny, Abhishek Choudhary","doi":"10.1109/APADS.1993.588842","DOIUrl":"https://doi.org/10.1109/APADS.1993.588842","url":null,"abstract":"Massively Parallel Processor (MPP) architectures have been proposed as a promising alternative to mainframe computers for the largest database and transaction processing tasks. An example of this trend is the implementation of ORACLE parallel database server on several massively parallel machines like Meiko, nCUBE2, and KSR. While many claims have been made for the performance of ORACLE on MPP platforms, few studies have been done to test the actual performance advantages and disadvantages. A benchmark study of the performance and scalability of the ORACLE Parallel Server v6.2 on nCUBE2 is reported here. The advantages of the stripe file system and the gigacache are also studied and displayed in the benchmark results.","PeriodicalId":164521,"journal":{"name":"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126148674","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}