scientific article; zbMATH DE number 1863269
From MaRDI portal
Publication:4791892
zbMath1005.68618MaRDI QIDQ4791892
Jacek Błażewicz, Maciej Machowiak, Grégory Mounié, Denis Trystram
Publication date: 4 February 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2150/21500191
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computing methodologies and applications (68U99) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (4)
An effective approximation algorithm for the malleable parallel task scheduling problem ⋮ Competitive online scheduling of perfectly malleable jobs with setup times ⋮ A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time ⋮ A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
This page was built for publication:
