Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Ward S.A. — Computation Structures
Ward S.A. — Computation Structures



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Computation Structures

Автор: Ward S.A.

Аннотация:

Developed as the text for the basic computer architecture course at MIT, Computation Structures integrates a thorough coverage of digital logic design with a comprehensive presentation of computer architecture. It contains a wealth of information for those who design computers or work with computer systems, spanning the entire range of topics from analog circuit design to operating systems. Ward and Halstead seek to demystify the construction of computing hardware by illustrating systematically how it is built up from digital circuits through higher level components to processors and memories, and how its design is affected by its intended uses. Computation Structures is unusually broad in scope, considering many real world problems and tradeoff decisions faced by practicing engineers. These difficult choices are confronted and given careful attention throughout the book. Topics addressed include the digital abstraction; digital representations and notation; combinational devices and circuits; sequence and state; synthesis of digital systems; finite state machines; control structures and disciplines; performance measures and tradeoffs; communication; interpretation; microinterpreter architecture; microprogramming and microcode; single sequence machines; stack architectures; register architectures; reduced instruction set computers; memory architectures; processes and processor multiplexing; process synchronization; interrupts, priorities, and real time; directions and trends. Stephen A. Ward and Robert H. Halstead are both Associate Professors of Computer Science and Electrical Engineering at MIT. Computation Structures is included in the MIT Electrical Engineering and Computer Science series.


Язык: en

Рубрика: Computer science/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1989

Количество страниц: 789

