International Business Machines Corporation

Eberhard Pasch

Oliver Benke

Boas Betzler

Thomas Lumpp

Cedric Lichtenau

Jakob Christopher Lang

Utz Bacher

Hans-Werner Tast

Christian Borntraeger

Achim Haessler

Markus Nosse

Elmar Zipp

A computer-implemented method, computer system and a computer program product schedule a secure code segment on a processor core of a processing unit between threads, wherein the processing unit is executing a program code of operating instructions of a thread on the at least one processor core. The method comprises a first thread requesting exclusive secure execution of a secure code segment of the program code on the at least one processor core. The method also comprises checking the request based on a secure-operation parameter that controls a request for exclusive secure execution of a secure code segment. The method further comprises, if the secure-operation parameter is below a predefined threshold value, setting the at least one processor core to exclusive secure execution for the secure code segment and periodically resetting the secure-operation parameter. If the secure-operation parameter is not below the threshold, then the method switches to another thread.

Scheduling a secure code segment on a processor core of a processing unit

Cache bounded reference counting for computer languages having automated memory management in which, for example, a reference to an object 'Z' initially stored in an object 'O' is fetched and the cache hardware is queried whether the reference to the object &#x201c;Z&#x201d; is a valid reference, is in a cache, and has a continuity flag set to &#x201c;on&#x201d;. If the object &#x201c;Z&#x201d; is a valid reference, is in the cache, and has a continuity flag set to &#x201c;on&#x201d;, the object &#x201c;O&#x201d; is locked for an update, a reference counter is decremented for the object &#x201c;Z&#x201d; if the object &#x201c;Z&#x201d; resides in the cache, and a return code is set to zero to indicate that the object &#x201c;Z&#x201d; is de-referenced and that its storage memory can be released and re-used if the reference counter for the object &#x201c;Z&#x201d; reaches zero. Thereafter, the cache hardware is similarly queried regarding an object &#x201c;N&#x201d; that will become a new reference of object &#x201c;O&#x201d;.

Cache bounded reference counting

A resource broker is used in managing workloads of a peer-to-peer distributed computing environment. The broker is responsible for distributing to a plurality of clients of the peer-to-peer distributed computing environment tasks of one or more workloads of one or more issuers of the environment. The tasks are processed by the clients using a runtime environment provided by the broker. The runtime environment of a client is generic to the one or more issuers and independent of an operating system of the client.

Employing a resource broker in managing workloads of a peer-to-peer computing environment

The present invention provides a system and method for the execution of jobs in a distributed computing architecture that uses worker clients which are characterized by a checkpointing mechanism component for generating checkpointing information being assigned to at least one worker client, at least one failover system being assigned to the worker client, a component (failover system selection component) for automatically assigning at least one existing or newly created failover system to the failure system being assigned to a worker client in the case said worker clients fails, wherein the assigned failover system provides all function components in order to take over the execution of the job when said assigned worker client fails, wherein the assigned failover system further includes at least a failover monitor component for detecting failover situations of said assigned worker client.

System and method for execution of a job in a distributed computing architecture

A method and apparatus for retrieving information about an object of interest to an observer. A position sensor wearable by the observer generates position information indicating the position of the observer relative to a fixed position. A direction sensor wearable by the observer generates direction information indicating the orientation of the observer relative to a fixed orientation. An object database stores position information and descriptive information for each of one or more objects. An identification and retrieval unit uses the position and direction information to identify from the object database an object being viewed by the observer by determining whether the object is along a line of sight of the observer and retrieves information about the object from the database. The identification and retrieval unit retrieves the descriptive information stored for the object in the database for presentation to the observer via an audio or video output device. Either two-dimensional (2D) or three-dimensional (3D) data is stored and processed, depending on the necessity to discriminate between vertically spaced objects.

Growing community of inventors

Tuebingen, Germany

Eberhard Pasch