Bank switching - Revision history

Jnc: +alt name

2021-11-07T13:36:00Z

+alt name

← Older revision		Revision as of 13:36, 7 November 2021
Line 1:		Line 1:
	'''Bank switching''' is a form of [[memory management]], but with a different purpose from most other forms of memory management (such as the early [[base and bounds]] mechanism). It is generally not intended to either i) prevent one [[user]] from interfering with another (in a [[multi-tasking\|multi-programming]] system), or ii) hide the real [[address]]es a program is occupying in [[main memory]] (instead of providing [[virtual address]]es, so that the program appears to always be in the same location, every time it is run).		'''Bank switching''' (sometimes called '''bank selection''') is a form of [[memory management]], but with a different purpose from most other forms of memory management (such as the early [[base and bounds]] mechanism). It is generally not intended to either i) prevent one [[user]] from interfering with another (in a [[multi-tasking\|multi-programming]] system), or ii) hide the real [[address]]es a program is occupying in [[main memory]] (instead of providing [[virtual address]]es, so that the program appears to always be in the same location, every time it is run).

	Rather, it is most commonly found in machines whose [[Central Processing Unit\|CPU]] [[architecture]] provides a limited [[address space]] - less than the amount of real memory which it is desirable to have on the machine. This was a common problem in early machines, whose designers often failed to correctly foresee either the future economics of memory, or the demand for it from software. To be fair, though, it's not a trivial problem; supporting longer addresses (needed for more memory) has costs (e.g. needing longer [[instruction]]s and [[register]]s), which are incurred from the start of the design's lifetime; whereas the benefits are only received later on.		Rather, it is most commonly found in machines whose [[Central Processing Unit\|CPU]] [[architecture]] provides a limited [[address space]] - less than the amount of real memory which it is desirable to have on the machine. This was a common problem in early machines, whose designers often failed to correctly foresee either the future economics of memory, or the demand for it from software. To be fair, though, it's not a trivial problem; supporting longer addresses (needed for more memory) has costs (e.g. needing longer [[instruction]]s and [[register]]s), which are incurred from the start of the design's lifetime; whereas the benefits are only received later on.

Jnc: link 'address space'

2021-09-18T23:44:51Z

link 'address space'

← Older revision		Revision as of 23:44, 18 September 2021
Line 3:		Line 3:
	Rather, it is most commonly found in machines whose [[Central Processing Unit\|CPU]] [[architecture]] provides a limited [[address space]] - less than the amount of real memory which it is desirable to have on the machine. This was a common problem in early machines, whose designers often failed to correctly foresee either the future economics of memory, or the demand for it from software. To be fair, though, it's not a trivial problem; supporting longer addresses (needed for more memory) has costs (e.g. needing longer [[instruction]]s and [[register]]s), which are incurred from the start of the design's lifetime; whereas the benefits are only received later on.		Rather, it is most commonly found in machines whose [[Central Processing Unit\|CPU]] [[architecture]] provides a limited [[address space]] - less than the amount of real memory which it is desirable to have on the machine. This was a common problem in early machines, whose designers often failed to correctly foresee either the future economics of memory, or the demand for it from software. To be fair, though, it's not a trivial problem; supporting longer addresses (needed for more memory) has costs (e.g. needing longer [[instruction]]s and [[register]]s), which are incurred from the start of the design's lifetime; whereas the benefits are only received later on.

	In bank switching, the machine's main memory is divided into 'banks' (hence the name), each usually the size of the machine's basic address space. The running program uses the current bank, until a special operation is used to switch to a different bank. (In some systems, instructions are fetched from one bank, and data from a potentially different bank.)		In bank switching, the machine's main memory is divided into 'banks' (hence the name), each usually the size of the machine's basic [[address space]]. The running program uses the current bank, until a special operation is used to switch to a different bank. (In some systems, instructions are fetched from one bank, and data from a potentially different bank.)

	A variety of low-level mechanisms are possible to achieve this. Perhaps the most common is to have a 'current bank' register (usually in the CPU; if the current bank can be different for instructions and data, there would be two such registers). A current bank register can have a new value loaded into it either explicitly (perhaps by a special instruction), or implicitly. An example of the latter is on machines which have main memory [[word]]s, and registers, which are larger than the machine's basic address: use of a register's, or memory word's, contents which are not zero in the high-order bits (above the bits needed to hold the basic address) as the address for a memory operation causes the current bank register to be loaded with those high-order bits, as a side-effect of the operation. On machines which have separate current bank registers for instructions and data, operations like [[jump]]s would load the current instruction bank register, whereas normal data references would load the other.		A variety of low-level mechanisms are possible to achieve this. Perhaps the most common is to have a 'current bank' register (usually in the CPU; if the current bank can be different for instructions and data, there would be two such registers). A current bank register can have a new value loaded into it either explicitly (perhaps by a special instruction), or implicitly. An example of the latter is on machines which have main memory [[word]]s, and registers, which are larger than the machine's basic address: use of a register's, or memory word's, contents which are not zero in the high-order bits (above the bits needed to hold the basic address) as the address for a memory operation causes the current bank register to be loaded with those high-order bits, as a side-effect of the operation. On machines which have separate current bank registers for instructions and data, operations like [[jump]]s would load the current instruction bank register, whereas normal data references would load the other.

Jnc: An OK start

2021-05-15T15:56:41Z

An OK start

New page

'''Bank switching''' is a form of [[memory management]], but with a different purpose from most other forms of memory management (such as the early [[base and bounds]] mechanism). It is generally not intended to either i) prevent one [[user]] from interfering with another (in a [[multi-tasking|multi-programming]] system), or ii) hide the real [[address]]es a program is occupying in [[main memory]] (instead of providing [[virtual address]]es, so that the program appears to always be in the same location, every time it is run).

Rather, it is most commonly found in machines whose [[Central Processing Unit|CPU]] [[architecture]] provides a limited [[address space]] - less than the amount of real memory which it is desirable to have on the machine. This was a common problem in early machines, whose designers often failed to correctly foresee either the future economics of memory, or the demand for it from software. To be fair, though, it's not a trivial problem; supporting longer addresses (needed for more memory) has costs (e.g. needing longer [[instruction]]s and [[register]]s), which are incurred from the start of the design's lifetime; whereas the benefits are only received later on.

In bank switching, the machine's main memory is divided into 'banks' (hence the name), each usually the size of the machine's basic address space. The running program uses the current bank, until a special operation is used to switch to a different bank. (In some systems, instructions are fetched from one bank, and data from a potentially different bank.)

A variety of low-level mechanisms are possible to achieve this. Perhaps the most common is to have a 'current bank' register (usually in the CPU; if the current bank can be different for instructions and data, there would be two such registers). A current bank register can have a new value loaded into it either explicitly (perhaps by a special instruction), or implicitly. An example of the latter is on machines which have main memory [[word]]s, and registers, which are larger than the machine's basic address: use of a register's, or memory word's, contents which are not zero in the high-order bits (above the bits needed to hold the basic address) as the address for a memory operation causes the current bank register to be loaded with those high-order bits, as a side-effect of the operation. On machines which have separate current bank registers for instructions and data, operations like [[jump]]s would load the current instruction bank register, whereas normal data references would load the other.

Other mechanisms are also possible; for example, memory banks could be disabled, so that only the current bank can respond to memory operations. (This approach would avoid needing to modify the CPU<->memory [[bus]] to have more address bits.)

[[Category: Computer Basics]]