Unisys Corporation

Roger Andrew Jones

Salil Dangi

Robert Joseph Meyers

Martin Lee Schanze

Michael James Irving

Mark Lynn Preston

Poornima Manjunath

An embodiment of the invention is a technique for enabling an emulator that emulates an e-mode program to utilize stored data items whose values are stored in native data format in native memory. The emulator fetches an item referenced by the e-mode program. The referenced item comprises a tag field and a data field. The emulator determines whether the tag field of the referenced item indicates that the referenced item is an external reference word (ERW). If the tag field of the referenced item indicates that the referenced item is an ERW, the emulator decodes the ERW to obtain a data type and a pointer. The pointer corresponds to a location of a stored data item in native memory.

Method and system for using stored data items in native data formats in emulated e-mode programs

A method and system is provided wherein a multiple number of non-preauthenticated clients and non-preauthenticated principals are seeking to logon into a Kerberos domain. Normally, such logon operations would be held-up and stopped until any one single client or principal had completed his logon authorization. However, the present system uses an asynchronous message mechanism by which any single non-preauthenticated client or non-preauthenticated principal can complete his initial logon operation without having to wait for another's authenticating logon operation to be completed. A series of asynchronous message mechanisms are provided in which any single client or principal can complete and finalize the authentication of his logon without having to wait for the completion of other requesting clients and principals seeking to logon and be authenticated.

Non pre-authenticated kerberos logon via asynchronous message mechanism

A system and method using a timer management module for managing a circular queue having N Fixed Timer Entries (FTEs) to enable dynamic capacity increase of size M by extending the pointer array referencing the circular queue by M, copying the first &ldquo;Current Timer Index&rdquo; entries to the extended pointer array entries, allocating M FTEs, and linking the M FTEs within the circular queue.

Enhanced timer queue mechanism for dynamic capacity increase

A circular queue is created with N Fixed Timer Entries associated with a specific address pointer for each entry. An association is developed to relate each fixed entry pointer to its just previous pointer and to its just next occurring pointer. A selected transient New Timer Entry can be inserted between any two selected adjacent Fixed Timer Entries without need to sequence serially through the entire set of fixed entries.

System and method for optimizing insertions for timer queue operations

A system and method using a timer management module for managing a circular queue having fixed timer entries and temporary new timer entries to enable location of specified new timer entries which can then be deleted at the appropriate time in timer management operations.

Growing community of inventors

Mission Viejo, CA, United States of America

Roger Andrew Jones