Article

Optimally work-competitive scheduling for cooperative computing with merging groups

Authors:

Chryssis Georgiou,

Alexander Russell,

Alex A. ShvartsmanAuthors Info & Claims

PODC '02: Proceedings of the twenty-first annual symposium on Principles of distributed computing

Page 132

https://doi.org/10.1145/571825.571848

Published: 21 July 2002 Publication History

Get Access

Abstract

No abstract available.

References

[1]

C. Georgiou, A. Russell, and A. A. Shvartsman. Optimally work-competitive scheduling for cooperative computing with merging groups. At http://www.engr.uconn.edu/~cg2/GRSmerges.ps.

Google Scholar

[2]

C. Georgiou and A. Shvartsman. Cooperative computing with fragmentable and mergeable groups. Journal of Discrete Algorithms. Accepted for publication. (Also in SIROCCO 2000, pages 141-156.)

Digital Library

Google Scholar

[3]

G. Malewicz, A. Russell, and A. A. Shvartsman. Distributed cooperation during the absence of communication. In DISC 2000, pages 119-133.

Digital Library

Google Scholar

[4]

Special Issue on Group Communication Services, volume 39(4) of CACM, 1996.

Google Scholar

[5]

D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. CACM, 28(2):202-208, 1985.

Digital Library

Google Scholar

Cited By

View all

Georgiou CRussell AShvartsman ALarmore LGoemans M(2003)Work-competitive scheduling for cooperative computing with dynamic groupsProceedings of the thirty-fifth annual ACM symposium on Theory of computing10.1145/780542.780581(251-258)Online publication date: 9-Jun-2003
https://dl.acm.org/doi/10.1145/780542.780581
Georgiou CRussell AShvartsman AGoldin DShvartsman ASmolka SVitter JZdonik S(2003)distributed cooperation and adversityProceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday10.1145/778348.778358(60-71)Online publication date: 8-Jun-2003
https://dl.acm.org/doi/10.1145/778348.778358

Recommendations

Competitive Two-Agent Scheduling and Its Applications

We consider a scheduling environment with m (m ≥ 1) identical machines in parallel and two agents. Agent A is responsible for n₁ jobs and has a given objective function with regard to these jobs; agent B is responsible for n₂ jobs and has an objective ...
Single Machine Scheduling to Minimize Total Late Work

<P>In the problem of scheduling a single machine to minimize total late work, there are n jobs to be processed for which each has an integer processing time and a due date. The objective is to minimize the total late work, where the late work for a job ...
Competitive algorithms for due date scheduling
ICALP'07: Proceedings of the 34th international conference on Automata, Languages and Programming

We consider several online scheduling problems that arise when customers request make-to-order products from a company. At the time of the order, the company must quote a due date to the customer. To satisfy the customer, the company must produce the ...

Comments

Information & Contributors

Information

Published In

PODC '02: Proceedings of the twenty-first annual symposium on Principles of distributed computing

July 2002

307 pages

ISBN:1581134851

DOI:10.1145/571825

Conference Chair:
Aleta Ricciardi
Valaran Corp.

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: 21 July 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC02

Sponsor:

PODC02: Principles of Distributed Computing

July 21 - 24, 2002

California, Monterey

Acceptance Rates

PODC '02 Paper Acceptance Rate 43 of 149 submissions, 29%;

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
182
Total Downloads

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

Reflects downloads up to 14 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Georgiou CRussell AShvartsman ALarmore LGoemans M(2003)Work-competitive scheduling for cooperative computing with dynamic groupsProceedings of the thirty-fifth annual ACM symposium on Theory of computing10.1145/780542.780581(251-258)Online publication date: 9-Jun-2003
https://dl.acm.org/doi/10.1145/780542.780581
Georgiou CRussell AShvartsman AGoldin DShvartsman ASmolka SVitter JZdonik S(2003)distributed cooperation and adversityProceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday10.1145/778348.778358(60-71)Online publication date: 8-Jun-2003
https://dl.acm.org/doi/10.1145/778348.778358

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.

Cited By

Recommendations

Competitive Two-Agent Scheduling and Its Applications

Single Machine Scheduling to Minimize Total Late Work

Competitive algorithms for due date scheduling

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Recommendations

Competitive Two-Agent Scheduling and Its Applications

Single Machine Scheduling to Minimize Total Late Work

Competitive algorithms for due date scheduling

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations