Article

Free access

Scheduling constrained dynamic applications on clusters

Authors:

Umakishore RamachandranAuthors Info & Claims

SC '99: Proceedings of the 1999 ACM/IEEE conference on Supercomputing

Pages 46 - es

https://doi.org/10.1145/331532.331578

Published: 01 January 1999 Publication History

PDF eReader

References

[1]

B. N. Bershad, M. J. Zekauskas, and W. A. Sawdon. The Midway Distributed Shared Memory System. In Proceedings of the IEEE CompCon Conference, 1993. Also CMU Technical Report CMU-CS-93- 119.]]

Digital Library

Google Scholar

[2]

A. D. Christian and B. L. Avery. Digital Smart Kiosk Project. In ACM SIGCHI '98, pages 155-162, Los Angeles, CA, April 18-23 1998.]]

Digital Library

Google Scholar

[3]

Proc. of Third Intl. Conf. on Automatic Face and Gesture Recognition, Nara, Japan, April 14-16 1998. IEEE Computer Society.]]

Google Scholar

[4]

R. S. Nikhil. Parallel Symbolic Computing in Cid. In Proc. Intl. Wkshp. on Parallel Symbolic Languages and Systems, pages 217-242, October 1995.]]

Digital Library

Google Scholar

[5]

R. S. Nikhil, U. Ramachandran, J. M. Rehg, R. H. Halstead, Jr., C. F. Joerg, and L. Kontothanassis. Stampede: A Programming System for Emerging Scalable Interactive Multimedia Applications. In Proc. Eleventh Intl. Wkshp. on Languages and Compilers for Parallel Computing, Chapel Hill NC, Aug. 7-9 1998. See also Technical Report 98/1, Cambridge Research Lab., Compaq Computer Corp.]]

Digital Library

Google Scholar

[6]

M. Pinedo. Scheduling: Theory, Algorithms, and Systems. Prentice Hall, 1995.]]

Digital Library

Google Scholar

[7]

S. Prasanna. Compilation of Parallel Multimedia Computations - Extended Retiming Theory and Amdahls's Law. Sixth ACM SIGPLAN Symposium on Principles and Practice of Praallel Programming, June 1997.]]

Digital Library

Google Scholar

[8]

U. Ramachandran, R. S. Nikhil, N. Harel, J. M. Rehg, and K. Knobe. Space-Time Memory: A Parallel Programming Abstration for Interactive Multimedia PApplications. In Seventh ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Atlanta, GA, May 4-6 1999.]]

Digital Library

Google Scholar

[9]

J. M. Rehg, K. Knobe, U. Ramachandran, R. S. Nikhil, and A. Chauhan. Integrated Task and Data Parallel Support for Dynamic Applications. In D. O'Hallaron, editor, Fourth Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers, pages 167-180, Pittsburgh, PA, May 28-30 1998. Springer Verlag.]]

Digital Library

Google Scholar

[10]

J. M. Rehg, K. Knobe, U. Ramachandran, R. S. Nikhil, and A. Chauhan. Integrated Task and Data Parallel Support for Dynamic Applications. Scientific Programming, 1999. To appear.]]

Digital Library

Google Scholar

[11]

J. M. Rehg, M. Loughlin, and K. Waters. Vision for a Smart Kiosk. In Computer Vision and Pattern Recognition, pages 690-696, San Juan, Puerto Rico, 1997.]]

Digital Library

Google Scholar

[12]

J. M. Rehg, U. Ramachandran, R. H. Halstead, Jr., C. Joerg, L. Kontothanassis, and R. S. Nikhil. Space-Time Memory: A Parallel Programming Abstraction for Dynamic Vision Applications. Technical Report CRL 97/2, Digital Equipment Corp. Cambridge Research Lab, April 1997.]]

Google Scholar

[13]

J. Subhlok and G. Vondran. Optimal Latency-Throughput Tradeoffs for Data parallel Pipelines. Proc. 8th Symposium on Parallel Algorithms and Architecture (SPAA), June 1996.]]

Digital Library

Google Scholar

[14]

M. Swain and D. Ballard. Color Indexing. Intl J. of Computer Vision, 7(1):11-32, 1991.]]

Digital Library

Google Scholar

[15]

K. Waters and T. Levergood. An Automatic Lip-Synchronization Algorithm for Synthetic Faces. Multimedia Tools and Applications, 1(4):349-366, Nov 1995.]]

Google Scholar

[16]

K. Waters, J. M. Rehg, M. Loughlin, S. B. Kang, and D. Terzopoulos. Visual Sensing of Humans for Active Public Interfaces. In Computer Vision for Human-Machine Interaction, pages 83-96. Cambridge University Press, 1998.]]

Google Scholar

Cited By

View all

