skip to content
Subtask deadline assignment for complex distributed soft real- time tasks Preview this item
ClosePreview this item
Checking...

Subtask deadline assignment for complex distributed soft real- time tasks

Author: Ben Kao; Hector Garcia-Molina; Stanford University. Computer Science Department.
Publisher: Stanford, Calif. : Stanford University, Dept. of Computer Science, [1993]
Series: Report (Stanford University. Computer Science Department), STAN- CS-93-1491.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
Abstract: "Complex distributed tasks often involve parallel execution of subtasks at different nodes. To meet the deadline of a global task, all of its parallel subtasks have to be finished on time. Comparing to a local task (which involves execution at only one node), a global task may have a much harder time making its deadline because it is fairly likely that at least one of its subtasks run into an overloaded  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Ben Kao; Hector Garcia-Molina; Stanford University. Computer Science Department.
OCLC Number: 31371865
Notes: Cover title.
"October 1993."
Description: 25 pages : illustrations ; 28 cm.
Series Title: Report (Stanford University. Computer Science Department), STAN- CS-93-1491.
Responsibility: by Ben Kao and Hector Garcia-Molina.

Abstract:

Abstract: "Complex distributed tasks often involve parallel execution of subtasks at different nodes. To meet the deadline of a global task, all of its parallel subtasks have to be finished on time. Comparing to a local task (which involves execution at only one node), a global task may have a much harder time making its deadline because it is fairly likely that at least one of its subtasks run into an overloaded node. Another problem with complex distributed tasks occurs when a global task consists of a number of serially executing subtasks. In this case, we have the problem of dividing up the end-to-end deadline of the global task and assigning them to the intermediate subtasks. In this paper, we study both of these problems. Different algorithms for assigning deadlines to subtasks are presented and evaluated."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/31371865>
library:oclcnum"31371865"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/31371865>
rdf:typeschema:Book
schema:about
schema:about
<http://id.worldcat.org/fast/895588>
rdf:typeschema:Intangible
schema:name"Distributed parameter systems"@en
schema:name"Distributed parameter systems."@en
schema:contributor
schema:contributor
<http://viaf.org/viaf/239748731>
rdf:typeschema:Organization
schema:name"Stanford University. Computer Science Department."
schema:creator
schema:datePublished"1993"
schema:description"Abstract: "Complex distributed tasks often involve parallel execution of subtasks at different nodes. To meet the deadline of a global task, all of its parallel subtasks have to be finished on time. Comparing to a local task (which involves execution at only one node), a global task may have a much harder time making its deadline because it is fairly likely that at least one of its subtasks run into an overloaded node. Another problem with complex distributed tasks occurs when a global task consists of a number of serially executing subtasks. In this case, we have the problem of dividing up the end-to-end deadline of the global task and assigning them to the intermediate subtasks. In this paper, we study both of these problems. Different algorithms for assigning deadlines to subtasks are presented and evaluated.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/476684537>
schema:inLanguage"en"
schema:name"Subtask deadline assignment for complex distributed soft real- time tasks"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.