All lessons Leer en español

History · Unit 07 · Lesson 1 of 4

Time-sharing and the invention of boundaries

Learn why sharing an expensive computer made identity, isolation, and controlled cooperation central design problems.

7 minready

Helpful before thisOperating systems

After this lesson you can

  • distinguish scheduling, authentication, and authorization
  • explain why protection must govern deliberate sharing
  • apply historical protection principles to a modern shared service

Explore the eras below. On wider screens, scroll sideways to see the full timeline.

Suppose you have an expensive computer and a queue of people with short questions. Running one large job at a time may keep the machine busy, but everyone else waits. Time-sharing changed the experience: several people could interact with a shared computer and receive useful responses.

Time-sharing and the invention of boundariesIdentifying a user and authorizing a particular operation are different jobs. Scheduling processor time is another independent decision.Who is making a request?What operation is allowed?What resource is affected?
Identifying a user and authorizing a particular operation are different jobs. Scheduling processor time is another independent decision.

Sharing time created more than a scheduling problem

MIT’s Compatible Time-Sharing System, or CTSS, was demonstrated in 1961. Time-sharing aimed to make a shared machine feel responsive to individual users. It did not require the processor to execute every user’s instruction at exactly the same instant. Rapid switching and resource management could support the interactive experience.

Now imagine two fictional students using that machine. One is editing private notes; the other is compiling a class project. The operating system must allocate processor time, keep their work organized, and decide which resources each may use. Giving them equal turns does not stop one from reading the other’s files. Scheduling and protection are different jobs.

Multics treated the computer as a shared service

The Multics project began in 1965 as a collaboration involving MIT, Bell Labs, and General Electric. It sought a broadly useful computing utility, with protection and controlled sharing woven into the design. Multics entered service at MIT in 1969; operation then required administrators, maintenance, and policies as well as research ideas.

This is more relevant than simply calling Multics an ancestor of later systems. It confronted a question that still appears in a cloud workspace: how do people cooperate on some resources while keeping others private? Influence can travel through design ideas without every later system inheriting the same source code.

Knowing a name is not granting a request

Authentication establishes an identity according to a mechanism. Authorization decides whether that identity may perform a particular operation on a resource. A logged-in student might read their own notes, edit a group document, and be refused another student’s draft, all during one session.

In 1975, Jerome Saltzer and Michael Schroeder published principles for protecting information in computer systems. Two useful ideas are least privilege and checking relevant access decisions rather than assuming a previous check settles every later action. These are design questions, not a claim that one historical system implemented every protection perfectly.

PredictA student leaves a project group but stays logged in. Should the team assume the old login proves they may keep opening the group’s files?

No. Identity, current membership, cached permissions, and already-open resources can have different lifetimes. A real design must specify when revocation takes effect; a login alone cannot answer that question.

The change was from running isolated jobs to serving interacting people. What persisted was the need to define authority precisely. Today’s shared documents, service accounts, and online classrooms still need rules for both separation and intentional sharing.

Check yourself

No timer. No penalties. Read the explanation and try again whenever you like.

  1. Two students get equal processor time, but one can read the other’s private notes. What worked and what failed?

    Show the answer

    Correct answer: Scheduling may be fair while access control is wrong. Allocating time and authorizing file reads solve different problems.

  2. A user signs in correctly. May the system skip checking a request to a private file?

    Show the answer

    Correct answer: No; successful authentication does not authorize every operation. The system must connect the identity and requested operation to policy.

  3. A group needs to share one project document. Which design matches controlled cooperation?

    Show the answer

    Correct answer: Give the group appropriate access to that document. A specific permission supports collaboration without universal access.

  4. A helper only needs to print reports. Which historical principle is relevant?

    Show the answer

    Correct answer: Give it only the authority needed for that job. Least privilege limits the consequences of mistakes or misuse.

Try it

  • WriteOn paper, give two fictional students a shared machine, private notes, and one group document. Assign a rule for processor time, a rule for private files, and a rule for the group document. Change one student’s group membership and decide what should happen to future requests.
References