Article

Minimizing the stretch when scheduling flows of biological requests

Authors:

Arnaud Legrand,

Frédéric VivienAuthors Info & Claims

SPAA '06: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures

Pages 103 - 112

https://doi.org/10.1145/1148109.1148124

Published: 30 July 2006 Publication History

Abstract

In this paper, we consider the problem of scheduling distributed biological sequence comparison applications. This problem lies in the divisible load framework with negligible communication costs. Thus far, very few results have been proposed in this model. We discuss and select relevant metrics for this framework: namely max-stretch and sumstretch. We explain the relationship between our model and the preemptive uni-processor case, and we show how to extend algorithms that have been proposed in the literature for the uni-processor model to the divisible multi-processor problem domain. We recall known results on closely related problems, derive new lower bounds on the competitive ratio of any on-line algorithm, present new competitiveness results for existing algorithms, and develop several new online heuristics. Then, we extensively study the performance of these algorithms and heuristics in realistic scenarios. Our study shows that all previously proposed guaranteed heuristics for max-stretch for the uni-processor model prove to be particularly inefficient in practice. In contrast, we show our on-line algorithms based on linear programming to be nearoptimal solutions for max-stretch. Our study also clearly suggests heuristics that are efficient for both metrics, although a combined optimization is in theory not possible in the general case.

References

[1]

K. Baker. Introduction to Sequencing and Scheduling. Wiley, New York, 1974.

[2]

K. Baker, E. Lawler, J. Lenstra, and A. R. Kan. Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints. Operations Research, 31(2):381--386, Mar. 1983.

Digital Library

[3]

M. A. Bender, S. Chakrabarti, and S. Muthukrishnan. Flow and stretch metrics for scheduling continuous job streams. In Proceedings of the 9th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA'98), pages 270--279. ACM press, 1998.

Digital Library

[4]

M. A. Bender, S. Muthukrishnan, and R. Rajaraman. Improved algorithms for stretch scheduling. In SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pages 762--771, Philadelphia, PA, USA, 2002. Society for Industrial and Applied Mathematics.

Digital Library

[5]

M. A. Bender, S. Muthukrishnan, and R. Rajaraman. Approximation algorithms for average stretch scheduling. J.of Scheduling, 7(3):195--222, 2004.

Digital Library

[6]

C. Blanchet, C. Combet, C. Geourjon, and G. Deléage. MPSA: Integrated System for Multiple Protein Sequence Analysis with client/server capabilities. Bioinformatics, 16(3):286--287, 2000.

[7]

C. Chekuri and S. Khanna. Approximation schemes for preemptive weighted flow time. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pages 297--305. ACM Press, 2002.

Digital Library

[8]

GriPPS webpage at http://gripps.ibcp.fr/, 2005.

[9]

J. Labetoulle, E. L. Lawler, J. Lenstra, and A. Rinnooy Kan. Preemptive scheduling of uniform machines subject to release dates. In W. R. Pulleyblank, editor, Progress in Combinatorial Optimization, pages 245--261. Academic Press, 1984.

[10]

A. Legrand, L. Marchal, and H. Casanova. Scheduling Distributed Applications: The SimGrid Simulation Framework. In Proceedings of the 3rd IEEE Symposium on Cluster Computing and the Grid, 2003.

Digital Library

[11]

A. Legrand, A. Su, and F. Vivien. Minimizing the stretch when scheduling flows of biological requests. Research report RR2005-48, École Normale Supérieure de Lyon, Oct. 2005.

[12]

A. Legrand, A. Su, and F. Vivien. Off-line scheduling of divisible requests on an heterogeneous collection of databanks. In Proceedings of the 14th Heterogeneous Computing Workshop, Denver, Colorado, USA, Apr. 2005. IEEE Computer Society Press.

Digital Library

[13]

A. Legrand, A. Su, and F. Vivien. Minimizing the stretch when scheduling flows of divisible requests. Research Report RR2006-19, LIP, École Normale Supérieure de Lyon, June 2006.

[14]

N. Megow. Performance analysis of on-line algorithms in machine scheduling. Diplomarbeit, Technische Universität Berlin, Apr. 2002.

[15]

S. Muthukrishnan, R. Rajaraman, A. Shaheen, and J. Gehrke. Online scheduling to minimize average stretch. In IEEE Symposium on Foundations of Computer Science, pages 433--442, 1999.

Digital Library

[16]

A. S. Schulz and M. Skutella. The power of α-points in preemptive single machine scheduling. Journal of Scheduling, 5(2):121--133, 2002.

[17]

W. E. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59--66, 1956.

Cited By

