Article

Free access

Performance of optimistic make

Authors:

SIGMETRICS '89: Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

Pages 39 - 48

https://doi.org/10.1145/75108.75377

Published: 01 April 1989 Publication History

PDF eReader

Abstract

Optimistic 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 V-System 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.

References

[1]

F.W. Burton. Controlling speculative computation in a parallel functional programming language. In Proceedings of the Fifth internalional Conference on Distributed Compnting Systems, pages 453--458, May 1985.

Google Scholar

[2]

D. R. Cheriton. The V distributed system. Communications of the A CM, 31(3):314-333, March 1988.

Digital Library

Google Scholar

[3]

D. R. Cheriton and W. Zwaenepoel. Distributed process groups in the V kernel. ACM Transactions on Computer Systems, 3(2):77-107, May 1985.

Digital Library

Google Scholar

[4]

D.L. Eager, E.D. Lazowska, and J. Zahorjan. Adaptive load balancing in homogenous distributed systems. IEEE Transactions on Software Engineering, SF_,-12(5):662-675, May 1986.

Digital Library

Google Scholar

[5]

S. Feldman. Make---a computer program for maintaining computer programs. Software Practice and Experience, 9(4):255-265, April 1979.

Crossref

Google Scholar

[6]

R. Hagmann. Process server: Sharing processing power in a workstation environment. In Proceedings of the Sixth International Conference on Distributed Computing Systems, pages 260-267, May 1986.

Google Scholar

[7]

R. H. Halstead. Parallel symbolic computing. IEEE Computer, 19(8):35-43, August 1986.

Digital Library

Google Scholar

[8]

D. A. Hornig. Automatic Partitioning and Scheduling on a Network of Personal Computers. PhD thesis, Carnegie-Mellon University, November 1984.

Digital Library

Google Scholar

[9]

P. Itudak and L. Smith. Para-functional programming: A paradigm for programming multiprocessor systems. In Proceedings of the Thirteenth Annual Symposium on Principles of Programming Languages, pages 243-254, January 1986.

Digital Library

Google Scholar

[10]

M. W. Mutka and M. Livny. Scheduling remote processing capacity in a workstation-processor bank network. In Proceedings of the Seventh International Conference on Distributed Computing Systems, pages 2-9, September 1987.

Google Scholar

[11]

G. Ross. A practical environment for C programming. In Proceedings of the A CM SIG- SOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, pages 42-48, January 1987. Also available as SIGPLAN Notices 22(1), January 1987.

Digital Library

Google Scholar

Cited By

View all

Petrou DGibson GGanger GKramer W(2005)Scheduling speculative tasks in a compute farmProceedings of the 2005 ACM/IEEE conference on Supercomputing10.1109/SC.2005.62Online publication date: 12-Nov-2005
https://dl.acm.org/doi/10.1109/SC.2005.62
Petrou DGanger GGibson GFeautrier PGoodman JSeznec A(2004)Cluster scheduling for explicitly-speculative tasksProceedings of the 18th annual international conference on Supercomputing10.1145/1006209.1006256(336-345)Online publication date: 26-Jun-2004
https://dl.acm.org/doi/10.1145/1006209.1006256
Vahdat AAnderson T(1998)Transparent result cachingProceedings of the annual conference on USENIX Annual Technical Conference10.5555/1268256.1268259(3-3)Online publication date: 15-Jun-1998
https://dl.acm.org/doi/10.5555/1268256.1268259
Show More Cited By

Index Terms

Recommendations

Performance of optimistic make

Optimistic 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 ...
Optimistic Make (Software Design)

The notion of encapsulations is introduced as the basic construct used to support optimistic make (a software tool). The authors describe the implementation of optimistic make in the V-System on a collection of SUN workstations. Statistics measured from ...
Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing

There is an ever-increasing demand for more complex transactions and higher throughputs in transaction processing systems leading to higher degrees of transaction concurrency and, hence, higher data contention. The conventional two-phase locking (2PL) ...

