Content deleted Content added
No edit summary |
No edit summary |
||
Line 12:
<br />
<br />{{pad|2em}} '''Some reference material supporting parts of the structure have been entered'''
<br />{{pad|4em}} The {{color|red|''snippets of text''}} under
<br />{{pad|4em}} This type of direct copying of reference information '''''WILL NOT''''' be part of any section of this article
<br />{{pad|4em}} Again, this information is here to give an idea of the paper, without having to go and read it...
Line 33:
<br /><br />
}}
{| class="wikitable" cellpadding="0" style="border:1.5px solid black;color:#000;margin-left:18em;"
|-
|style="background:#FDEE00;"|[[Image:Nuvola apps korganizer.svg|50px]]
|style="background:#DFFFFF;width:500px;"|'''Added draft of Memory access abstraction, third section of "History"...'''<br /> [[User:JLSjr|JLSjr]] ([[User talk:JLSjr|talk]]) 07:30, 25 March 2010 (UTC)
|}
{| class="wikitable" cellpadding="0" style="border:1.5px solid black;color:#000;margin-left:18em;"
|-
Line 41 ⟶ 46:
|-
|style="background:#FDEE00;"|[[Image:Nuvola apps korganizer.svg|50px]]
|style="background:#DFFFFF;width:500px;"|'''Added
|}
{| class="wikitable" cellpadding="0" style="border:1.5px solid black;color:#000;margin-left:18em;"
|-
|style="background:#FDEE00;"|[[Image:Nuvola apps korganizer.svg|50px]]
|style="background:#DFFFFF;width:500px;"|'''Added
|}
{| class="wikitable" cellpadding="0" style="border:1.5px solid black;color:#000;margin-left:18em;"
|-
|style="background:#FDEE00;"|[[Image:Nuvola apps korganizer.svg|50px]]
|style="background:#DFFFFF;width:500px;"|'''Added
|}
{| class="wikitable" cellpadding="0" style="border:1.5px solid black;color:#000;margin-left:18em;"
|-
|style="background:#FDEE00;"|[[Image:Nuvola apps korganizer.svg|50px]]
|style="background:#DFFFFF;width:500px;"|'''Added
|}
{| class="wikitable" cellpadding="0" style="border:1.0px solid black;color:#000;margin-left:18em;"
Line 217 ⟶ 222:
'''Intercommunicating Cells, Basis for a Distributed Logic Computer'''<ref>Lee, C. Y. 1962. Intercommunicating cells, basis for a distributed logic computer. In Proceedings of the December 4-6, 1962, Fall Joint Computer Conference (Philadelphia, Pennsylvania, December 04 - 06, 1962). AFIPS '62 (Fall).</ref> (1962)
One early memory access paradigm was Intercommunicating Cells, where a cell is composed of a collection of [[Computer data storage|memory]] elements. A memory element was basically a electronic [[flip-flop]] or [[relay]], capable of two possible values. Within a cell there are two types of elements, symbol and cell elements. Each cell structure stores [[data]] in a [[String (computer science)|string]] of symbols, consisting of a [[Identifier|name]] and a set of associated [[parameter]]s. Consequently, a system's information is linked through various associations of cells.
Intercommunicating Cells fundamentally break from tradition in that it has no [[Program counter|counter]]s or any concept of [[Memory address|addressing memory]]. The theory contends that addressing is a wasteful and non-valuable [[indirection|level of indirection]]. Information is accessed in two ways, direct and cross-retrieval. Direct retrieval looks to a name and returns a parameter set. Cross-retrieval [[Projection (mathematics)|projects]] through parameter sets and returns a set of names containing the given [[subset]] of parameters. This would be similar to a modified [[hash table]] [[data structure]] that would allow for multiple [[Value (mathematics)|values]] (parameters) for each [[Unique key|key]] (name).
{| style="width=100%; background:#F8FFFB;"
|- valign="top"
| colspan="3" |Cellular memory would have many advantages:
|- valign="top"
| width="20px" | || width="10px" | [[file:Writing_bullet.svg|top]] || A major portion of a system's [[Boolean logic|logic]] is distributed within the associations of information stored in the cells,
|- valign="top"
| width="20px" | || width="10px" | [[file:Writing_bullet.svg|top]] || This flow of information association is somewhat guided by the act of storing and retrieving,
|- valign="top"
| width="20px" | || width="10px" | [[file:Writing_bullet.svg|top]] || The time required for storage and [[Information retrieval|retrieval]] is mostly [[constant time|constant]] and completely unrelated to the size and fill-factor of the memory
|- valign="top"
| width="20px" | || width="10px" | [[file:Writing_bullet.svg|top]] || Cells are logically indistinguishable, making them both flexible to use and relatively simple to extend in size
|}
This early research into alternative memory describes a [[Computer configuration|configuration]] ideal for the distributed operating system. The constant-time projection through memory for storing and retrieval would be inherently [[Atomic operation|atomic]] and [[Mutual exclusion|exclusive]]. The cellular memory's intrinsic distributed characteristics would be an invaluable benefit; however, the impact on the [[User interface|user]], [[hardware]]/[[Peripheral|device]], or [[Application programming interface]]s is uncertain. It is distinctly obvious that these early researchers had a distributed system concept in mind, as they state:
{{quote|We wanted to present here the basic ideas of a distributed logic system with... the macroscopic concept of logical design, away from scanning, from searching, from addressing, and from counting, is equally important. We must, at all cost, free ourselves from the burdens of detailed local problems which only befit a machine low on the evolutionary scale of machines.|Chung-Yeol (C. Y.) Lee|''Intercommunicating Cells, Basis for a Distributed Logic Computer''}}
Line 226 ⟶ 249:
'''HYDRA:The Kernel of a Multiprocessor Operating System'''<ref>Wulf, W., Cohen, E., Corwin, W., Jones, A., Levin, R., Pierson, C., and Pollack, F. 1974. HYDRA: the kernel of a multiprocessor operating system. Commun. ACM 17, 6 (Jun. 1974), 337-345.</ref> (1974)
<br />
<font color="red">''The design philosophy of HYDRA ... suggest that, at the heart of the system, one should build a collection of facilities of "universal applicability" and "absolute reliability" -- a set of mechanisms from which an arbitrary set of operating system facilities and policies can be conveniently, flexibly, efficiently, and reliably constructed.''
<br />
''Defining a kernel with all the attributes given above is difficult, and perhaps impractical... It is, nevertheless, the approach taken in the HYDRA system. Although we make no claim either that the set of facilities provided by the HYDRA kernel ... we do believe the set provides primitives which are both necessary and adequate for the construction of a large and interesting class of operating environments. It is our view that the set of functions provided by HYDRA will enable the user of C.mmp to create his own operating environment without being confined to predetermined command and file systems, execution scenarios, resource allocation policies, etc.''</font>
<br />
Line 237 ⟶ 260:
'''The National Software Works: A Distributed Processing System'''<ref>Millstein, R. E. 1977. The National Software Works: A distributed processing system. In Proceedings of the 1977 Annual Conference ACM '77. ACM, New York, NY, 44-52.</ref> (1975)
<font color="red">''The National Software Works (NSW) is a significant new step in the development of distributed processing systems and computer networks. NSW is an ambitious project to link a set of geographically distributed and diverse hosts with an operating system which appears as a single entity to a prospective user.''</font>
Line 245 ⟶ 268:
'''The Rosco Distributed Operating System'''<ref>Solomon, M. H. and Finkel, R. A. 1979. The Roscoe distributed operating system. In Proceedings of the Seventh ACM Symposium on Operating Systems Principles (Pacific Grove, California, United States, December 10 - 12, 1979). SOSP '79.</ref> (1979)
<font color="red">''Roscoe is an operating system implemented at the University of Wisconsin that allows a network of microcomputers to cooperate to provide a general-purpose computing facility. The goal of the Roscoe network is to provide a general-purpose computation resource in which individual resources such as files and processors are shared among processes and control is distributed in a non-hierarchical fashion. All processors are identical. Similarly, all processors run the same operating system kernel. However, they may differ in the peripheral units connected to them. No memory is shared between processors. All communication involves messages explicitly passed between physically connected processors. No assumptions are made about the topology of interconnection.''
''The decision not to use logical or physical sharing of memory for communication is influenced both by the constraints of currently available hardware and by our perception of cost bottlenecks likely to arise as the number of processors increases. ''</font>
| |||