Unisys Corporation

Clark C Kogen

David Strong

Andrew Ward Beale

Anthony P Matyok

James C Prestifilippo

Craig F Russ

Philip M Hoffman

Andrew David Milligan

Steven Clarke

Robert K Liermann

Methods and systems for mapping a sharable resource using a one-time password are disclosed. An identifier included in a set of provided credentials uniquely associates the one-time password with an executable within a computing environment that hosts the sharable resource. When credentials are received in association with a mapping request, it is determined whether a supplied username corresponds to a user authorized to access the sharable resource and whether a representation of a supplied password received in association with the mapping request matches a representation of the one-time password. Validating the mapping request provides access to the sharable resource.

One-time password for secure share mapping

A proxy compiler may be used within a native execution environment to enable execution of non-native instructions from a non-native execution environment as if being performed within the native execution environment. In particular, the proxy compiler coordinates creation of a native executable that is uniquely tied to a particular non-native image at the time of creation of the non-native image. This allows a trusted relationship between the native executable and the non-native image, while avoiding a requirement of compilation/translation of the non-native instructions for execution directly within the native execution environment.

Proxy compilation for execution in a foreign architecture controlled by execution within a native architecture

A proxy compiler may be used within a native execution environment to enable execution of non-native instructions from a non-native execution environment as if being performed within the native execution environment. In particular, the proxy compiler coordinates creation of a native executable that is uniquely tied to a particular non-native image at the creation time of the non-native image. This allows a trusted relationship between the native executable and the non-native image, while avoiding a requirement of compilation/translation of the non-native instructions for execution directly within the native execution environment.

Mechanisms and methods for traversing trees are disclosed. A novel data structure for modeling a node that includes a unique node counter also is described. In certain embodiments of the inventions the unique node counter is a timestamp of sufficient granularity to render each timestamp in the tree unique. A node counter, in conjunction with the lineage of a specified continuation node may be used to locate an appropriate starting point within a tree in a continuation call when the specified continuation node no longer exists in the tree.

Mechanism for continuable calls to partially traverse a dynamic general tree

A file accessing scheme allows logical files to be processed outside of the native operating system and its logical I/O subsystem. When an application program wants to process a file outside of the native operating system, a file information block is built with a special type of file designated as 'virtual.' A pointer is provided within the file information block to a handler. The handler is a library that is external to the native operating system. The library processes the file without using the native operating system. Upon completion of the processing, the handler returns the operation results to the file information block and control is transferred back to the application program.

Virtual file system and method

A computer-based method for identifying the head of a linked list stored in a memory comprises the steps of (a) retrieving an element of the list from the memory, (b) identifying from the pointer of the retrieved element, the next subsequent stored element of the list, (c) marking the next subsequent stored element; and (d) repeating steps (a) through (c) for each stored element of the list. After processing each element, the stored element that is not marked is identified as the head of the linked list. In an alternate embodiment, an element of the list is selected as a possible candidate for head of the list, and the list is then traversed from the selected element to the end of the list. A count of the number of linkages between the selected element and the end of list is generated as the list is traversed, and each element accessed while traversing the list is marked 'visited'. Each other element of the list is then processed in the same manner, except that elements already visited are not processed. Additionally, if while traversing the linkages from a candidate element to the end of the list, an element is encountered that was previously 'visited', then the linkage count associated with the previously visited element is added to the linkage count generated up until that point for the candidate element. Upon completion, the element with the largest linkage count is identified as the head of the list.

Growing community of inventors

West Chester, PA, United States of America

Clark C Kogen