Article

Free access

Scheduling a mixed interactive and batch workload on a parallel, shared memory supercomputer

Authors:

I. Ashok,

J. ZahorjanAuthors Info & Claims

Supercomputing '92: Proceedings of the 1992 ACM/IEEE conference on Supercomputing

Pages 616 - 625

Published: 01 December 1992 Publication History

PDF eReader

References

[1]

Raphael Alonso and Andrew W. Appel. An Advisor for Flexible Working Sets. Proc. 1990 A CM SIG- METRICS Conf. on Meas. and Mod. of Cornp. Sys. (May 1990).

Digital Library

Google Scholar

[2]

L. Dowdy. On the Partitioning of Multiprocessor Systems. Dept. of Comp. Sci., Rep. 88-06, Vanderbilt Univ. (3uly 1988).

Google Scholar

[3]

David Getchell, and Mark K. Seager. Parallelism and Throughput in Multiprogrammed Shared Memory Supercomputers.

Google Scholar

[4]

L. Kleinrock. Queueing Systems, Vol. 1: Theory. John Wiley & Sons, 1975.

Digital Library

Google Scholar

[5]

R.Nelson, and D.Towsley. A Performance Evaluation of Several Priority Policies for Parallel Processing Systems. Research Report RC 15188, IBM (Nov 1989).

Google Scholar

[6]

M.F. Neuts. Matrix-Geometric Solutions in Stochastic Models, An Algorithmic Approach. The Johns- Hopkins University Press (1989).

Google Scholar

[7]

K.H.Park, and L.W.Dowdy. Dynamic Partitioning of Multiprocessor Systems. Intl, Jrnl. of Parallel Programming, Vol. 18, No. 2, 1989, pp 91-120.

Digital Library

Google Scholar

[8]

D. Patterson, G. Gibson, and R. Katz. A Case for Redundant Arrays of Inexpensive Disks (RAID). Proc. ACM SIGMOD Conf. (June 1986).

Digital Library

Google Scholar

[9]

K. Salem and H. Garcia-Molina. Disk Striping. IEEE 1986 Int. Conf. on Data Eng. (1986).

Digital Library

Google Scholar

[10]

Mark K. Seager. Private communication.

Google Scholar

[11]

Scott Shenker, and Abel Weinrib. Asymptotic Analysis of Large Heterogeneous Queueing Systems. Proc. 1988 A CM SIGMETRICS Con}. on Meas. and Mod. of Comp. Sys. (May 1988).

Digital Library

Google Scholar

[12]

Mark Squillante. MAGIC: A Computer Performance Modeling Tool Based on Matrix-Geometric Techniques. Fifth Intl. Conf. on Mod. Tech. and Tools for Perf. Eval., Torino (Feb. 1991).

Google Scholar

[13]

John Zahorjan, and Cathy McCann. Processor Scheduling in Shared Memory Multiprocessors. Proc. 1990 A CM SIGMETRICS Con}. on Meas. and Mod. o:f Comp. Sys. (May 1990).

Digital Library

Google Scholar

Cited By

View all

Chen YAlspaugh SBorthakur DKatz RFelber PBellosa FBos H(2012)Energy efficiency for large-scale MapReduce workloads with significant interactive analysisProceedings of the 7th ACM european conference on Computer Systems10.1145/2168836.2168842(43-56)Online publication date: 10-Apr-2012
https://dl.acm.org/doi/10.1145/2168836.2168842
Arpaci RDusseau AVahdat ALiu LAnderson TPatterson D(1995)The interaction of parallel and sequential workloads on a network of workstationsProceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems10.1145/223587.223618(267-278)Online publication date: 1-May-1995
https://dl.acm.org/doi/10.1145/223587.223618
Arpaci RDusseau AVahdat ALiu LAnderson TPatterson D(1995)The interaction of parallel and sequential workloads on a network of workstationsACM SIGMETRICS Performance Evaluation Review10.1145/223586.22361823:1(267-278)Online publication date: 1-May-1995
https://dl.acm.org/doi/10.1145/223586.223618

Index Terms

Scheduling a mixed interactive and batch workload on a parallel, shared memory supercomputer

Recommendations

Single machine parallel-batch scheduling with deteriorating jobs

We consider several single machine parallel-batch scheduling problems in which the processing time of a job is a linear function of its starting time. We give a polynomial-time algorithm for minimizing the maximum cost, an O(n⁵) time algorithm for ...
Parallel Machine Scheduling with Batch Setup Times

<P>We consider a problem of scheduling several batches of jobs on two identical parallel machines to minimize the total completion time of jobs. A setup time is incurred whenever there is a switch from processing a job in one batch to a job in another ...
Bounded parallel-batch scheduling on unrelated parallel machines
AAIM'10: Proceedings of the 6th international conference on Algorithmic aspects in information and management

In this paper, we consider the bounded parallel-batch scheduling problem on unrelated parallel machines. Problems R_m|B|F are NP-hard for any objective function F. For this reason, we discuss the special case with p_ij = p_i for i = 1, 2, ..., m, j = 1, 2, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Supercomputing '92: Proceedings of the 1992 ACM/IEEE conference on Supercomputing

December 1992

872 pages

ISBN:0818626305

Editor:
Robert Werner

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 01 December 1992

Check for updates

Qualifiers

Article

Conference

SC '92

Sponsor:

SIGARCH
IEEE-CS

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

November 16 - 20, 1992

Minnesota, Minneapolis, USA

Acceptance Rates

Supercomputing '92 Paper Acceptance Rate 75 of 220 submissions, 34%;

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
189
Total Downloads

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

Reflects downloads up to 16 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chen YAlspaugh SBorthakur DKatz RFelber PBellosa FBos H(2012)Energy efficiency for large-scale MapReduce workloads with significant interactive analysisProceedings of the 7th ACM european conference on Computer Systems10.1145/2168836.2168842(43-56)Online publication date: 10-Apr-2012
https://dl.acm.org/doi/10.1145/2168836.2168842
Arpaci RDusseau AVahdat ALiu LAnderson TPatterson D(1995)The interaction of parallel and sequential workloads on a network of workstationsProceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems10.1145/223587.223618(267-278)Online publication date: 1-May-1995
https://dl.acm.org/doi/10.1145/223587.223618
Arpaci RDusseau AVahdat ALiu LAnderson TPatterson D(1995)The interaction of parallel and sequential workloads on a network of workstationsACM SIGMETRICS Performance Evaluation Review10.1145/223586.22361823:1(267-278)Online publication date: 1-May-1995
https://dl.acm.org/doi/10.1145/223586.223618

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

Single machine parallel-batch scheduling with deteriorating jobs

Parallel Machine Scheduling with Batch Setup Times

Bounded parallel-batch scheduling on unrelated parallel machines