{"title":"Representing transitive relationships with parallel node sets","authors":"E. Lee, J. Geller","doi":"10.1109/APADS.1993.588919","DOIUrl":"https://doi.org/10.1109/APADS.1993.588919","url":null,"abstract":"The authors describe a massively parallel representation of the closure of a transitive relationships, based on a parallelly maintained node set. The link insert operation for this representation is discussed. The main step of such an insert operation is shown, and difficulties due to so called jumping arcs are explained and attacked. Specifically, it is established that candidates for jumping arcs are contained implicitly in the parallel node set representation.","PeriodicalId":164521,"journal":{"name":"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems","volume":"79 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131540469","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":"PolySchmues: An integrated framework for distributed multimedia applications","authors":"K. Lakshman, R. Yavatkar","doi":"10.1109/APADS.1993.588773","DOIUrl":"https://doi.org/10.1109/APADS.1993.588773","url":null,"abstract":"Availability of high-speed networks and increasingly powerful workstations has spawned new opportunities for research in distributed systems. Distributed collaborative systems using multiple media exploit high-speed, high-bandwidth communication capabilities to allow cooperative work across a wide area network. Realization of such systems requires resolution of several research problems including design of transport and session layer protocols, specification and modeling of requirements for correct orchestration of composite multimedia objects, design of OF scheduling algorithms, and providing appropriate programming abstractions.","PeriodicalId":164521,"journal":{"name":"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems","volume":"55 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":"125327815","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":"PVM communication performance in a switched FDDI heterogeneous distributed computing environment","authors":"M. Lewis, R. Cline","doi":"10.1109/APADS.1993.588726","DOIUrl":"https://doi.org/10.1109/APADS.1993.588726","url":null,"abstract":"The Parallel Virtual Machine (PVM) message passing system developed at Oak Ridge National Laboratories has gained widespread acceptance and usage in the parallel programming community. The authors describe the results of performance tests of PVM in a switched FDDI heterogeneous distributed computing environment. They aim to provide insight into how parallel programs, particularly those employing PVM for intertask communication, will perform in distributed systems of the future.","PeriodicalId":164521,"journal":{"name":"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems","volume":"153 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":"134120647","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":"Implementing synchronous network model on a FIP network","authors":"R. Prasad, G. Noubir","doi":"10.1109/APADS.1993.588733","DOIUrl":"https://doi.org/10.1109/APADS.1993.588733","url":null,"abstract":"The authors show why the synchronous network model is well-suited for periodic real-time systems and address problems that arise when the synchronous model is implemented on a real-time network. It is thus an attempt which aims at applying well-known concepts of distributed systems to real-time systems. The synchronous network model is extensively used in distributed systems for developing distributed algorithms. The model considered here takes real-time constraints into account. The real-time network considered is similar to Factory Instrumentation Protocol (FIP). FIP is a French national standard for industrial local area networks and it is employed in process control, factory automation and manufacturing applications.","PeriodicalId":164521,"journal":{"name":"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems","volume":"101 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":"121108779","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":"Resource and service trading in a heterogeneous large distributed system","authors":"Y. Ni, A. Goscinski","doi":"10.1109/APADS.1993.588718","DOIUrl":"https://doi.org/10.1109/APADS.1993.588718","url":null,"abstract":"The authors describe a new class of name and resource management facility - a trading service - which allows users of a heterogeneous large distributed system to share resources and services (resources) which are not available in their local systems. A distributed implementation of a trading service which provides name and location transparency to users is presented. This trading service is based on both attribute names and mutual cooperation of a number of independent trading servers (traders). The authors demonstrate that resource sharing among heterogeneous local systems can be achieved by introducing the concepts of export and import of resources to/from different local systems, and that a trading service based on attribute names can easily deal with name heterogeneity problems resulting from the different name schemes used by underlying local operating systems.","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":"115238151","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":"Robust coordination in distributed multi-server systems","authors":"I. Yen, F. Bastani","doi":"10.1109/APADS.1993.588870","DOIUrl":"https://doi.org/10.1109/APADS.1993.588870","url":null,"abstract":"One way of substantially improving the reliability and performance of parallel and distributed applications is to replicate a server over multiple machines. Examples of multiple server systems include operating system support for parallel machines, distributed database systems, and multi-agent robotic and manufacturing systems. Coordination is required for parallel access to shared resources such as data structures, communication network, and physical space. Coordination is also required to ensure adequate speed-up when multiple servers are harnessed to work on different portions of the same task. The authors present two coordination algorithms for task distribution among identical servers, namely, a ticket-based algorithm and a toroidal graph algorithm. These two algorithms are highly robust and efficient. They allow uniform task distribution over working servers even in the presence of up to N - 1 server failures, where N is the number of servers. The ticket-based algorithm has a time complexity O(log N) and the toroidal graph algorithm requires only constant time.","PeriodicalId":164521,"journal":{"name":"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems","volume":"13 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114024776","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":"Disconnected operation in a multi-user software development environment","authors":"P. D. Skopp, G. Kaiser","doi":"10.1109/APADS.1993.588924","DOIUrl":"https://doi.org/10.1109/APADS.1993.588924","url":null,"abstract":"Software Development Environments have traditionally relied upon a central project database and file repository, accessible to a programmer's workstation via a local area network connection. The introduction of powerful mobile computers has demonstrated the need for a new model, which allows for machines with transient network connectivity to assist programmers in product development. The authors propose a process-based checkout model by which process and product files that may be needed during a planned period of disconnectivity are prefetched with minimal user effort. Rather than selecting each file by hand, which is tedious and error-prone, the user only informs the environment of the portion of the software development process intended to be executed while disconnected. The environment is then responsible for prefetching the necessary files. The authors hope that this approach will enable programmers to continue working on a project without network access.","PeriodicalId":164521,"journal":{"name":"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems","volume":"49 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":"122942740","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}