Information Processing Letters

2007

DOI: 10.1016/j.ipl.2007.01.005

|View full text |Cite

|

Sign up to set email alerts

|

Maximizing the throughput of parallel jobs on hypercubes

¹

,

²

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

0

Mentioning

1

Contrasting

0

Year Published

2009

2009

2012

2012

Publication Types

Select...

Book2

Article1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 12 publications

Supporting

0

Mentioning

1

Contrasting

0

Order By: Relevance

“…Nevertheless, polynomial algorithms are known only for a couple of special cases. One can maximize the number of completed jobs if all the release times are equal, see [3]. This was generalized to the case of nested intervals given by the release times and the deadlines, see [4].…”

Section: Introductionmentioning

confidence: 99%

Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput

¹

,

²

,

³

2010

Parallel Processing and Applied Mathematics

View full text Add to dashboard Cite

Abstract. We study the online problem of scheduling unit-time parallel jobs on hypercubes. A parallel job has to be scheduled between its release time and deadline on a subcube of processors. The objective is to maximize the number of early jobs. We provide a 1.6-competitive algorithm for the problem and prove that no deterministic algorithm is better than 1.4-competitive.

“…Nevertheless, polynomial algorithms are known only for a couple of special cases. One can maximize the number of completed jobs if all the release times are equal, see [3]. This was generalized to the case of nested intervals given by the release times and the deadlines, see [4].…”

Section: Introductionmentioning

confidence: 99%

Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput

¹

,

²

,

³

2010

Parallel Processing and Applied Mathematics

View full text Add to dashboard Cite

Abstract. We study the online problem of scheduling unit-time parallel jobs on hypercubes. A parallel job has to be scheduled between its release time and deadline on a subcube of processors. The objective is to maximize the number of early jobs. We provide a 1.6-competitive algorithm for the problem and prove that no deterministic algorithm is better than 1.4-competitive.

Open Problems in Throughput Scheduling

¹

2012

Algorithms – ESA 2012

View full text Add to dashboard Cite

No abstract

A Note on Scheduling Parallel Unit Jobs on Hypercubes

¹

2009

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

We study the problem of scheduling independent unit-time parallel jobs on hypercubes. A parallel job has to be scheduled between its release time and deadline on a subcube of processors. The objective is to maximize the number of early jobs. Jobs' intervals of feasibility have to be nested. We provide a polynomial time algorithm for the problem.

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Product

Browser Extension Assistant by scite Citation Statement Search Reference Check Visualizations Dashboards Explore Journals Explore Organizations Explore Funders Embedding Badge Embedding Citation Search Pricing

Resources

Blog Help & FAQ Accessibility Statement API Terms For Universities & Governments For Researchers For Publishers For Corporate, Pharma & Enterprise Author Marketing Become an Affiliate Get an organization trial or quote scite Data & Services

About

News & Press Careers Read our Paper Coverage

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Copyright © 2024 scite LLC. All rights reserved.

Made with 💙 for researchers

Part of the Research Solutions Family.