Search

Skip to main content Accessibility help

Home
Search

Only show content I have access to (0)

Articles (1)

Over 3 years (1)

From year:

To year:

Apply

Mathematics (1)

uncertaintycommunication delays.

RAIRO - Operations Research (1)

View selected items
Save to my bookmarks
Export citations
Download PDF (zip)
Save to Kindle
Save to Dropbox
Save to Google Drive
Save content to
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to .

To save content items to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Please be advised that item(s) you selected are not available.
You are about to save
Your Kindle email address

Please provide your Kindle email.

@free.kindle.com @kindle.com (service fees apply)

By using this service, you agree that you will only keep content for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services

1 results

Scheduling Precedence Task Graphs with Disturbances
Apurv Gupta, Gilles Parmentier, Denis Trystram
Journal:

RAIRO - Operations Research / Volume 37 / Issue 3 / July 2003

Published online by Cambridge University Press:

15 December 2003, pp. 145-156

Print publication:

July 2003
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation
In this paper we consider the problem of scheduling precedence task graphs inparallel processing where there can be disturbances in computation andcommunication times. Such a phenomenon often occurs in practice, due to ourinability to exactly predict the time because of system intrusion like cache miss and packet transmission time in mediums like ethernet etc. We propose a method based on the addition of some extra edges to protect the initial scheduling from performing badly due to such changes and provide an upper bound on theperformance guarantee for the scheduling algorithms. Moreover, this construction guarantees a result at least as goodas the result obtained for the initial static scheduling.We also show that this construction is a minimal set in context of partially on-line scheduling.