Correction of an Augmentation Bound Analysis for Parallel Real-Time Tasks

Authors

Abusayeed Saifullah, Washington University in St Louis
Kunal Agrawal, Washington University in St LouisFollow
Chenyang Lu, Washington University in St LouisFollow
Christopher Gill, Washington University in St. LouisFollow

Document Type

Technical Report

Department

Computer Science and Engineering

Publication Date

2012

Filename

WUCSE-2012-24.pdf

Technical Report Number

WUCSE-2012-24

Abstract

This paper proposes some significant corrections in a recent work of Lakshmanan et al on parallel task scheduling. Lakshmanan et al have proposed a transformation of parallel tasks into sequential tasks, and have claimed a resource augmentation bound of 3:42 for partitioned deadline monotonic (DM) scheduling of the transformed tasks. We demonstrate that their analysis for resource augmentation bound is incorrect. We propose a different technique for task transformation that requires a resource augmentation bound of 5 for partitioned DM scheduling.

Comments

Permanent URL: http://dx.doi.org/10.7936/K7S75DK8

Recommended Citation

Saifullah, Abusayeed; Agrawal, Kunal; Lu, Chenyang; and Gill, Christopher, "Correction of an Augmentation Bound Analysis for Parallel Real-Time Tasks" Report Number: WUCSE-2012-24 (2012). All Computer Science and Engineering Research.
https://openscholarship.wustl.edu/cse_research/75