Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks

Local TagsRelease HistoryDetailsSummary

Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks

Jansen, K., & Porkolab, L. (2002). Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks. Algorithmica, 32, 507-520.

Item is Released

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2FD0-2 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2FD1-F

Genre: Journal Article

show

show

hide

Creators:
Jansen, Klaus¹, Author
Porkolab, Lorant¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

show

show

hide

Language(s): eng - English

Dates: Modified: 2003-09-24Date issued: 2002

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 202063
Other: Local-ID: C1256428004B93B8-E394746B381F8BBAC1256DAB0049510E-JansenPorkolab2002

Degree: -

show

show

show

show

hide

Title: Algorithmica

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 32 Sequence Number: - Start / End Page: 507 - 520 Identifier: ISSN: 0178-4617