A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
The V distributed system
1988
Communications of the ACM
CHERITON The V distributed system is an operating system designed for a cluster of computer workstations connected by a high-performance network. ...
The kernel is distributed in that a separate copy of the kernel executes on each participating network node yet the separate copies cooperate to provide a single system abstraction of processes in address ...
Through their continued support and that of Digital Equipment Corporation we have been able to furnish every member of the project with a workstation and support tlhe significant software development required ...
doi:10.1145/42392.42400
fatcat:4vn5b6c2kvakxejkpelsntcx3y
Communication and Computing Paradigm for Distributed Mobile Systems
2007
International Journal on Information Sciences and Computing
Thus a novel communication paradigm, namely, Fault Tolerant Exactly Once Reliable Multicast Protocol (FTEORMP) for distributed mobile system is proposed. ...
Computational mobile grid can also be viewed as a seamless integration of cluster of mobile clusters. ...
(SC) to coordinate the overall global activity of the entire cluster. ...
doi:10.18000/ijisac.50008
fatcat:kji2nnzweffipnnonbt4ke6ajq
Single system image: A survey
2016
Journal of Parallel and Distributed Computing
SSI has not been widely adopted. • There may be a role in the future for virtualized kernel-level SSI clusters. a b s t r a c t Single system image is a computing paradigm where a number of distributed ...
h i g h l i g h t s • We provide a retrospective survey of single system image. • There has been novel recent work in the area of distributed hypervisors. • Despite a peak in interest in the 2000s, kernel-level ...
Acknowledgments The authors wish to thank Ian Lee for helping to gather the data depicted in Fig. 2 . ...
doi:10.1016/j.jpdc.2016.01.004
fatcat:6eqzcmrmu5eptmktzn52i7yy7e
Process migration
2000
ACM Computing Surveys
As high-performance facilities shift from supercomputers to networks of workstations, and with the ever-increasing role of the World Wide Web, we expect migration to play a more important role and eventually ...
Design and implementation issues of process migration are analyzed in general, and then revisited for each of the case studies described: MOSIX, Sprite, Mach, and Load Sharing Facility. ...
ACKNOWLEDGMENTS We would like to thank Amnon Barak, David Black, Don Bolinger, Bill Bryant, Luca Cardelli, Steve Chapin, Alan Downey, Shai Guday, Mor Harchol-Balter, Dag Johansen, and Dan Teodosiu for ...
doi:10.1145/367701.367728
fatcat:n2hd2cfc3zcvthnmotqadqhjpy
Distributed applications
[chapter]
1993
Lecture Notes in Computer Science
distributed applications Basic principles for the design of distributed applications. ...
of distributed applications Architecture of distributed applications Distributed applications Lecture Content This lecture presents various aspects and mechanisms for the design and implementation of ...
j). processes do not manipulate objects directly in the space. processes do not invoke methods of objects in the space. ...
doi:10.1007/3-540-56663-5_11
fatcat:cipon5fg2vechp2cesn5vizmru
A practical transparent data sharing service for the grid
2005
CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005.
We consider a transparent data sharing service for distributed applications in the Grid. ...
Our service may alleviate the burden of the user and the programmer to manage the distribution and the migration of data by transparently locating, caching, and managing the consistency of the data. ...
The main other method for atomic consistency is write-multicast, which can be implemented using for example atomic multicast, or quorumacknowledged multicast [9] . ...
doi:10.1109/ccgrid.2005.1558657
dblp:conf/ccgrid/RillingM05
fatcat:d3ldd52jvjcghiqkqiqyqdy5ii
Distributed shared memory: concepts and systems
1996
IEEE Parallel & Distributed Technology Systems & Applications
He was a coarchitect of one of the first 200-MHz microprocessors, and is active in parallel and distributed processing. He has published over 40 IEEE journal papers. ...
He can be reached a t etomasev@ubbg.etf.bg.ac.yu. ...
We also want to thank Vojislav Protiit for his help in providing up-to-date literature, and Liviu Iftode, who kindly provided some of his most recent papers. ...
doi:10.1109/88.494605
fatcat:56jusk7vobepvhcvroadujiiae
Towards a uniform self-configuring virtual private network for workstations and clusters in grid computing
2009
Proceedings of the 3rd international workshop on Virtualization technologies in distributed computing - VTDC '09
Additionally, current approaches lack methods of effectively merging clusters with individual workstations, usually focusing on either the grouping of distributed clusters or a desktop/workstation Grid ...
This paper presents a novel approach of self-configuring IP-based Virtual Private Networks (VPNs) 1 overlays that support dynamic, seamless addition of new resources to the grid for both cluster and workstation ...
Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the NSF. ...
doi:10.1145/1555336.1555340
dblp:conf/icac/WolinskyLF09
fatcat:5nymtbpkxrh2vf5rawomi6crzy
On the design of scalable, self-configuring virtual networks
2009
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis - SC '09
with virtual nameservers through a distributed data store, and (3) support for transparent migration of IP endpoints across widearea networks. ...
Key features of this system are: (1) Scalable connectivity via a P2P overlay with the ability to bypass overlay routing in LAN communications, (2) support for static and dynamic address allocation in conjunction ...
A namespace provides a unique global address space inside a VN. ...
doi:10.1145/1654059.1654073
dblp:conf/sc/WolinskyLJVF09
fatcat:4bwt5hqn75fkhdw6eo23ybs6ge
A distributed parallel programming framework
2002
IEEE Transactions on Software Engineering
The paper reports a range of performance evaluation on the prototype and compares it to related works. ...
Groups of objects, which can be programmed in a uniform and transparent manner, and agent-based distributed system management, are also featured in Visper. ...
ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers for their insightful and constructive comments that have helped them to improve the final presentation of the paper. ...
doi:10.1109/tse.2002.1000451
fatcat:acw7bcyu4zd5jffq7rsfw4dmr4
Design and implementation of a single system image operating system for ad hoc networks
2005
Proceedings of the 3rd international conference on Mobile systems, applications, and services - MobiSys '05
By default, all externally visible entry points, such as methods in a Java object specification, serve as event declarations, and method bodies constitute the default handler for that event in the absence ...
In this paper, we describe the design and implementation of a distributed operating system for ad hoc networks. ...
The ABACUS system [1] has examined how to migrate functionality in a storage cluster. ...
doi:10.1145/1067170.1067187
dblp:conf/mobisys/LiuRWBS05
fatcat:louevdu2abfynipeepflrjt63i
A Model-Driven Approach to Job/Task Composition in Cluster Computing
2007
2007 IEEE International Parallel and Distributed Processing Symposium
In contrast, the Computational Neighborhood (CN), a framework for parallel and distributed computing with a focus on cluster computing, was designed from ground up to be object-oriented. ...
In the general area of high-performance computing, object-oriented methods have gone largely unnoticed. ...
This system combines global naming and replication of both processing and data to support large scale information processing applications leading to better availability and reliability than currently available ...
doi:10.1109/ipdps.2007.370423
dblp:conf/ipps/MehtaKLT07
fatcat:x753b536m5fbzp25knjnohc6qu
An active service framework and its application to real-time multimedia transcoding
1998
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication - SIGCOMM '98
In this paper, we propose an alternative to active networks that addresses a restricted and more tractable subset of the active-networks design space. ...
Several recent proposals for an "active networks" architecture advocate the placement of user-defined computation within the network as a key mechanism to enable a wide range of new applications and protocols ...
James Landay for providing his CSCW course at UC Berkeley as an invaluable testbed for MeGa in a production environment. ...
doi:10.1145/285237.285281
dblp:conf/sigcomm/AmirMK98
fatcat:nkbdko734vha5mxkmrbo3pbhpu
An active service framework and its application to real-time multimedia transcoding
1998
Computer communication review
In this paper, we propose an alternative to active networks that addresses a restricted and more tractable subset of the active-networks design space. ...
Several recent proposals for an "active networks" architecture advocate the placement of user-defined computation within the network as a key mechanism to enable a wide range of new applications and protocols ...
James Landay for providing his CSCW course at UC Berkeley as an invaluable testbed for MeGa in a production environment. ...
doi:10.1145/285243.285281
fatcat:fj4oim7d4jdrxpa2fja7hscpke
A Framework for Opportunistic Cluster Computing Using JavaSpaces1)
[chapter]
2001
Lecture Notes in Computer Science
In this thesis we present the design, implementation and evaluation of a framework that uses JavaSpaces to support this type of opportunistic (adaptive) parallel/distributed computing in a non-intrusive ...
The fundamental idea is to provide large amounts of processing capacity over extended periods of time by harnessing the idle and available resources on the network in an "opportunistic" manner. ...
The segment size for each strip is kept to be 20 leading to 25 sub tasks for each iteration. Each page request spawns off a new
using a cluster of Windows NT workstations. ...
doi:10.1007/3-540-48228-8_74
fatcat:72oua4fshnealddyxfhcqfwtxm
« Previous
Showing results 1 — 15 out of 214 results