[PR #464] [CLOSED] Added a new Algorithm of Multi-programming_with_Fixed_Tasks #863

New Issue

claunia · 2026-01-29T15:15:48Z

claunia commented

2026-01-29 15:15:48 +00:00

📋 Pull Request Information

Original PR: https://github.com/TheAlgorithms/C/pull/464
Author: @UmarGit
Created: 10/23/2019
Status: ❌ Closed

Base: master ← Head: master

📝 Commits (2)

c5f296f Create Multi-programming_with_Fixed_Tasks.cpp
bda1a9b Update README.md

📊 Changes

2 files changed (+44 additions, -0 deletions)

View changed files

📝 README.md (+1 -0)
➕ misc/Multi-programming_with_Fixed_Tasks.cpp (+43 -0)

📄 Description

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 !😄 😆 😊 😃 😏 😍 😘 😚 😳 😌 😆 😁 😉 😜 😝 😀 😗 😙 😛 😴 😟 😦 😧 😮 😬

_{🔄 This issue represents a GitHub Pull Request. It cannot be merged through Gitea due to API limitations.}

## 📋 Pull Request Information **Original PR:** https://github.com/TheAlgorithms/C/pull/464 **Author:** [@UmarGit](https://github.com/UmarGit) **Created:** 10/23/2019 **Status:** ❌ Closed **Base:** `master` ← **Head:** `master` --- ### 📝 Commits (2) - [`c5f296f`](https://github.com/TheAlgorithms/C/commit/c5f296fbc2ff9530b10e3eee5d0ee920ef178b4b) Create Multi-programming_with_Fixed_Tasks.cpp - [`bda1a9b`](https://github.com/TheAlgorithms/C/commit/bda1a9b61fa79d4e2850aa450de2d3ecbbe87f61) Update README.md ### 📊 Changes **2 files changed** (+44 additions, -0 deletions) <details> <summary>View changed files</summary> 📝 `README.md` (+1 -0) ➕ `misc/Multi-programming_with_Fixed_Tasks.cpp` (+43 -0) </details> ### 📄 Description **_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 !😄 😆 😊 😃 😏 😍 😘 😚 😳 😌 😆 😁 😉 😜 😝 😀 😗 😙 😛 😴 😟 😦 😧 😮 😬 --- <sub>🔄 This issue represents a GitHub Pull Request. It cannot be merged through Gitea due to API limitations.</sub>

claunia added the pull-request label 2026-01-29 15:15:48 +00:00

claunia referenced this issue

2026-01-29 15:19:51 +00:00

[PR #863] [CLOSED] feat: add glue based doubly linked-list #1372

Sign in to join this conversation.

1 Participants

Notifications

Due Date

No due date set.

Dependencies

No dependencies set.

Reference: starred/C#863