March 1, 2005

Biobjective Scheduling Algorithms for Execution Time-Reliability Trade-off in Heterogeneous Computing Systems

Key Points

Key points are not available for this paper at this time.

Abstract

Journal Article Biobjective Scheduling Algorithms for Execution Time–Reliability Trade-off in Heterogeneous Computing Systems Get access Atakan Doğan, Atakan Doğan Search for other works by this author on: Oxford Academic Google Scholar Füsun Özgüner Füsun Özgüner Search for other works by this author on: Oxford Academic Google Scholar The Computer Journal, Volume 48, Issue 3, 2005, Pages 300–314, https://doi.org/10.1093/comjnl/bxh086 Published: 01 January 2005

Bookmark

Cite This Study

Atakan Doğan (Tue,) studied this question.

synapsesocial.com/papers/6a1feb5ad47ed904550da157 https://doi.org/https://doi.org/10.1093/comjnl/bxh086

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Matching and scheduling algorithms for minimizing execution time and failure probability of applications in heterogeneous computing2002 · 198 citations
2Introduction to Algorithms1991 · 17,033 citations
3A Comparative Analysis of Selection Schemes Used in Genetic Algorithms1991 · 2,400 citations
4Matching and scheduling of applications in heterogeneous computing systems with emphasis on high performance, reliability, and qos2001 · 3 citations
5A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures1993 · 887 citations

Bookmark