Skip to main content

Designing linear storage hierarchies so as to maximize reliability subject to cost and performance constraints

Publication ,  Conference
Trivedi, KS
Published in: Proceedings - International Symposium on Computer Architecture
May 6, 1980

A geometric programming model is proposed to determine the optimal design of the CPU and its matching storage hierarchy. The objective function is the maximization of system reliability subject to performance and budgetary limitations. Examples illustrating the use of the model are presented.

Duke Scholars

Published In

Proceedings - International Symposium on Computer Architecture

DOI

ISSN

1063-6897

Publication Date

May 6, 1980

Start / End Page

211 / 217
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Trivedi, K. S. (1980). Designing linear storage hierarchies so as to maximize reliability subject to cost and performance constraints. In Proceedings - International Symposium on Computer Architecture (pp. 211–217). https://doi.org/10.1145/800053.801928
Trivedi, K. S. “Designing linear storage hierarchies so as to maximize reliability subject to cost and performance constraints.” In Proceedings - International Symposium on Computer Architecture, 211–17, 1980. https://doi.org/10.1145/800053.801928.
Trivedi KS. Designing linear storage hierarchies so as to maximize reliability subject to cost and performance constraints. In: Proceedings - International Symposium on Computer Architecture. 1980. p. 211–7.
Trivedi, K. S. “Designing linear storage hierarchies so as to maximize reliability subject to cost and performance constraints.” Proceedings - International Symposium on Computer Architecture, 1980, pp. 211–17. Scopus, doi:10.1145/800053.801928.
Trivedi KS. Designing linear storage hierarchies so as to maximize reliability subject to cost and performance constraints. Proceedings - International Symposium on Computer Architecture. 1980. p. 211–217.

Published In

Proceedings - International Symposium on Computer Architecture

DOI

ISSN

1063-6897

Publication Date

May 6, 1980

Start / End Page

211 / 217