Dwibedy DMohanty R(2022)A New Fairness Model Based on User’s Objective for Multi-user Multi-processor Online Scheduling ProblemEdge Analytics10.1007/978-981-19-0019-8_34(453-465)Online publication date: 4-Apr-2022
https://doi.org/10.1007/978-981-19-0019-8_34
Ganapathy M(2019)Divisible Load Scheduling from Single Source in Distributed EnvironmentsSustainable Communication Networks and Application10.1007/978-3-030-34515-0_37(343-350)Online publication date: 7-Nov-2019
https://doi.org/10.1007/978-3-030-34515-0_37
Ganapathy M(2019)Single Source Divisible Load Scheduling on Distributed Heterogeneous EnvironmentsInventive Computation Technologies10.1007/978-3-030-33846-6_68(637-645)Online publication date: 3-Nov-2019
https://doi.org/10.1007/978-3-030-33846-6_68
Show More Cited By

Index Terms

Minimizing the stretch when scheduling flows of biological requests
1. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
    2. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Recommendations

Minimizing the stretch when scheduling flows of divisible requests

In this paper, we consider the problem of scheduling distributed biological sequence comparison applications. This problem lies in the divisible load framework with negligible communication costs. Thus far, very few results have been proposed for this ...
Online Scheduling to Minimize Average Stretch

We consider the classical problem of online job scheduling on uniprocessor and multiprocessor machines. For a given job, we measure the quality of service provided by an algorithm by the stretch of the job, which is defined as the ratio of the amount ...
Online Scheduling to Minimize Average Stretch
FOCS '99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science

We consider the classical problem of online job scheduling on uniprocessor and multiprocessor machines. For a given job, we measure the quality of service provided by an algorithm by the stretch of the job, which is defined as the ratio of the amount of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '06: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures

July 2006

344 pages

ISBN:1595934529

DOI:10.1145/1148109

General Chair:
Phillip B. Gibbons
Intel Research, USA
,
Program Chair:
Uzi Vishkin
UMIACS, University of Maryland, USA

Copyright © 2006 ACM.

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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 July 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SPAA06

Sponsor:

SPAA06: 18th ACM Symposium on Parallelism in Algorithms and Architectures 2006

July 30 - August 2, 2006

Massachusetts, Cambridge, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
1,669
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)1

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Dwibedy DMohanty R(2022)A New Fairness Model Based on User’s Objective for Multi-user Multi-processor Online Scheduling ProblemEdge Analytics10.1007/978-981-19-0019-8_34(453-465)Online publication date: 4-Apr-2022
https://doi.org/10.1007/978-981-19-0019-8_34
Ganapathy M(2019)Divisible Load Scheduling from Single Source in Distributed EnvironmentsSustainable Communication Networks and Application10.1007/978-3-030-34515-0_37(343-350)Online publication date: 7-Nov-2019
https://doi.org/10.1007/978-3-030-34515-0_37
Ganapathy M(2019)Single Source Divisible Load Scheduling on Distributed Heterogeneous EnvironmentsInventive Computation Technologies10.1007/978-3-030-33846-6_68(637-645)Online publication date: 3-Nov-2019
https://doi.org/10.1007/978-3-030-33846-6_68
Kim JQuang BRho SKim SKim SBreton VHwang S(2017)Towards effective scheduling policies for many‐task applications: Practice and experience based on HTCaaSConcurrency and Computation: Practice and Experience10.1002/cpe.424229:21Online publication date: 24-Aug-2017
https://doi.org/10.1002/cpe.4242
Gasior JSeredynski F(2015)Dynamic Job Scheduling in the Cloud Using Slowdown Optimization and Sandpile Cellular Automata ModelProceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop10.1109/IPDPSW.2015.139(276-285)Online publication date: 25-May-2015
https://dl.acm.org/doi/10.1109/IPDPSW.2015.139
Celaya JArronategui U(2015)Fair scheduling of bag-of-tasks applications on large-scale platformsFuture Generation Computer Systems10.1016/j.future.2015.03.00249:C(28-44)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.1016/j.future.2015.03.002
Lin H(2014)A Course Scheduling Algorithm Based on Network FlowApplied Mechanics and Materials10.4028/www.scientific.net/AMM.644-650.2081644-650(2081-2083)Online publication date: Sep-2014
https://doi.org/10.4028/www.scientific.net/AMM.644-650.2081
Emeras JPinheiro VRzadca KTrystram D(2014)OStrich: Fair Scheduling for Multiple SubmissionsParallel Processing and Applied Mathematics10.1007/978-3-642-55195-6_3(26-37)Online publication date: 8-May-2014
https://doi.org/10.1007/978-3-642-55195-6_3
Quang BQuang NMedernach EBreton VLong PQuyet TThanh BVan TBui MHong S(2013)Stretch optimization for virtual screening on multi-user pilot-agent platforms on grid/cloudProceedings of the 4th Symposium on Information and Communication Technology10.1145/2542050.2542063(301-310)Online publication date: 5-Dec-2013
https://dl.acm.org/doi/10.1145/2542050.2542063
Quang BQuang NMedernach EBreton V(2013)Scheduling of virtual screening application on multi-user pilot-agent platform on grid/cloud to optimize the stretchProceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics10.1145/2506583.2512369(692-693)Online publication date: 22-Sep-2013
https://dl.acm.org/doi/10.1145/2506583.2512369
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents