Page 133

Contents | 133 of 135

Download PDF | | Reference URL | Gallery View | Parent Record

Publication Type	technical report
School or College	College of Engineering
Department	Computing, School of
Creator	Lin, Frank Chung Huei
Title	Load balancing and fault tolerance in applicative systems
Date	1985-08
Description	Applicative systems are promising candidates to achieve high performance computing through aggregation of processors. This dissertation studies two important issues in building scalable applicative systems: load balancing problem and fault tolerance.; A dynamic load balancing scheme is proposed for large scale applicative systems. The method is based on a demand-driven approach, the gradient model, which transfers excessive tasks to the nearest idle processor via a gradient surface. The gradient surface is established by the demands from idle processors. The algorithm is fully distributed and asynchronous. A global balance is achieved by successive refinements of many localized balances. The gradient model is independent of system topology and can easily accommodate heterogeneous multiprocessor systems. Simulations have shown that the gradient model performs reasonably well.; The concept of functional checkpointing is proposed as the nucleus of a distributed recovery mechanism. This entails incrementally building a resilient structure as the evaluation of an applicative program proceeds. A simple rollback algorithm is suggested to regenerate the corrupted structure by the most effective functional checkpoints. Another algorithm, which attempts to recover all intermediate results, is also presented. The parent of a faulty task reproduces a functional twin of the failed task. The regenerated task inherits all offspring of the faulty task so that partial results can be salvaged.
Type	Text
Subject	computer architecture; load balancing; fault tolerance; computer science; applicative systems
Language	eng
Bibliographic Citation	Lin, FCH. (1985). Load balancing and fault tolerance in applicative systems. UUCS-85-118.
Series	University of Utah Computer Science Technical Report
Relation is Part of	ARPANET
Format Medium	application/pdf
Format Extent	52,468,022 bytes
File Name	Lin-Load_Balancing.pdf
Conversion Specifications	Original scanned with Kirtas 2400 and saved as 400 ppi uncompressed TIFF. PDF generated by Adobe Acrobat Pro X for CONTENTdm display
ARK	ark:/87278/s6ck0fp4
Setname	ir_computersa
ID	99648
Reference URL	https://collections.lib.utah.edu/ark:/87278/s6ck0fp4

Page Metadata

Title	Page 133
Setname	ir_computersa
ID	99645
OCR Text	Show 121 44. D.P. Misunas, "Error detection and recovery in a data-flow computer," Proc. 1976 I nt' l Con f. on Para// el Processing, IEEE, August 1976, pp. 123-131. 45. B.J. Nelson, "Remote procedure call," Tech. report csl-81-9, Xerox Palo Alto Research Center, May 1981 . 46. LM. Ni, "A distributed load balancing algorithm for point-to-point local computer networks," CompCon Fall, IEEE, 1982, pp. 116-123. 47. K.N. Oikonomou and R.Y. Kain, ''Abstractions for node level passive fault detection in distributed systems.'' I EEE Trans. on Computers, Vol. c-32, No. 6, June 1983, pp. 543-550. 48. O.K. Pradhan, "Fault-tolerant multiprocessor link and bus network architecture," IEEE Trans. on Computer. Vol. c-34, No. 1, January 1985, pp. 33-45. 49. B. Randell, "System structure for software fault tolerance," IEEE Trans. on Software Engineering, Vol. SE-1 , No. 2, June 1975, pp. 220-232. 50. D. Reed. "Implementing atomic actions on decentralized data," ACM Trans. on Computer Systems, Vol. 1, February 1983, pp. 3-23. 51. D.A. Rennels. ·Fault-tolerant computing - concepts and examples," IEEE Trans. on Computers, Vol. c-33, No. 12, December 1984, pp. 1.116-1129. 52. D.M. Ritchie and K. Thompson, "The Unix time-sharing system," CACM, Vol. 17, No. 7, July 197 4. pp. 365-381. 53. D.O. Sharp and P.L. Crews, "Work distribution in a bus-structured fully distributed processing system," CompCon Fa/ I 83, IEEE, September 1983, pp. 42-49. 54. V.P. Srini, "Node reassignment in a dataflow system," Proc. 4th I nt' l Cont. on Distributed Computing Systems, IEEE, San Francisc·o, CA., May 1984, pp. 15-27. 55. J.A. Stankovic and I.S. Sidhu, "An adaptive bidding algorithm for processes, clusters and distributed groups," Proc. of the 4th I nt' I Con f. on Distributed Computing Systems, IEEE, San Francisco, California, May 1984, pp. 49-59. 56. J.A. Stankovic, "A perspective on distributed computer systems," 1 EEE · Trans. on Computers, Vol. c-33, No; 12, December 1984, pp. 1102-1115. 57. H.S. Stone, "Multiprocessor scheduling with the aid of network flow algorithms,'' IEEE Trans. ·on Software Engineering, Vol. SE-3, No. 1, January 1977. pp. 85-93. 58. H.S. Stone, "Cntical load factors in two-processor distributed systems," IEEE Trans. on Software Engineering, Vol. SE-4, No. 3, May 1978, pp. 254-258.
Reference URL	https://collections.lib.utah.edu/ark:/87278/s6ck0fp4/99645