TRIX (operating system)

TRIX is a network-oriented research operating system developed in the late 1970s at MIT's Laboratory for Computer Science (LCS) by Professor Steve Ward and his research group. It ran on the NuMachine and had remote procedure call functionality built into its kernel, but was otherwise a Version 7 Unix workalike.

Design and implementation

On startup, the NuMachine would load the same program on each CPU in the system, passing each instance of the program the numeric ID of the CPU it was running on. TRIX relied on this design to have the first CPU set up global data structures and then set a flag to signal when initialization completed.[1] After that, each instance of the kernel was able to access global data.[1] The system also supported data private to each CPU.[1] Access to the filesystem was provided by a program in user space.[1][2]

The kernel supported unnamed threads running in domains.[1] A domain was the equivalent of a Unix process without a stack pointer[2] (each thread in a domain had a stack pointer[2]). A thread could change domains,[1] and the system scheduler would migrate threads between CPUs in order to keep all processors busy.[1] Threads had access to a single kind of mutual exclusion primitive, and one of seven priorities.[1] The scheduler was designed to avoid priority inversion.[1] User space programs could create threads through a spawn system call.[1]

A garbage collector would periodically identify and free unused domains.[1]

The shared memory model used to coordinate work between the various CPUs caused memory bus contention and was known to be a source of inefficiency.[1][2] The designers were aware of designs that would have alleviated the contention.[2] Indeed, TRIX's original design used a nonblocking message passing mechanism,[2] but "this implementation was found to have deficiencies often overlooked in the literature,"[2] including poor performance.[2]

Although the TRIX operating system was first implemented on the NuMachine, this was more a result of the availability of the NuMachine at MIT than any characteristic of the architecture.[1] The system was designed to be easily portable.[2] It was implemented largely in C with little assembly code. The mutual exclusion primitive could be ported to any architecture with an atomic test and set instruction.[1]

Attempted use by the GNU Project

Richard Stallman mentions in the GNU Manifesto, that "an initial kernel exists but many more features are needed to emulate Unix."[3] This was a reference to TRIX's kernel, which TRIX's authors had decided to distribute as free software.[4]

In a speech, Stallman elaborated that "The TRIX kernel runs, and it has a certain limited amount of Unix compatibility, but it needs a lot more. Currently it has a file system that uses the same structure on disk as the ancient Unix file system does. This made it easier to debug the thing, because they could set up the files with Unix, and then they could run TRIX, but that file system doesn't have any of the features that I believe are necessary."[5] The features Stallman wished to add (file versioning, undeletion, information on when and how and where the file was backed up on tape, atomic file updates) are not generally associated with Unix.

In December 1986, TRIX's kernel was used as a base in the first attempt to create a kernel for the GNU operating system. However, the GNU developers eventually decided it was unusable as a starting point, primarily because:

See also

References


  1. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 "A Multiple Processor Implementation of the TRIX Operating System" (PDF). Retrieved 2012-07-02.
  2. 1 2 3 4 5 6 7 8 9 "TRIX: A Communications Oriented Operating System" (PDF). Retrieved 2012-07-02.
  3. ↑ "The GNU Manifesto". Retrieved 2010-08-05.
  4. 1 2 "GNU's Bulletin Volume 1 No. 2". GNU's Bulletin 1 (2): 4. January 1987. Retrieved 2010-08-05.
  5. ↑ "RMS lecture at KTH". Retrieved 2014-04-10.
This article is issued from Wikipedia - version of the Saturday, February 06, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.