Добавлена в каталог: 12.11.2010

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Domain      348-349
DRAM      see dynamic RAM
Drum      see memory magnetic
Dry run      492 496
DTL      see logic families
Dummy argument      see procedure linkage formal
Dynamic discipline      see discipline dynamic
Dynamic RAM (DRAM)      289-291 311 321 323 374 376 475
Dynamic RAM (DRAM), chips      290 475
Dynamic RAM (DRAM), column address      290
Dynamic RAM (DRAM), column-address strobe (CAS)      290
Dynamic RAM (DRAM), frequency of refresh      323
Dynamic RAM (DRAM), refresh      290 311 323 332 375
Dynamic RAM (DRAM), row      311
Dynamic RAM (DRAM), row address      290
Dynamic RAM (DRAM), row-address strobe (RAS)      290
Dynamic RAM (DRAM), WRITE input      290
EBCDIC      see character code EBCDIC
ECL      see logic families
Edge trigger      83
Effective address      431
EmulateL8      556-557
EmulateS8      556
Emulation, software-level      534
ENAB      592-596
Encoding      269 272
Engineering      621-622
Engineering disciplines      1 621
Engineering methodology, bottom-up      303
Engineering methodology, middle-out      303
Engineering methodology, top-down      303
Entry sequence      see procedure linkage
Environment      401
EPROM      see read-only memory
Equilibrium, stable      97
Equilibrium, unstable      97
Error conditions      339
Error correction      42-44 611
Error correction, single-bit      43
Error detection      42-44 263 374
Error detection, single-bit      43
error reporting      252
Error syndrome bits      43
Error, checksum      43
Error, parity      42
Error-correcting code      43
Eventcounts      see synchronization mechanisms
Events      83 99 173-174 178-179 187-188 192 194
Events, asynchronous      99 195
Events, finish      181 190
Events, start      181 190
Exceptions      352
Exclusive access      561
execution      355 357
execution time      371
Execution units, multiple      355
Exit sequence      see procedure linkage
Expressions      362 382
Expressions, constant      316
extent      see storage class extent
Extracodes      550
Fairness      255 559 572-573
Fairness, of semaphores      573
Fall time ($t_{f}$)      16-20 247
Fanin      14-15
Fanout      11
fault      349 352 411 458 539 545-546 549 593
Fault handler      352 411
Fault tolerance      44 611-612
Fault tolerance, by triple modular redundancy      611
Fault vector      352
Fault, address-translation      546
Fault, divide-by-zero      546
Fault, illegal-instruction      539 546 549 556 588
Fault, segmentation      546
Feedback      76
Feedback path      80-81 86 97
Fermat's last theorem      274
FET      see transistor field-effect
Fibonacci sequence      398
FIFO      see buffer first-in-first-out
Finish signal      see control signals finish
Finite-State Machines (FSMs)      76 92 169 173 175 188 191 269 325 335-336 347 607
Finite-state machines (FSMs), as controllers      269
Finite-state machines (FSMs), asynchronous inputs      147
Finite-state machines (FSMs), deterministic vs. nondeterministic      151
Finite-state machines (FSMs), equivalence      148-151
Finite-state machines (FSMs), formal study of      154
Finite-state machines (FSMs), incompletely specified      151
Finite-state machines (FSMs), input timing      147
Finite-state machines (FSMs), inputs      143
Finite-state machines (FSMs), Mealy machines      92 143
Finite-state machines (FSMs), minimization of      149-151
Finite-state machines (FSMs), Moore machines      92 143 146
Finite-state machines (FSMs), next-state logic      146
Finite-state machines (FSMs), nondeterministic (NFSM)      151-154
Finite-state machines (FSMs), output logic      146
Finite-state machines (FSMs), output rules      143
Finite-state machines (FSMs), output variable      145
Finite-state machines (FSMs), outputs      143
Finite-state machines (FSMs), recognition of strings by      152
Finite-state machines (FSMs), reset input      143 218-220
Finite-state machines (FSMs), state      143
Finite-state machines (FSMs), state equivalence      148-151
Finite-state machines (FSMs), state, current      143 146
Finite-state machines (FSMs), state, initial      143
Finite-state machines (FSMs), state, next      143
Finite-state machines (FSMs), state-transition diagram for NFSMs      152
Finite-state machines (FSMs), state-transition rules      143
Finite-state machines (FSMs), states, encoding of      145 147
Finite-state machines (FSMs), synchronous      146-147 174
Finite-state machines (FSMs), synthesis of      144-146
Five dining philosophers problem      see synchronization problems
Flip-flop      76 78-86 219
Flip-flop, clock input      83-84
Flip-flop, D-type      116-117 220
Flip-flop, edge-triggered      83-86 90 93
Flip-flop, edge-triggered, D-type      91 127
Flip-flop, edge-triggered, D-type, asynchronous specification of      90
Flip-flop, load-enable input      83
Flip-flop, negative edge-triggered      83
Flip-flop, positive edge-triggered      83-84
Fluid dynamics      605
Fluidics      275
Flynn, Michael      612
Forbidden zone      6 8 12 14 16 88 91 94 96
Fork      194-195 198
Formal languages      154
Formal parameter      see procedure linkage
Fourier transform      619
free      633
frequency      2
Frequency division      119
Frequency mismatch      260
FSM      see finite-state machines
Functional modularity      1
Functional partitioning      471
functional units      183 614-615
Functional units, multiple      614
Functions, computable      273 277 607
Functions, Fibonacci      629
Functions, parity      61
Functions, polymorphic      395
Functions, primality      121
Functions, uncomputable      273-275
G      see notation g
G machine      371-372 427-469 537 723-748
G machine, CC register      439 449
G machine, microcode      441-450 728-748
G-machine addressing modes, dir      430 436 439 725
G-machine addressing modes, i      430 436 725
G-machine addressing modes, iix      436 446 725
G-machine addressing modes, imm$\alpha$      436 725
G-machine addressing modes, imm4      438 450
G-machine addressing modes, iposti      436 438 725
G-machine addressing modes, ipred      436 438 725
G-machine addressing modes, ir      430 436 445 725
G-machine addressing modes, ix      430 432-433 436 445 450 454 459 725
G-machine addressing modes, pop      331 430 434-438 651 725
G-machine addressing modes, posti      435-438 725
G-machine addressing modes, pred      435-438 459 725
G-machine addressing modes, r      430 436 438 445 725
G-machine addressing modes, rel      436 725
G-machine instruction set, g2add$\alpha$      447
G-machine instruction set, g2add4      451
G-machine instruction set, gadd$\alpha$      447 451 724
G-machine instruction set, gadd4      428-430 432 438 447 450-451 567-569
G-machine instruction set, gand$\alpha$      724
G-machine instruction set, gash$\alpha$      724
G-machine instruction set, gash4      438
G-machine instruction set, gcall      452 454 458 467 724
G-machine instruction set, gccsub4      568-569
G-machine instruction set, gcleara      451
G-machine instruction set, gcmp$\alpha$      440 449 463 724
G-machine instruction set, gcom$\alpha$      724
G-machine instruction set, gdiv$\alpha$      724
G-machine instruction set, gffo4      463
G-machine instruction set, ghalt      724
G-machine instruction set, ginc$\alpha$      451
G-machine instruction set, gjcond      440 724
G-machine instruction set, gjle      565 567
G-machine instruction set, gjle$\alpha$      463
G-machine instruction set, gjlel      463
G-machine instruction set, gjmp      439 449 724
G-machine instruction set, glsh$\alpha$      724
G-machine instruction set, gmove$\alpha$      451 461 724
G-machine instruction set, gmove4      435 438
G-machine instruction set, gmovel      435
G-machine instruction set, gmult$\alpha$      724
G-machine instruction set, gneg$\alpha$      724
G-machine instruction set, gora      724
G-machine instruction set, grem$\alpha$      724
G-machine instruction set, grtn      452 458 463 467 724
G-machine instruction set, gsext$\alpha$      462
G-machine instruction set, gsext1      462
G-machine instruction set, gsub4      565-568
G-machine instruction set, gsubcc$\alpha$      463
G-machine instruction set, gsubcc2      463
G-machine instruction set, gsubcv      463 724
G-machine instruction set, gsvc      458-459 571 583
G-machine instruction set, gtcl      569-570 724
G-machine instruction set, gtest$\alpha$      440-441 724
G-machine instruction set, gtest4      565-567
G-machine instruction set, gtrtn      458-459
G-machine instruction set, gxor$\alpha$      724
G-machine instruction set, macro definitions      725-728
G-machine instruction set, summary      723-725
Gain      9 12-14 16
Gallager, R.      xix
Garbage collection      348
Gate      14 22 51
Gate arrays      129 134
Gate arrays, field-programmable      134
Gates      see logic gates
GCD      340 343 415
General address (GA)      428 430-431
General register      354 359 367 427
General-register architecture      see architecture general-register
Generic instruction      see instruction generic
Glitch      63 81 92 192 247
Goddeau, D.      xx
Grain size      609
Graph, complete      239 244
Graph, data-dependency      181-182 205 355 606 608 614 620
Graph, data-flow      623
Graph, directed      181
Graph, precedence      180-181 184 186 188 195
Gray code      39 58
Greatest common divisor      198 340
Greatest common divisor, Euclid's algorithm      340
Gridlock      574
Ground      19 23
H      see notation h
HAL      see hard array logic
Halting problem      274
Hand calculators      325
Handler      375
Handler procedure      458
Hard array logic (HAL)      129
Hardware, specialized      363
Harris Corporation      xx
Hazard-free circuits      127
Hazard-free circuits, synthesis of      65
hazards      63 65 81 192
Hazards, in latch design      81-82
Hewlett-Packard Corporation      xx 367
Hillis, Danny      616
Hit ratio      see cache hit
Hold time ($t_{h}$)      85-86 89-90 92 175 197
Holes      565
Hollywood      292
Homer's method      226
Hot Spot      474-475 484-485 620
Houh, H.      xx
Human interface      273
I/O      see input/output
IBM      see International Business Machines
IC      see integrated circuit
if      see R machine instruction-fetch
IFU      see instruction-fetch unit
illegal instruction      see instruction illegal
Illegal-instruction fault      see fault illegal-instruction
Image processing      607
Impedance, characteristic      246-247
Impedance, discontinuities      246
Impedance, matching      247
Implementation transparency      354
Implementation, bit-serial      221
Implementation, byte-serial      221 225
Implementation, choices      212
Implementation, high-performance      353 459
Implementation, low-cost      353
Implementation, nibble-serial      221
Implementation, parallel      225
Implementation, parallel vs. serial      221-222
Implementation, serial      225
Implicant      see Boolean expressions implicant
Increment enable      289
Incrementalism      606
Indeterminacy      187 195
Indeterminate behavior      187
Index register      460
indirection      433
Inference      277
Infix form      382
information      2-3 33
Information content      3
Information density      238
Information representation, by continuous variables      3
Information representation, discrete      3
Information representation, electronic      2
information storage      3
Information, amount of      2-3
Information, flow of      7
Information, speed of transfer      238
Information, theoretical maximum rate of flow      7
Innovation      621
Innovation, architectural      605
Input gating      14-15
Input/Output (I/O)      253-254 264 291 348 352 356
1 2 3 4 5 6 7 8 9 10
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2025
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте