Abstract: Systems and methods for determining the location of a mobile robot within a data storage library and to a library including such systems and utilizing such methods.

Abstract: Systems and methods for determining the location of a mobile robot within a data storage library and to a library including such systems and utilizing such methods.

Abstract: Systems and methods for determining the location of a mobile robot within a data storage library and to a library including such systems and utilizing such methods.

Abstract: Systems and methods for determining the location of a mobile robot within a data storage library and to a library including such systems and utilizing such methods.

Abstract: A computer processing system containing a plurality of identical processor elements each of which does not retain execution state information from prior operations. The plurality of identical processor elements operate on a statically compiled program which, based upon detected natural concurrencies in the basic blocks of the programs, provide logical processor numbers and an instruction firing time to each instruction in each basic block. Each processor element is capable of executing instructions on a per instruction basis such that dependent instructions can execute on the same or different processor elements. A given processor element is capable of executing an instruction from one context followed by an instruction from another context through use of shared storage resources.

Abstract: A system and method reorder instructions for effecting faster branch execution. A processor element is coupled to receive stored instructions in a first order, and to process the received instructions in a different order, the processing occurring after each stored instruction of a first type is issued, and after a delay time, after each stored instruction of a second type is issued. The delay time is based on a delay value associated with the second type of instructions. In particular, the instructions include branch and non-branch instruction wherein firing time information identifies a time of execution of the branch instruction which is a variable number of instructions cycles prior to a time of execution of a last to be executed instruction in a basic block. Accordingly, branch instructions can be completely executed no later than during the processing of the last to be executed non-branch instruction in the basic block thereby speeding up overall processing of the software program by the system.