The V distributed system

Cheriton, David R.

doi:10.1145/42392.42400

Cited by 319 publications

(73 citation statements)

References 33 publications

(21 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Micro-kernel operating systems 5,6,11,9,21,27,29] were an early example of this trend, and improve adaptiveness by a l l o wing operating system functionality to be implemented in user-level servers that can be customized and con gured to produce specialpurpose operating systems. While micro-kernel-based architectures improve adaptiveness over monolithic kernels, support for user-level servers incurs a high performance penalty.…”

Section: Related Workmentioning

confidence: 99%

Optimistic incremental specialization

Autrey

Black

et al. 1995

SIGOPS Oper. Syst. Rev.

View full text Add to dashboard Cite

Conventional operating system code is written to deal with all possible system states, and performs considerable interpretation to determine the current system state before taking action. A consequence of this approach i s t h a t k ernel calls which perform little actual work take a long time to execute. To address this problem, we use specialized operating system code that reduces interpretation for common cases, but still behaves correctly in the fully general case. We describe how specialized operating system code can be generated and bound incrementally as the information on which it depends becomes available. We extend our specialization techniques to include the notion of optimistic incremental specialization: a technique for generating specialized kernel code optimistically for system states that are likely to occur, but not certain. The ideas outlined in this paper allow the conventional kernel design tenet of \optimizing for the common case" to be extended to the domain of adaptive operating systems. We also show that aggressive u s e o f specialization can produce in-kernel implementations of operating system functionality with performance comparable to user-level implementations.We demonstrate that these ideas are applicable in realworld operating systems by describing a re-implementation of the HP-UX le system. Our specialized read system call reduces the cost of a single byte read by a factor of 3, and an 8 KB read by 26%, while preserving the semantics of the HP-UX read call. By relaxing the semantics of HP-UX read we w ere able to cut the cost of a single byte read system call by more than an order of magnitude.

show abstract

Section: Related Workmentioning

confidence: 99%

Optimistic incremental specialization

Autrey

Black

et al. 1995

SIGOPS Oper. Syst. Rev.

View full text Add to dashboard Cite

show abstract

“…All machines are running the V-System [2]. Remote execution of programs is transparent and incurs only a very small performance penalty.…”

Section: Measurement Environmentmentioning

confidence: 99%

Performance of optimistic make

BubenikR.

ZwaenepoelW.

1989

SIGMETRICS Perform. Eval. Rev.

View full text Add to dashboard Cite

Optinaistic make is a version of make that executes the commands necessary to bring targets up-to-date prior to the time the user types a make request. Side effects of these optimistic computations (such as file or screen updates) are concealed until the make request is issued. If the inputs read by the optimistic computations are identical to the inputs the computation would read at the time the make request is issued, the results of the optimistic computations are used immediately, resulting in improved response time. Otherwise, the necessary computations are reexecuted.We have implemented optimistic make in the VSystem on a collection of SUN-3 workstations. Statistics collected from this implementation are used to synthesize a workload for a discrete-event simulation and to validate its results. The simulation shows a speedup distribution over pessimistic make with a median of 1.72 and a mean of 8.28. The speedup distribution is strongly dependent on the ratio between the target out-of-date times and the command execution times. In particular, with faster machines the median of the speedup distribution grows to 5.1, and then decreases again. The extra machine resources used by optimistic make are well within the limit of available resources, given the large idle times observed in many workstation environments.

show abstract

“…As early as the late seventies work was being done toward "networked operating systems" [13,23,65]. In the late eighties and early nineties, this returned as distributed operating systems [9,14,64]. Shortly thereafter the field of heterogeneous computing [22,41] came to play: thousands of heterogeneous resources running hundreds of tasks.…”

Section: Introductionmentioning

confidence: 99%

Grids: The Top Ten Questions

Schopf

Nitzberg

2002

Scientific Programming

View full text Add to dashboard Cite

The design and implementation of a national computing system and data grid has become a reachable goal from both the computer science and computational science point of view. A distributed infrastructure capable of sophisticated computational functions can bring many benefits to scientific work, but poses many challenges, both technical and socio-political. Technical challenges include having basic software tools, higher-level services, functioning and pervasive security, and standards, while socio-political issues include building a user community, adding incentives for sites to be part of a usercentric environment, and educating funding sources about the needs of this community. This paper details the areas relating to Grid research that we feel still need to be addressed to fully leverage the advantages of the Grid.

show abstract

The V distributed system

Cited by 319 publications

References 33 publications

Optimistic incremental specialization

Optimistic incremental specialization

Performance of optimistic make

Grids: The Top Ten Questions

Contact Info

Product

Resources

About