Различия между версиями 4 и 5
Версия 4 от 2019-11-01 13:24:00
Размер: 2152
Редактор: FrBrGeorge
Комментарий:
Версия 5 от 2019-11-04 18:23:25
Размер: 2156
Редактор: FrBrGeorge
Комментарий:
Удаления помечены так. Добавления помечены так.
Строка 1: Строка 1:
= Intro: Computer architecture concept = = 00. Intro: Computer architecture concept =

00. Intro: Computer architecture concept

Philosophy

* Philosophy: tool is an augmented body part. IT: computers is… ? * Main principle: certain computer feature is a contemporary response to certain practical challenge

  • ⇒ most of current features are legacy ones

Prerequisits of algorithmically complete formalisms

  • Algorithm: sequence of operations on data that produces new data. The same algorithm will produce identical output on identical input anytime

  • Formalism is complete and unambiguous representation of algorithm
  • ⇒ Algorithmically complete formalism:
    1. Has instructions operating on data

    2. Has an unambiguous order (not only sequence) of instructions given

    3. Has an option of data-driven operation, i. e. to operate or not to operate some instructions on the basis of data characteristics

    4. Being finite, the formalism in question is to have repetitive data-driven operation mode, when some instructions are operated while data characteristics fit. Infinite formalisms do not need that, having infinite operations like general-recursive operator.

Von Neumann principles on computer architecture

  1. There are none, actually
  2. There are operations and numbers, both stored in common memory

  3. Memory is split into machine words, each word has an unique number (an address).

  4. Binary encoding is used to reproduce number or operation in machine word.

  5. Operations are executed sequentially, taking from a specific memory, address, and one by one after that.

  6. There is a jump operation, which allows to alter the operation sequence by direct change next address of operation executed.

    1. Conditional jumps are «forward» (to the greater address), so part of the operation sequence can be skipped.

    2. Loop jumps a «backward» (to the lesser address), so part of the operation sequence can be executed again.

    3. There are external devices controlled by computer with that same operations (only operation type differs)

Criticism of Von Neumann legacy

HSE/ArchitectureASM/00_ArchitectureIntro (последним исправлял пользователь FrBrGeorge 2019-11-04 18:23:25)