The Wayback Machine - https://web.archive.org/web/20200916131326/https://github.com/TheAlgorithms/C/pull/464
Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Added a new Algorithm of Multi-programming_with_Fixed_Tasks #464

Open
wants to merge 2 commits into
base: master
from

Conversation

@UmarGit
Copy link

UmarGit commented Oct 23, 2019

Multiprogramming with Fixed Number of Tasks (MFT) 🔧
The biggest problem with PCP was that processor cycles were wasted whilst the application program made a request for I/O. To improve processor utilization, another OS called Multiprogramming with Fixed number of Tasks (MFT) was introduced.
Multiprogramming implies that a number of programs are resident in memory at any given point of time. Of these, one program is running on a processor. When a program makes a request for I/O its stateis saved and the program is suspended. Control is given to another program and it continues from where it left off. In this fashion, ultimately all programs run to completion after many cycles of running and sleeping.In MFT, many fixed partitions were created at machine startup. The.The sizes of the partitions could vary.Each program would be loaded into a free partition of appropriate size.

MFT was intended to serve as a stop-gap until Multiprogramming with a Variable number of Tasks (MVT), the intended "target" configuration of OS/360, became available in 1967. Early versions of MVT had many problems, so the simpler MFT continued to be used for many years. After introducing new System/370 machines with virtual memory, in 1972 MFT was developed into OS/VS1, the last system of this particular line.
The first version of MFT shared much of the code and architecture with PCP, and was limited to four partitions. It was very cumbersome to run multiple partitions. Many installations used Houston Automatic Spooling Priority (HASP) to mitigate the complexity.
MFT Version II (MFT-II) shared much more of the Control Program and Scheduler code with MVT, and was much more flexible to run. The maximum number of partitions increased to 52.
Later modifications of MFT-II added sub-tasking, so that the fixed number of tasks was no longer fixed, although the number of partitions did remain a limitation.
Experience indicated that it was not advisable to install MFT on systems with less than 256 KB of memory, which in the 1960s was quite a large amount.
Also referred to as SYS=INT in macro expansions that were system-dependent.
Enjoy !😄 😆 😊 😃 😏 😍 😘 😚 😳 😌 😆 😁 😉 😜 😝 😀 😗 😙 😛 😴 😟 😦 😧 😮 😬

UmarGit added 2 commits Oct 23, 2019
Multi-programming with Fixed Number of Tasks (MFT) :
The biggest problem with PCP was that processor cycles were wasted whilst the application program made a request for I/O. To improve processor utilization, another OS called Multi-programming with Fixed number of Tasks (MFT) was introduced.
Multi-programming implies that a number of programs are resident in memory at any given point of time. Of these, one program is running on a processor. When a program makes a request for I/O its stateis saved and the program is suspended. Control is given to another program and it continues from where it left off. In this fashion, ultimately all programs run to completion after many cycles of running and sleeping.In MFT, many fixed partitions were created at machine startup. The.The sizes of the partitions could
vary.Each program would be loaded into a free partition of appropriate size.
MFT was intended to serve as a stop-gap until Multi-programming with a Variable number of Tasks (MVT), the intended "target" configuration of OS/360, became available in 1967. Early versions of MVT had many problems, so the simpler MFT continued to be used for many years. After introducing new System/370 machines with virtual memory, in 1972 MFT was developed into OS/VS1, the last system of this particular line.
The first version of MFT shared much of the code and architecture with PCP, and was limited to four partitions. It was very cumbersome to run multiple partitions. Many installations used Houston Automatic Spooling Priority (HASP) to mitigate the complexity.
MFT Version II (MFT-II)  shared much more of the Control Program and Scheduler code with MVT, and was much more flexible to run. The maximum number of partitions increased to 52.
Later modifications of MFT-II added sub-tasking, so that the fixed number of tasks was no longer fixed, although the number of partitions did remain a limitation.
Experience indicated that it was not advisable to install MFT on systems with less than 256 KB of memory, which in the 1960s was quite a large amount.
Also referred to as SYS=INT in macro expansions that were system-dependent.
added a new algorithm in misc called Multi-programming_with_Fixed_Tasks
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Linked issues

Successfully merging this pull request may close these issues.

None yet

1 participant
You can’t perform that action at this time.