Comments

Information & Contributors

Information

Published In

SIGMETRICS '89: Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

April 1989

242 pages

ISBN:0897913159

DOI:10.1145/75108

Chairman:
Domenico Ferrari
Univ. of California, Berkeley

ACM SIGMETRICS Performance Evaluation Review Volume 17, Issue 1
May 1989
209 pages
ISSN:0163-5999
DOI:10.1145/75372
Editor:
Blaine D. Gaither
Gould Inc., San Diego, CA
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMETRICS89

Sponsor:

SIGMETRICS

SIGMETRICS89: Performance 89 Intl Conference on Measurement & Modeling of Computer Systems

May 23 - 26, 1989

California, Oakland, USA

Acceptance Rates

Overall Acceptance Rate 459 of 2,691 submissions, 17%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
228
Total Downloads

Downloads (Last 12 months)48
Downloads (Last 6 weeks)6

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Petrou DGibson GGanger GKramer W(2005)Scheduling speculative tasks in a compute farmProceedings of the 2005 ACM/IEEE conference on Supercomputing10.1109/SC.2005.62Online publication date: 12-Nov-2005
https://dl.acm.org/doi/10.1109/SC.2005.62
Petrou DGanger GGibson GFeautrier PGoodman JSeznec A(2004)Cluster scheduling for explicitly-speculative tasksProceedings of the 18th annual international conference on Supercomputing10.1145/1006209.1006256(336-345)Online publication date: 26-Jun-2004
https://dl.acm.org/doi/10.1145/1006209.1006256
Vahdat AAnderson T(1998)Transparent result cachingProceedings of the annual conference on USENIX Annual Technical Conference10.5555/1268256.1268259(3-3)Online publication date: 15-Jun-1998
https://dl.acm.org/doi/10.5555/1268256.1268259
Golding RBosch PStaelin CSullivan TWilkes J(1995)Idleness is not slothProceedings of the USENIX 1995 Technical Conference Proceedings10.5555/1267411.1267428(17-17)Online publication date: 16-Jan-1995
https://dl.acm.org/doi/10.5555/1267411.1267428
Mutka M(1992)An examination of strategies for estimating capacity to share among private workstationsACM SIGSMALL/PC Notes10.1145/134307.13433418:1-2(53-61)Online publication date: 1-Mar-1992
https://dl.acm.org/doi/10.1145/134307.134334
Ramji VGonsalves T(1992)Distributed and Optimistic Make: implementation and performanceEleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]10.1109/PCCC.1992.200601(531-538)Online publication date: 1992
https://doi.org/10.1109/PCCC.1992.200601
Mutka M(1992)Estimating Capacity for Sharing in a Privately Owned Workstation EnvironmentIEEE Transactions on Software Engineering10.1109/32.12922018:4(319-328)Online publication date: 1-Apr-1992
https://dl.acm.org/doi/10.1109/32.129220
Mutka M(1991)An examination of strategies for estimating capacity to share among private workstationsProceedings of the 1991 ACM SIGSMALL/PC symposium on Small systems10.1145/111048.111054(41-49)Online publication date: 1-May-1991
https://dl.acm.org/doi/10.1145/111048.111054
Mutka M(1991)A comparison of workload models of the capacity available for sharing among privately owned workstationsProceedings of the Twenty-Fourth Annual Hawaii International Conference on System Sciences10.1109/HICSS.1991.183905(353-362)Online publication date: 1991
https://doi.org/10.1109/HICSS.1991.183905
Gross TSobel AZolg M(1989)Parallel compilation for a parallel machineACM SIGPLAN Notices10.1145/74818.7482624:7(91-100)Online publication date: 21-Jun-1989
https://dl.acm.org/doi/10.1145/74818.74826
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Performance of optimistic make

Optimistic Make (Software Design)

Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing