Static information storage and retrieval – Magnetic bubbles – Guide structure
Patent
1992-05-28
1995-01-10
Kriess, Kevin A.
Static information storage and retrieval
Magnetic bubbles
Guide structure
365DIG1, G06F 944
Patent
active
053815475
DESCRIPTION:
BRIEF SUMMARY
BACKGROUND OF THE INVENTION
A method of this type is used in particular in interactive development environments. Currently there are a wide variety of interactive systems for commercial application, ranging from very expensive mainframe computers down to small PCs. For example, the programming system LISP (list processing) is one of the many systems of this type known at present. For example, in 1985 the so-called "Spice LISP" was implemented as a variant of "Common LISP" at the Carnegie-Mellon University (CMU) on a computer manufactured by Perq. Systems Corporation. The authors David B. McDonald, Scott E. Fahlmann and Skef Wholey describe under the title "Internal Design of CMU Common Lisp on the IBM RT PC", September, 1987, CMU-CS-87-157, the exact details for an implementation of "Common LISP" in a Mach operating system which is compatible with Berkeley Unix 4.3. In particular, beginning with page 35, it is stated that a large number of inquiry operations are required for function calls to determine the current status of the called function. The status of a called function or program element refers to its form in being, for example, interpretable code, source code, object code or code to be simulated. In-line operations are provided here for so-called evaluation of the arguments. Then so-called out-of-line operations are provided which are realized as a central function call program and have different program parts for a compiled function and a list to be interpreted. If the called function can be represented by a symbol, a link table can be used, which is constructed from double words and initially references the central function call program, which from case to case enters a reference to the function program.
An operating system platform based on a virtual machine is described by the authors Jose Alves Marques and Paulo Guides under the title "Extending the Operating System to Support an Object-Oriented Environment" in the Proceedings of Object-Oriented Programming: Systems, Languages and Applications (OOPSLA '89), ACM, 1st to 6th Oct. 1989, New Orleans, La., USA, on pages 113 to 122. Objects can be classified in their object classes on the basis of type definitions of the user, consisting of operations and attributes. The objects can be referenced as active or passive objects, in that each object notified to the system is assigned its own identifier in each case, so that objects can be called uniformly and transparently. Access transparency independent of residence in a mass storage means or a main memory allows a dynamic linking to be available to an execution system and erroneous object accesses to be detected. As a result of synchronizing rules for a synchronizable object, synchronization takes place in the case of contending accesses. Error transparency of the system is provided, in that an error containment can be defined for atomic objects. A virtual architecture is provided in which management areas (domains) can be defined. The address space is divided on the one hand into a virtual object memory for calls and instantiation of objects during the execution of a job, and on the other hand into a storage system for objects outside the execution of jobs. Operations for objects are identified using a method identification, by means of which a virtual address for the operation can be taken from a method table, which address is assigned to the operation as allocated method. Reference to the associated entry in the method table for the referenced method is made during dynamic linking. The object structure is formed on the one hand by data objects which contain instantiation data, and on the other hand by implementation objects which contain the execution code for all objects of a particular implementation type. A data block is used as information header, in which the information required by the system for an object, for storing it, for calling it and also for access protection for an object, is entered. When an object is called an object reference, an operation identification and also a parameter li
REFERENCES:
patent: 4558413 (1985-12-01), Schmidt et al.
patent: 5247681 (1993-09-01), Janis et al.
"Extending the operating system to support an object-oriented environment" by J. A. Marques et al., Oct. 1989, pp. 113-122.
"Automatic descriptor decoding" by J. P. Benkard et al., IBM Technical Disclosure Bulletin, Jun. 1973, pp. 180-182.
"Internal Design of CMU Common Lisp on the IBM RT PC", D. McDonald et al., Sep. 1987, pages.
"Extending the Operating System to Support an Object-Oriented Environment" by Jose Alves Marques et al., OOPSLA 1989 Proceedings Oct. 1-6, 1989, pp. 113-122.
Flug Christian
Kolb Dieter
Kriess Kevin A.
Payne Matthew M.
Siemens Aktiengesellschaft
LandOfFree
Method for dynamically linking definable program elements of an does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for dynamically linking definable program elements of an , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for dynamically linking definable program elements of an will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-857778