Dynamic Load Sharing With Unknown Memory Demand of Jobs in Clustered Compute Farms

A slide is vertically movable in a press frame and supports the upper die. A threaded main spindle is operative between the press frame and the slide. A clutch disc connected rationally rigidly to the spindle is connectable by friction contact to a driven disc flywheel for the operating stroke of the slide. Piston-cylinder units act between the press frame and the slide for returning the slide to the starting position. The spindle is axially clamped between two spring columns, one of which acts between one end of the spindle and the slide and the other of which acts between the other end of the spindle and a counter thrust bearing axially fixed in the press frame. An auxiliary spindle, of approximately the same lead but with a smaller diameter, engages in an internally threaded bore in the main spindle and is disposed between the corresponding end of the main spindle and the corresponding spring column in order to compensate the relative axial movement between the axially fixed main spindle and the axially movable slide or between the main spindle axially movable with the slide and the counter thrust bearing held axially movably but rotationally rigidly in the slide or on the counter thrust bearing against the force exerted upon it by the spring column.

[1]  Li Xiao,et al.  Incorporating job migration and network RAM to share cluster memory resources , 2000, Proceedings the Ninth International Symposium on High-Performance Distributed Computing.

[2]  Anoop Gupta,et al.  Memory system performance of UNIX on CC-NUMA multiprocessors , 1995, SIGMETRICS '95/PERFORMANCE '95.

[3]  Amnon Barak,et al.  Memory ushering in a scalable computing cluster , 1997, Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing.

[4]  Mark S. Squillante,et al.  Analysis of the Impact of Memory in Distributed Parallel Processing Systems , 1994, SIGMETRICS.

[5]  Pei Cao,et al.  Adaptive page replacement based on memory reference behavior , 1997, SIGMETRICS '97.

[6]  Zhao Zhang,et al.  Cache-Optimal Methods for Bit-Reversals , 1999, ACM/IEEE SC 1999 Conference (SC'99).

[7]  Steven K. Reinhardt,et al.  A fully associative software-managed cache design , 2000, Proceedings of 27th International Symposium on Computer Architecture (IEEE Cat. No.RS00201).

[8]  Mor Harchol-Balter,et al.  Exploiting process lifetime distributions for dynamic load balancing , 1995, SIGMETRICS.

[9]  Raphael A. Finkel,et al.  Designing a Process Migration Facility , 1989 .

[10]  Sanjeev Setia,et al.  Availability and utility of idle memory in workstation clusters , 1999, SIGMETRICS '99.

[11]  Amnon Barak,et al.  Memory ushering in a scalable computing cluster , 1998, Microprocess. Microsystems.

[12]  Brian N. Bershad,et al.  The impact of operating system structure on memory system performance , 1994, SOSP '93.

[13]  Dror G. Feitelson,et al.  Job Characteristics of a Production Parallel Scientivic Workload on the NASA Ames iPSC/860 , 1995, JSSPP.

[14]  Li Xiao,et al.  Improving memory performance of sorting algorithms , 2000, JEAL.

[15]  Fred Douglis,et al.  Transparent process migration: Design alternatives and the sprite implementation , 1991, Softw. Pract. Exp..

[16]  Dror G. Feitelson,et al.  Gang scheduling with memory considerations , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[17]  Mark S. Squillante,et al.  Analysis of Job Arrival Patterns and Parallel Scheduling Performance , 1999, Perform. Evaluation.

[18]  Li Xiao,et al.  Improving distributed workload performance by sharing both CPU and memory resources , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.