Barbut QBenoit AHerault TRobert YVivien F(2023)When to checkpoint at the end of a fixed-length reservation?Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis10.1145/3624062.3624115(467-476)Online publication date: 12-Nov-2023
https://dl.acm.org/doi/10.1145/3624062.3624115
Du YMarchal LPallez GRobert Y(2022)Optimal Checkpointing Strategies for Iterative ApplicationsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2021.309944033:3(507-522)Online publication date: 1-Mar-2022
https://doi.org/10.1109/TPDS.2021.3099440
Benoit AÇatalyürek ÜRobert YSaule E(2013)A survey of pipelined workflow schedulingACM Computing Surveys10.1145/2501654.250166445:4(1-36)Online publication date: 30-Aug-2013
https://dl.acm.org/doi/10.1145/2501654.2501664
Show More Cited By

Recommendations

Dynamic Job Scheduling on Heterogeneous Clusters
ISPDC '09: Proceedings of the 2009 Eighth International Symposium on Parallel and Distributed Computing

This paper addresses the problem of scheduling dynamicallymulti-user and independent jobs on clusters, both homogeneous and heterogeneous. The dynamic behaviormeans that the scheduler is able to adapt the schedulingwhen new jobs are submitted and also ...
Approximation schemes for constrained scheduling problems
SFCS '89: Proceedings of the 30th Annual Symposium on Foundations of Computer Science

Several constrained scheduling problems are considered. The first polynomial approximation schemes for the problem of minimizing maximum completion time in a two-machine flow shop with release dates and for the problem of minimizing maximum lateness for ...
Dynamic scheduling of a batch of parallel task jobs on heterogeneous clusters

This paper addresses the problem of minimizing the scheduling length (make-span) of a batch of jobs with different arrival times. A job is described by a direct acyclic graph (DAG) of parallel tasks. The paper proposes a dynamic scheduling method that ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SC '99: Proceedings of the 1999 ACM/IEEE conference on Supercomputing

January 1999

1015 pages

ISBN:1581130910

DOI:10.1145/331532

General Chair:
Cherri Pancake

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

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SC '99

Sponsor:

SIGARCH
IEEE-CS

SC '99: International Conference for High Performance Computing, Networking, Storage and Analysis

November 14 - 19, 1999

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
325
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Barbut QBenoit AHerault TRobert YVivien F(2023)When to checkpoint at the end of a fixed-length reservation?Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis10.1145/3624062.3624115(467-476)Online publication date: 12-Nov-2023
https://dl.acm.org/doi/10.1145/3624062.3624115
Du YMarchal LPallez GRobert Y(2022)Optimal Checkpointing Strategies for Iterative ApplicationsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2021.309944033:3(507-522)Online publication date: 1-Mar-2022
https://doi.org/10.1109/TPDS.2021.3099440
Benoit AÇatalyürek ÜRobert YSaule E(2013)A survey of pipelined workflow schedulingACM Computing Surveys10.1145/2501654.250166445:4(1-36)Online publication date: 30-Aug-2013
https://dl.acm.org/doi/10.1145/2501654.2501664
Chen MMummert LPillai PHauptmann ASukthankar RFeng WMayer-Patel K(2010)Exploiting multi-level parallelism for low-latency activity recognition in streaming videoProceedings of the first annual ACM SIGMM conference on Multimedia systems10.1145/1730836.1730838(1-12)Online publication date: 22-Feb-2010
https://dl.acm.org/doi/10.1145/1730836.1730838
Pillai PMummert LSchlosser SSukthankar RHelfrich COoi WXu D(2009)SLIPstreamProceedings of the 18th international workshop on Network and operating systems support for digital audio and video10.1145/1542245.1542256(43-48)Online publication date: 3-Jun-2009
https://dl.acm.org/doi/10.1145/1542245.1542256
Mandviwala HHarel NRamachandran UKnobe K(2005)Adaptive Resource Utilization via Feedback Control for Streaming ApplicationsProceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 0110.1109/IPDPS.2005.81Online publication date: 4-Apr-2005
https://dl.acm.org/doi/10.1109/IPDPS.2005.81
Paul AHarel NAdhikari SAgarwalla BRamachandran UMackenzie K(2003)Performance study of a cluster runtime system for dynamic interactive stream-oriented applications2003 IEEE International Symposium on Performance Analysis of Systems and Software. ISPASS 2003.10.1109/ISPASS.2003.1190240(133-142)Online publication date: 2003
https://doi.org/10.1109/ISPASS.2003.1190240
Taura KChien A(2000)A heuristic algorithm for mapping communicating tasks on heterogeneous resourcesProceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)10.1109/HCW.2000.843736(102-115)Online publication date: 2000
https://doi.org/10.1109/HCW.2000.843736

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

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

Dynamic Job Scheduling on Heterogeneous Clusters

Approximation schemes for constrained scheduling problems

Dynamic scheduling of a batch of parallel task jobs on heterogeneous clusters