بلیان

چه کسانی این کتاب را می‌خوانند

دانشجوعلاقه‌مند یادگیری
کتابخوان حرفه‌ایلذت مطالعه
نویسندهالهام‌گیری

The Complexity of Simple Computer Architectures (Lecture Notes in Computer Science, 995)

Silvia M. Müller, Wolfgang J. Paul (eds.)

قیمت نهایی

۴۴٬۰۰۰ تومان۴۹٬۰۰۰ تومان۱۰٪ تخفیف
  • تخفیف زمان‌دار−۵٬۰۰۰ تومان

۵٬۰۰۰ تومان صرفه‌جویی نسبت به قیمت اصلی

نسخه اصلی و اورجینال

بلافاصله پس از خرید، فایل کتاب روی دستگاه شما آمادهٔ دانلود است.

تحویل فوری
پرداخت امن
ضمانت فایل
پشتیبانی

مشخصات کتاب

نویسنده
Silvia M. Müller, Wolfgang J. Paul (eds.)
ناشر
Springer-Verlag Berlin Heidelberg
سال انتشار
۱۹۹۵
فرمت
PDF
زبان
انگلیسی
حجم فایل
۱۱٫۷ مگابایت
شابک
9783540477747، 9783540605805، 3540477748، 3540605800

دربارهٔ کتاب

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.

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.

Introduction....Pages 1-3 The formal architecture model....Pages 5-20 Functional modules....Pages 21-42 Hardwired control....Pages 43-58 Design of a minimal CPU....Pages 59-75 Design of the DLX machine....Pages 77-122 Trade-off analyses....Pages 123-140 Interrupt....Pages 141-178 Microprogrammed control....Pages 179-198 Further applications of the architecture model....Pages 199-199

کتاب‌های مشابه

The Complexity of Simple Computer Architectures (Lecture Notes in Computer Science, 995)

The Complexity of Simple Computer Architectures (Lecture Notes in Computer Science, 995)

۴۹٬۰۰۰ تومان

The Complexity of Simple Computer Architectures (Lecture Notes in Computer Science, 995)

The Complexity of Simple Computer Architectures (Lecture Notes in Computer Science, 995)

۴۹٬۰۰۰ تومان

Architecture Of Distributed Computer Systems (lecture Notes In Computer Science)

Architecture Of Distributed Computer Systems (lecture Notes In Computer Science)

۴۹٬۰۰۰ تومان

Architecture Of Distributed Computer Systems (lecture Notes In Computer Science)

Architecture Of Distributed Computer Systems (lecture Notes In Computer Science)

۴۹٬۰۰۰ تومان

Notes on Computational Complexity Theory [lecture notes]

Notes on Computational Complexity Theory [lecture notes]

۴۹٬۰۰۰ تومان

Randomness and Completeness in Computational Complexity (Lecture Notes in Computer Science, 1950)

Randomness and Completeness in Computational Complexity (Lecture Notes in Computer Science, 1950)

۴۹٬۰۰۰ تومان

Randomness and Completeness in Computational Complexity (Lecture Notes in Computer Science, 1950)

Randomness and Completeness in Computational Complexity (Lecture Notes in Computer Science, 1950)

۴۹٬۰۰۰ تومان

Randomness and Completeness in Computational Complexity (Lecture Notes in Computer Science, 1950)

Randomness and Completeness in Computational Complexity (Lecture Notes in Computer Science, 1950)

۴۹٬۰۰۰ تومان

The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852)

The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852)

۴۹٬۰۰۰ تومان

The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852)

The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852)

۴۹٬۰۰۰ تومان

The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852)

The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852)

۴۹٬۰۰۰ تومان

Nested Relations and Complex Objects in Databases Lecture Notes in Computer Science

Nested Relations and Complex Objects in Databases Lecture Notes in Computer Science

۴۹٬۰۰۰ تومان

قیمت نهایی

۴۴٬۰۰۰ تومان