EW 7Pub Date : 1996-09-09DOI: 10.1145/504450.504490
David Halls, J. Bates, J. Bacon
{"title":"Flexible distributed programming using mobile code","authors":"David Halls, J. Bates, J. Bacon","doi":"10.1145/504450.504490","DOIUrl":"https://doi.org/10.1145/504450.504490","url":null,"abstract":"We have designed and implemented a mobile code system. It has been integrated with an existing distributed programming environment that includes a Remote Procedure Call (RPC) system, object interface definition language, a trader, an event system and continuous media streams. This bespoke platform for distributed programming has allowed us to experiment with mobile code and propose new facilities.","PeriodicalId":137590,"journal":{"name":"EW 7","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121026544","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}
EW 7Pub Date : 1996-09-09DOI: 10.1145/504450.504489
D. Hagimont, J. Mossière, C. Hemming
{"title":"Hidden capabilities: towards a flexible protection utility for the internet","authors":"D. Hagimont, J. Mossière, C. Hemming","doi":"10.1145/504450.504489","DOIUrl":"https://doi.org/10.1145/504450.504489","url":null,"abstract":"This paper presents a protection model based on software capabilities. Its main advantage is that capabilities are hidden from the application programmer, allowing the protection policy of an application to be defined independently from the application code. This is very interesting for protecting an already developed application.Our claim is that this protection model is well suited for a wide range of environments, from clusters of tightly coupled servers to large loosely coupled servers on the Internet. It is particularly interesting when applications are built by assembling many existing pieces of code into a single application.We argue our claim by describing our model and its integration in three different environments: a DSM (Distributed Shared Memory )system [Pérez 95], CORBA (Common Request Broker Architecture) [OMG 91] and the Java programming environment [Java 95].The rest of the paper is structured as follows. In section 2, we provide an overview of our protection model based on hidden software capabilities. Section 3 discusses the integration of this model in a DSM system, an ORB and the Java environment. We conclude in section 4.","PeriodicalId":137590,"journal":{"name":"EW 7","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127465578","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}
EW 7Pub Date : 1996-09-09DOI: 10.1145/504450.504493
Michael B. Jones, D. McCulley, A. Forin, Paul J Leach, D. Rosu, D. L. Roberts
{"title":"An overview of the Rialto real-time architecture","authors":"Michael B. Jones, D. McCulley, A. Forin, Paul J Leach, D. Rosu, D. L. Roberts","doi":"10.1145/504450.504493","DOIUrl":"https://doi.org/10.1145/504450.504493","url":null,"abstract":"The goal of the Rialto project at Microsoft Research is to build a system architecture supporting coexisting independent real-time (and non-real-time) programs. Unlike traditional embedded-systems real-time environments, where timing and resource analysis among competing tasks can be done off-line, it is our goal to allow multiple independently authored real-time applications with varying timing and resource requirements to dynamically coexist and cooperate to share the limited physical resources available to them, as well as also coexisting with non-real-time applications.This paper gives an overview of the Rialto real-time architecture as it is implemented today and reports on some of the early results obtained. In particular, it describes the use of time constraints, activities, CPU and other resource reservation, and the system resource planner, and how they work together to achieve our goal of providing a flexible, dynamic real-time computing environment.","PeriodicalId":137590,"journal":{"name":"EW 7","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116432814","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}
EW 7Pub Date : 1996-09-09DOI: 10.1145/504450.504496
S. Mullender, M. V. D. Valk
{"title":"Simulating wide-area replication","authors":"S. Mullender, M. V. D. Valk","doi":"10.1145/504450.504496","DOIUrl":"https://doi.org/10.1145/504450.504496","url":null,"abstract":"We describe our experiences with simulating replication algorithms for use in far flung distributed systems. The algorithms under scrutiny mimic epidemics. Epidemic algorithms seem to scale and adapt to change (such as varying replica sets) well. The loose consistency guarantees they make seem more useful in applications where availability strongly outweighs correctness; e.g., distributed name service.","PeriodicalId":137590,"journal":{"name":"EW 7","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114800509","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}
EW 7Pub Date : 1996-09-09DOI: 10.1145/504450.504466
T. Kindberg
{"title":"A stake in cyberspace","authors":"T. Kindberg","doi":"10.1145/504450.504466","DOIUrl":"https://doi.org/10.1145/504450.504466","url":null,"abstract":"Consider the information 'terrain' in which we browse and interact over the Internet, principally the World Wide Web but also USENET, email and IRC. This differs in several basic ways from the territory that we are used to: We can be - and often want to be - in several places at once. The information terrain is hard to navigate. It is infinite and heterogeneous. There are only rudimentary maps. It is in a state of flux, and is not sharply distinguished from the artifacts it sustains. Currently we spend most of our time wandering alone where there is much evidence of human activity, but where the natives themselves and their tools are nowhere to be seen. When we do encounter others, we pass low-bandwidth messages back and forth, often knowing little about our interlocutors.The thesis of this position paper is: The most useful notion of the terrain is the combination of users and the shared information that they interact with, not the information alone. Information is where users should be able to encounter other users with similar interests. We need to support collaboration and other forms of social interaction between users, who either meet while browsing information or who are already members of a group. The key to collaborative information sharing and interaction on the Internet is the concept of boundary, which encompasses naming, security and integrity of shared data, and user communication and awareness. The navigation problem will not go away, but boundaries enable us to impose structure on the sprawl.We now present an early snapshot of a design that addresses these points.","PeriodicalId":137590,"journal":{"name":"EW 7","volume":"16 16","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131804708","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}
EW 7Pub Date : 1996-09-09DOI: 10.1145/504450.504474
L. Shrira, B. Liskov, M. Castro, A. Adya
{"title":"How to scale transactional storage systems","authors":"L. Shrira, B. Liskov, M. Castro, A. Adya","doi":"10.1145/504450.504474","DOIUrl":"https://doi.org/10.1145/504450.504474","url":null,"abstract":"Applications of the future will need to support large numbers of clients and will require scalable storage systems that allow state to be shared reliably. Recent research in distributed file systems provides technology that increases the scalability of storage systems. But file systems only support sharing with weak consistency guarantees and can not support applications that require transactional consistency. The challenge is how to provide scalable storage systems that support transactional applications.We are developing technology for scalable transactional storage systems. Our approach combines scalable caching and coherence techniques developed in serverless file systems and DSM systems, with recovery techniques developed in traditional databases. This position paper describes the design rationale for split caching, a new scalable memory management technique for network-based transactional object storage systems, and fragment reconstruction, a new coherence protocol that supports fine-grained sharing.","PeriodicalId":137590,"journal":{"name":"EW 7","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115525603","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}
EW 7Pub Date : 1996-09-09DOI: 10.1145/504450.504483
Y. Berbers, B. Decker, W. Joosen
{"title":"Infrastructure for mobile agents","authors":"Y. Berbers, B. Decker, W. Joosen","doi":"10.1145/504450.504483","DOIUrl":"https://doi.org/10.1145/504450.504483","url":null,"abstract":"State of the art distributed application technology is not suited to tackle the challenges offered by the \"Information Superhighway\". A new communication model based on mobile agents has been proposed and is still intensely studied. Research on the software infrastructure required to host agents on the move is urgently needed.The paper presents a requirements analysis for the infrastructure needs of agents in a distributed applications environment such as DCE or CORBA. It introduces an outline of a comprehensive proposal which includes requirements for autonomy, communication, mobility and security.","PeriodicalId":137590,"journal":{"name":"EW 7","volume":"229 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128599012","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}
EW 7Pub Date : 1996-09-09DOI: 10.1145/504450.504477
Jay Lepreau, B. Ford, Mike Hibler
{"title":"The persistent relevance of the local operating system to global applications","authors":"Jay Lepreau, B. Ford, Mike Hibler","doi":"10.1145/504450.504477","DOIUrl":"https://doi.org/10.1145/504450.504477","url":null,"abstract":"The growth and popularity of loosely-coupled distributed systems such as the World Wide Web and the touting of Java-based systems as the solution to the issues of software maintenance, flexibility, and security are changing the research emphasis away from traditional single node operating system issues. Apparently, the view is that traditional OS issues are either solved problems or minor problems. By contrast, we believe that building such vast distributed systems upon the fragile infrastructure provided by today's operating systems is analogous to building castles on sand. In this paper we outline the supporting arguments for these views and describe an OS design that supports secure encapsulation of the foreign processes that will be increasingly prevalent in tomorrow's distributed systems.1","PeriodicalId":137590,"journal":{"name":"EW 7","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126219750","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}
EW 7Pub Date : 1996-09-09DOI: 10.1145/504450.504458
D. Kotz, R. Gray, D. Rus
{"title":"Transportable agents support worldwide applications","authors":"D. Kotz, R. Gray, D. Rus","doi":"10.1145/504450.504458","DOIUrl":"https://doi.org/10.1145/504450.504458","url":null,"abstract":"Worldwide applications exist in an environment that is inherently distributed, dynamic, heterogeneous, insecure, unreliable, and unpredictable. In particular, the latency and bandwidth of network connections varies tremendously from place to place and time to time, particularly when considering wireless networks, mobile devices, and satellite connections. Applications in this environment must be able to adapt to different and changing conditions. We believe that transportable autonomous agents provide an excellent mechanism for the construction of such applications. We describe our prototype transportable-agent system and several applications.","PeriodicalId":137590,"journal":{"name":"EW 7","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132813980","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}
EW 7Pub Date : 1996-09-09DOI: 10.1145/504450.504499
A. Puder, K. Geihs
{"title":"System support for knowledge-based trading in open service markets","authors":"A. Puder, K. Geihs","doi":"10.1145/504450.504499","DOIUrl":"https://doi.org/10.1145/504450.504499","url":null,"abstract":"An open distributed service environment can be perceived as a service market where services are freely offered and requested. Any infrastructure which seeks to provide appropriate mechanisms for such an environment has to include some mediator functionality to bring together matching service requests and service offers. The matching algorithm that the mediator must perform commonly builds upon an IDL-based type definition for service specification. We propose a type specification notation based upon conceptual graphs that supports the openness of the service environment, since it is more flexible than IDL-based definitions, and since it is closer to the cognitive domain of application users. In our framework, the trader implements a matching algorithm as well as a learning algorithm which are tailored to service trading in open environments.","PeriodicalId":137590,"journal":{"name":"EW 7","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133918566","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}