Narrow your search

Library

KBR (2)

ULiège (2)

UCLouvain (1)

UGent (1)


Resource type

book (2)


Language

English (2)


Year
From To Submit

1995 (2)

Listing 1 - 2 of 2
Sort by
The complexity of simple computer architectures
Authors: ---
ISBN: 3540605800 3540477748 Year: 1995 Volume: 995 Publisher: Berlin : Springer-Verlag,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book presents a formal model for evaluating the cost effectiveness of computer architectures. The model can cope with a wide range of architectures, from CPU design to parallel supercomputers. To illustrate the formal procedure of trade-off analyses, several non-pipelined design alternatives for the well-known RISC architecture called DLX are analyzed quantitatively. It is formally proved that the interrupt mechanism proposed for the DLX architecture handles nested interrupts correctly. In an appendix all programs to compute the cost and cycle time of the designs described are listed in C code. Running these simple C programs on a PC is sufficient to verify the results presented. The book addresses design professionals and students in computer architecture.

Theory, practice and experience. Second international conference, TPCD 94, Bad Herrenalb, Germany, September 1994. Proceedings
Authors: ---
ISBN: 3540590471 3540491775 9783540590477 Year: 1995 Volume: 901 Publisher: Berlin : Springer-Verlag,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This volume presents the proceedings of the Second International Conference on Theorem Provers in Circuit Design (TPCD '94) jointly organized by the Forschungszentrum Informatik (University of Karlsruhe) and IFIP Working Group 10.2 in Bad Herrenalb, Germany in September 1994. The 19 papers included are thoroughly revised versions of the submissions selected for presentation at the conference and address all current aspects of theorem provers in circuit design. Particular emphasis is given to benchmark-circuits for hardware verification; tutorials on two popular theorem provers are included.

Listing 1 - 2 of 2
Sort by