Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
On Scheduling Task-Graphs to LogP-Machines with Disturbances
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 2400/2002
Book
Euro-Par 2002 Parallel Processing
DOI
10.1007/3-540-45706-2
Copyright
2002
ISBN
978-3-540-44049-9
DOI
10.1007/3-540-45706-2_24
Pages
249-264
Subject Collection
Computer Science
SpringerLink Date
Tuesday, January 01, 2002
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (294.7 KB)
Free Preview
On Scheduling Task-Graphs to LogP-Machines with Disturbances
Welf Löwe
5
and Wolf Zimmermann
6
(5)
School of Mathematics and Systems Engineering Software Tech. Group, Växjö University, S-351 95 Växjö, Sweden
(6)
Institut für Informatik, Martin-Luther-Universität Halle-Wittenberg, D-06099 Halle/Saale, Germany
Abstract
We consider the problem of scheduling task-graphs to LogP-machines when the execution of the schedule may be delayed. If each time step in the schedule is delayed with a certain probability, we show that under LogP the expected execution time for a schedule
s
is at most
(
TIME
(
s
) where
TIME
(
s
) is the makespan of the schedule
s
.
Welf
Löwe
Email:
Welf.Lowe@msi.vxu.se
Wolf
Zimmermann
Email:
zimmer@informatik.uni-halle.de
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.109 • Server: mpweb02
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)