Article

Free access

Mechanisms and policies for supporting fine-grained cycle stealing

Authors:

Kyung Dong Ryu,

Jeffrey K. Hollingsworth,

Peter J. KeleherAuthors Info & Claims

ICS '99: Proceedings of the 13th international conference on Supercomputing

Pages 93 - 100

https://doi.org/10.1145/305138.305170

Published: 01 May 1999 Publication History

PDF eReader

References

[1]

A. Acharya, G. Edjlali, and J. Saltz, "The Utility of Exploiting idle Workstations for Parallel Computation," SIGMETRICS'9Z May 1997, Seattle, WA, pp. 225-236.

Digital Library

Google Scholar

[2]

C. Amza, A. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Rajamony, W. Yu, and W. Zwaenepoel, "TreadMarks: Shared Memory Computing on Networks of Workstations," IEEE Computer, February 1996.

Digital Library

Google Scholar

[3]

R.H. Arpaci, A. C. Dusseau, A. M. Vahdat, L. T. Liu, T. E. Anderson, and D. A. Patterson, "The Interaction of Parallel and Sequential Workloads on a Network of Workstations," SIGMETRICS. May 1995, Ottawa, pp. 267-278.

Digital Library

Google Scholar

[4]

A. Barak, O. Laden, and Y. Yarom, "The NOW Mosix and its Preemptive Process Migration Scheme," Bulletin of the iEEE Technical Committee on Operating Systems and Application Environments, 7(2), 1995, pp. 5-11.

Google Scholar

[5]

A. Chowdhury, L. D. Nicklas, S. K. Setia, and E. L. White, "Workload Characteristics for Process Migration and Load Balancing," ICDCS. June 1997, Baltimore, MD, pp. 1-7.

Google Scholar

[6]

P. Druschel and L. L. Peterson, Operating Systems and Network lnter~ces, in The Grid.' Blueprint for a New Computing Infrastructure, I. Foster and C. Kesselman, Editors. 1998, Morgan-Kaufmann: San Francisco. p. 505-532.

Digital Library

Google Scholar

[7]

A. C. Dusseau, R. H. Arpaci, and D. E. Culler, "Effective distributed scheduling of parallel workloads," SIGMETIRCS. May 1996, Philadelphia, PA, pp. 25-36.

Digital Library

Google Scholar

[8]

A. Geist, A. Beguelin, j. Dongarra, W. Jiang, R. Manchek, and V. Sunderam, PVM.' Parallel Virtual Machine. 1994, Cambridge, Mass: The MIT Press.

Google Scholar

[9]

P. Keleher, "The Relative Importance of Concurrent Writers and Weak Consistency Models," ICDC$. May 1996, Hong Kong, pp. 91-98.

Digital Library

Google Scholar

[10]

P. Krueger and R. Chawla, "The Stealth Distributed Scheduler,'' International Conference on Distributed Computing Systems (ICDCS). May 1991, Arlington, TX, pp. 336-343.

Google Scholar

[11]

M. Litzkow, M. Livny, and M. Mutka, "Condor - A Hunter of Idle Workstations," International Conference on Distributed Computing Systems. June 1988, pp. 104-111.

Google Scholar

[12]

K. J. McDonell, "Taking Performance Evaluation Out of the 'Stone Age'," Summer USENIX Conference. June 1987, Phoenix, AZ, pp. 8-12.

Google Scholar

[13]

M. W. Mutka and M. Livny, "The available capacity of a privately owned workstation environment," Performance Evaluation, 12, 1991, pp. 269-284.

Digital Library

Google Scholar

[14]

M. L. Powell and B. P. Miller, "Process migration in DEMOS/MP," SOSP. 1983, pp. 110-119.

Digital Library

Google Scholar

[15]

J. Pruyne and M. Livny, Providing Resource Management Services to Parallel Applications, in Proceedings of the Second Workshop on Environments and Tools for Parallel Scientic Computing, J. Dongarra and B. Tourancheau, Editors. 1994, SIAM Proceedings Series. p. 152-161.

Google Scholar

[16]

K. D. Ryu and J. K. Hollingsworth, "Linger Longer: Fine- Grain Cycle Stealing for Networks of Workstations," SC'98. Nov. 1998, Orlando.

Digital Library

Google Scholar

[17]

SiliconGraphics, IRIX 6.5 Technical Brief, http://www.sgi.com/software/irix6.5/techbrief, pdf, 1998.

Google Scholar

[18]

A. Tamches and B. P. Miller, "Fine-Grained Dynamic Instrumentation of Commodity Operating System Kernels," Third Symposium on Operating Systems Design and Implementation (OSDI). (to appear) February 1999, New Orleans.

Digital Library

Google Scholar

[19]

M. M. Theimer, K. A. Lantz, and D. R. Cheriton, "Premptable Remote Execution Facilities for the V-System," SOSP. Dec. 1985, pp. 2-12.

Digital Library

Google Scholar

[20]

G. Thiel, "Locus Operating System, A Transparent System," Computer Communications, 14(6), 1991, pp. 336-346.

Digital Library

Google Scholar

[21]

B. Verghese, A. Gupta, and M. Rosenblum, "Performance Isolation: Sharing and Isolation in Shared-Memory Multiprocessors," ASPLOS. Oct. 1998, San Jose, CA, pp. 181-192.

Digital Library

Google Scholar

[22]

S. C. Woo, M. Ohara, E. Torrie, J. P. Singh, and A. Gupta, "The SPLASH-2 Programs: Characterization and Methodological Considerations," Proceedings of the 22nd Annual International Symposium on Computer Architecture. 1995, pp. 24-37.

Digital Library

Google Scholar

[23]

E. R. Zayas, "Attacking the Process Migration Bottleneck," SOSP. 1987, pp. 13-24.

