Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
Computer
Integral-C—a practical environment for C programming
SDE 2 Proceedings of the second ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Communications of the ACM
Distributed process groups in the V Kernel
ACM Transactions on Computer Systems (TOCS)
Para-functional programming: a paradigm for programming multiprocessor systems
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Automatic partitioning and scheduling on a network of personal computers
Automatic partitioning and scheduling on a network of personal computers
Parallel compilation for a parallel machine
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
An examination of strategies for estimating capacity to share among private workstations
SIGSMALL '91 Proceedings of the 1991 ACM SIGSMALL/PC symposium on Small systems
Estimating Capacity for Sharing in a Privately Owned Workstation Environment
IEEE Transactions on Software Engineering
An examination of strategies for estimating capacity to share among private workstations
ACM SIGSMALL/PC Notes
Cluster scheduling for explicitly-speculative tasks
Proceedings of the 18th annual international conference on Supercomputing
Scheduling speculative tasks in a compute farm
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
ATEC '98 Proceedings of the annual conference on USENIX Annual Technical Conference
Hi-index | 0.00 |
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.