skip to content
Deadline assignment in a distributed soft real-time system Preview this item
ClosePreview this item
Checking...

Deadline assignment in a distributed soft real-time system

Author: Ben Kao; Hector Garcia-Molina; Stanford University. Computer Science Department.
Publisher: Stanford, Calif. : Stanford University, Dept. of Computer Science, [1992]
Series: Report (Stanford University. Computer Science Department), STAN- CS-92-1452.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
Abstract: "In a distributed environment, tasks often have processing demands on multiple different sites. A distributed task is usually divided up into several subtasks, each one to be executed at some site in order. In a real-time system, an overall deadline is usually specified by an application designer indicating when a distributed task is to be finished. However, the problem of how a global deadline is  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: 28470704
Notes: Cover title.
"October 1992."
Description: 25 pages : illustrations ; 28 cm.
Series Title: Report (Stanford University. Computer Science Department), STAN- CS-92-1452.
Responsibility: by Ben Kao and Hector Garcia-Molina.

Abstract:

Abstract: "In a distributed environment, tasks often have processing demands on multiple different sites. A distributed task is usually divided up into several subtasks, each one to be executed at some site in order. In a real-time system, an overall deadline is usually specified by an application designer indicating when a distributed task is to be finished. However, the problem of how a global deadline is automatically translated to the deadline of each individual subtask has not been well studied. This paper examines (through simulations) four strategies for subtask deadline assignment in a distributed soft real-time environment."

Reviews

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

Tags

Be the first.

Similar Items

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/28470704>
library:oclcnum"28470704"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
schema:contributor
<http://viaf.org/viaf/239748731>
rdf:typeschema:Organization
schema:name"Stanford University. Computer Science Department."
schema:contributor
schema:creator
schema:datePublished"1992"
schema:description"Abstract: "In a distributed environment, tasks often have processing demands on multiple different sites. A distributed task is usually divided up into several subtasks, each one to be executed at some site in order. In a real-time system, an overall deadline is usually specified by an application designer indicating when a distributed task is to be finished. However, the problem of how a global deadline is automatically translated to the deadline of each individual subtask has not been well studied. This paper examines (through simulations) four strategies for subtask deadline assignment in a distributed soft real-time environment.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/476560603>
schema:inLanguage"en"
schema:isPartOf
schema:name"Deadline assignment in a distributed soft real-time system"@en
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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