Digital Library

Google Scholar

[24]

S. Zhou, X. Zheng, J. Wang, and P. Delisle, "Utopia: a Load Sharing Facility for Large, Heterogeneous Distributed Computer Systems," SPE, 23(12), 1993, pp. 1305-1336.

Digital Library

Google Scholar

Cited By

View all

Chen PChang JLiang TShieh CZhuang YSchulze BAbramson DNandkumar RBuyya R(2006)A multi-layer resource reconfiguration framework for grid computingProceedings of the 4th international workshop on Middleware for grid computing10.1145/1186675.1186689Online publication date: 27-Nov-2006
https://dl.acm.org/doi/10.1145/1186675.1186689
Johnson DLilja DRiedl J(2006)Circulating shared-registers for multiprocessor systemsJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2005.04.00252:3(152-168)Online publication date: 1-Mar-2006
https://dl.acm.org/doi/10.1016/j.sysarc.2005.04.002
Kyung Dong Ryu Hollingsworth J(2004)Unobtrusiveness and efficiency in idle cycle stealing for PC grids18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.10.1109/IPDPS.2004.1302987(62-71)Online publication date: 2004
https://doi.org/10.1109/IPDPS.2004.1302987
Show More Cited By

Index Terms

Mechanisms and policies for supporting fine-grained cycle stealing

Recommendations

Resource Policing to Support Fine-Grain Cycle Stealing in Networks of Workstations

This paper presents the design, implementation, and performance evaluation of a suite of resource policing mechanisms that allow guest processes to efficiently and unobtrusively exploit otherwise idle workstation resources. Unlike traditional policies ...
Exploiting Fine-Grained Idle Periods in Networks of Workstations

Studies have shown that for a significant fraction of the time, workstations are idle. In this paper, we present a new scheduling policy called Linger-Longer that exploits the fine-grained availability of workstations to run sequential and parallel ...
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations

We derive computationally efficient guidelines for nearly optimal scheduling of data-parallel computations within a draconian mode of cycle-stealing in networks of workstations (nows). In this computing regimen, workstation A takes control of ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICS '99: Proceedings of the 13th international conference on Supercomputing

June 1999

509 pages

ISBN:158113164X

DOI:10.1145/305138

Chairmen:
Theodore Papatheodorou
Univ. of Patras, Patras, Greece
,
Mateo Valero
Univ. Politècnica de Catalunya, Barcelona, Spain
,
Constantine D. Polychronopoulos
Univ. of Illinois
,
Yoichi Muraoka
Waseda Univ.
,
Jesus Labarta
Univ. Politècnica de Catalunya, Barcelona, Spain

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 May 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

ICS99

Sponsor:

SIGARCH

ICS99: The 13th ACM International Conference on Supercomputing

June 20 - 25, 1999

Rhodes, Greece

Acceptance Rates

ICS '99 Paper Acceptance Rate 57 of 180 submissions, 32%;

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
313
Total Downloads

Downloads (Last 12 months)35
Downloads (Last 6 weeks)3

Reflects downloads up to 19 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chen PChang JLiang TShieh CZhuang YSchulze BAbramson DNandkumar RBuyya R(2006)A multi-layer resource reconfiguration framework for grid computingProceedings of the 4th international workshop on Middleware for grid computing10.1145/1186675.1186689Online publication date: 27-Nov-2006
https://dl.acm.org/doi/10.1145/1186675.1186689
Johnson DLilja DRiedl J(2006)Circulating shared-registers for multiprocessor systemsJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2005.04.00252:3(152-168)Online publication date: 1-Mar-2006
https://dl.acm.org/doi/10.1016/j.sysarc.2005.04.002
Kyung Dong Ryu Hollingsworth J(2004)Unobtrusiveness and efficiency in idle cycle stealing for PC grids18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.10.1109/IPDPS.2004.1302987(62-71)Online publication date: 2004
https://doi.org/10.1109/IPDPS.2004.1302987
Wu MSun X(2004)Memory Conscious Task Partition and Scheduling in Grid EnvironmentsProceedings of the 5th IEEE/ACM International Workshop on Grid Computing10.1109/GRID.2004.43(138-145)Online publication date: 8-Nov-2004
https://dl.acm.org/doi/10.1109/GRID.2004.43
Nikolopoulos D(2003)Malleable memory mapping: user-level control of memory bounds for effective program adaptationProceedings International Parallel and Distributed Processing Symposium10.1109/IPDPS.2003.1213074(8)Online publication date: 2003
https://doi.org/10.1109/IPDPS.2003.1213074
Nikolopoulos DPolychronopoulos C(2003)Adaptive scheduling under memory constraints on non-dedicated computational farmsFuture Generation Computer Systems10.1016/S0167-739X(03)00031-119:4(505-519)Online publication date: 1-May-2003
https://dl.acm.org/doi/10.1016/S0167-739X%2803%2900031-1
Ryu KHollingsworth JKeleher PSlocomb C(2001)Efficient network and I/O throttling for fine-grain cycle stealingProceedings of the 2001 ACM/IEEE conference on Supercomputing10.1145/582034.582037(3-3)Online publication date: 10-Nov-2001
https://dl.acm.org/doi/10.1145/582034.582037
Ryu KHollingsworth J(2000)Exploiting Fine-Grained Idle Periods in Networks of WorkstationsIEEE Transactions on Parallel and Distributed Systems10.1109/71.87779311:7(683-698)Online publication date: 1-Jul-2000
https://dl.acm.org/doi/10.1109/71.877793

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

Resource Policing to Support Fine-Grain Cycle Stealing in Networks of Workstations

Exploiting Fine-Grained Idle Periods in Networks of Workstations

Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations