Fundamental challenges in mobile computing
Published 1 January 1996Open access
Mahadev Satyanarayanan
Citations665
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A set of constraints intrinsic to mobile computing is described, and the impact of these constraints on the design of distributed systems are examined, including the Coda and Odyssey systems.
Abstract
Article Free Access Share on Fundamental challenges in mobile computing Author: M. Satyanarayanan School of Computer Science, Carnegie Mellon University School of Computer Science, Carnegie Mellon UniversityView Profile Authors Info & Claims PODC '96: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computingMay 1996 Pages 1–7https://doi.org/10.1145/248052.248053Online:01 May 1996Publication History 327citation6,419DownloadsMetricsTotal Citations327Total Downloads6,419Last 12 Months298Last 6 weeks77 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Keywords
Computer Science
ACM Transactions on Database SystemsOn optimistic methods for concurrency control
1,439 Citations1981H. T. Kung, John T. Robinson
In this paper, two families of nonlocking concurrency controls are presented and the methods used are "optimistic" in the sense that they rely mainly on transaction backup as a control mechanism, “hoping” that conflicts between transactions will not occur.
ACM Transactions on Computer SystemsScale and performance in a distributed file system
1,412 Citations1988John H. Howard, Michael L. Kazar +5 more
This paper examines the consequences of the design decision to transfer whole files between servers and workstations rather than some smaller unit such as records or blocks, as almost all other distributed file systems do, and compares the whole file transfer strategy with that of a block-oriented file system, Sun Microsystems' NFS.
ACM Transactions on Computer SystemsDisconnected operation in the Coda File System
1,070 Citations1992James J. Kistler, Mahadev Satyanarayanan
This paper shows that disconnected operation is feasible, efficient and usable by describing its design and implementation in the Coda File System by showing that caching of data, now widely used for performance, can also be exploited to improve availability.
IEEE Transactions on ComputersCoda: a highly available file system for a distributed workstation environment
865 Citations1990Mahadev Satyanarayanan, James J. Kistler +4 more
Exploiting weak connectivity for mobile file access
212 Citations1995Lily Mummert, Maria Ebling +1 more
This paper describes how the Coda File System has evolved to exploit weak connectivity networks, and the underlying theme of this evolution has been the systematic introduction of adaptivity to eliminate hidden assumptions about strong connectivity.
A Programming Interface for Application-Aware Adaptation in Mobile Computing.
153 Citations1995Brian Noble, Morgan N. Price +1 more
The essence of the solution is a collaborative partnership between applications and the operating system for application-aware adaptation and its use in accessing two types of data: video and maps.
Experience with Disconnected Operation in a Mobile Computing Environment
110 Citations2007Mahadev Satyanarayanan, James J. Kistler +4 more
Qualitative and quantitative data on file access in a mobile computing environment based on actual usage experience with the Coda File System confirms the viability and effectiveness of disconnected operation, and exposes certain deficiencies of the current implementation of Coda.
Flexible and Safe Resolution of File Conflicts,
98 Citations1994Puneet Kumar, Mahadev Satyanarayanan
The design combines a rule-based approach to ASR selection with transactional encapsulation of ASR execution and shows how such an approach leads to flexible and efficient file resolution without loss of security or robustness.
Lecture notes in computer scienceDisconnected Operation in a Distributed File System
78 Citations1995James J. Kistler
This work presents the important new technique called disconnected operation, in which clients mask failures and voluntary network detachments by emulating the functionality of servers where actual server-oriented solutions are inadequate.
IEEE Transactions on Software EngineeringCaching Hints in Distributed Systems
74 Citations1987Doug Terry
A new approach to managing caches of hints suggests maintaining a minimum level of cache accuracy, rather than maximizing the cache hit ratio, in order to guarantee performance improvements.
IEEE Transactions on Software EngineeringThe influence of scale on distributed file system design
68 Citations1992Mahadev Satyanarayanan
The proposition that scale should be recognized as a primary factor influencing the architecture and implementation of distributed systems is validated using Andrew and Coda, two distributed file systems.
Log-based directory resolution in the Coda file system
67 Citations2002Puneet Kumar, Mahadev Satyanarayanan
The authors describe how the Coda file system resolves partitioned updates to directories and conclude that logging of updates is a simple yet efficient and powerful technique for directory resolution in Unix file systems.
Scale and performance in a distributed file system
58 Citations1987J. Howard, M. Kazar +3 more
Improving data consistency in mobile computing using isolation-only transactions
55 Citations2002Qi Lü, Mahadev Satyanarayanan
This paper presents a new mechanism called isolation-only transaction (IOT) that uses serializability constraints to automatically detect read/write conflicts and provides a set of options for automatic and manual conflict resolution.
An empirical study of a highly available file system
42 Citations1994Brian Noble, Mahadev Satyanarayanan
Large Granularity Cache Coherence for Intermittent Connectivity
39 Citations1994Lily Mummert, Mahadev Satyanarayanan
At 9.6 Kbps, this technique takes only 4-20% of the time required by two other strategies to validate the cache for a sample of Coda users, and the network is effectively eliminated as the bottleneck for cache validation.
Mitigating the Effects of Optimistic Replication in a Distributed File System
20 Citations1994Puneet Kumar
This dissertation puts fears to rest by showing that it is indeed practical and feasible to use optimistic replication in distributed file systems and describes the design, implementation and evaluation of the mechanisms used to transparently resolve diverging replicas in the Coda file system.
Using dynamic sets to overcome high I/O latencies during search
12 Citations2002David C. Steere, Mahadev Satyanarayanan
This paper motivates dynamic sets and presents the design of a system that embodies this abstraction, which can offer substantial benefits to search applications.