UTILIZING A BIDDING MODEL IN A MICROPARALLEL PROCESSOR ARCHITECTURE TO ALLOCATE ADDITIONAL REGISTERS AND EXECUTION UNITS FOR SHORT TO INTERMEDIATE STRETCHES OF CODE IDENTIFIED AS OPPORTUNITIES FOR MICROPARALLELIZATION
    1.
    发明申请
    UTILIZING A BIDDING MODEL IN A MICROPARALLEL PROCESSOR ARCHITECTURE TO ALLOCATE ADDITIONAL REGISTERS AND EXECUTION UNITS FOR SHORT TO INTERMEDIATE STRETCHES OF CODE IDENTIFIED AS OPPORTUNITIES FOR MICROPARALLELIZATION 审中-公开
    利用微单处理器体系结构中的竞标模型来分配附加的寄存器和执行单元,以识别作为微程序化机会的短代码中间代码段

    公开(公告)号:WO2011051037A3

    公开(公告)日:2011-07-21

    申请号:PCT/EP2010063215

    申请日:2010-09-09

    Inventor: LOEN LARRY WAYNE

    CPC classification number: G06F9/4881 G06F9/4812 G06F2209/483

    Abstract: An enhanced mechanism for parallel execution of computer programs utilizes a bidding model to allocate additional registers and execution units for stretches of code identified as opportunities for microparallelization. A microparallel processor architecture apparatus permits software (e.g. compiler) to implement short-term parallel execution of stretches of code identified as such before execution. In one embodiment, an additional paired unit, if available, is allocated for execution of an identified stretch of code. Each additional paired unit includes an execution unit and a half set of registers. This apparatus is available for compilers or assembler language coders to use and allows software to unlock parallel execution capabilities that are present in existing computer programs but heretofore were executed sequentially for lack of a suitable apparatus. The enhanced mechanism enables a variable amount of parallelism to be implemented and yet provides correct program execution even if less parallelism is available than ideal for a given computer program.

    Abstract translation: 用于并行执行计算机程序的增强机制利用竞价模型来分配额外的寄存器和执行单元,用于被确定为微并行化机会的代码段。 微处理器体系结构设备允许软件(例如编译器)在执行之前实现如此识别的代码段的短期并行执行。 在一个实施例中,附加的配对单元(如果可用的话)被分配用于执行所识别的一段代码。 每个附加的配对单元包括一个执行单元和一组寄存器。 该装置可供编译器或汇编语言编码器使用,并允许软件解锁存在于现有计算机程序中的平行执行能力,但迄今为止由于缺乏合适的装置而被顺序执行。 增强的机制可以实现可变数量的并行性,并提供正确的程序执行,即使对于给定的计算机程序而言,可用的并行性少于理想情况。

    3.
    发明专利
    未知

    公开(公告)号:DE69127735T2

    公开(公告)日:1998-03-26

    申请号:DE69127735

    申请日:1991-07-11

    Applicant: IBM

    Abstract: A data storage medium having the ability to recover from media errors includes a directory (36) located at any desired region of a data storage area with redundant directory pointers at reserved locations. A unique file token is included in the directory entry (40) for each data file and is also included in each extent list (44) where the locations of parts of a fragmented data file are stored. Multiple extent lists are chained in two directions to facilitate reconstruction of the chain if part of the pointer information is lost.

    4.
    发明专利
    未知

    公开(公告)号:DE69127735D1

    公开(公告)日:1997-10-30

    申请号:DE69127735

    申请日:1991-07-11

    Applicant: IBM

    Abstract: A data storage medium having the ability to recover from media errors includes a directory (36) located at any desired region of a data storage area with redundant directory pointers at reserved locations. A unique file token is included in the directory entry (40) for each data file and is also included in each extent list (44) where the locations of parts of a fragmented data file are stored. Multiple extent lists are chained in two directions to facilitate reconstruction of the chain if part of the pointer information is lost.

    Reusing immutable objects
    6.
    发明专利

    公开(公告)号:GB2363870A

    公开(公告)日:2002-01-09

    申请号:GB0021588

    申请日:2000-09-04

    Applicant: IBM

    Inventor: LOEN LARRY WAYNE

    Abstract: When a request is made to create a new immutable object a check is carried out of existing objects to determine if there is a matching object which already exists. If an identical object does exist then a pointer to that object is returned instead of generating a new object thereby saving memory. In the case of accessing a set of records in a database (72, 74, 76 figure 4) immutable objects are created as required (108-118 figure 5) the number of which is reduced due to the reuse of objects (110 and 112 figure 5).

    Immutable objects
    8.
    发明专利

    公开(公告)号:GB2363870B

    公开(公告)日:2004-05-26

    申请号:GB0021588

    申请日:2000-09-04

    Applicant: IBM

    Inventor: LOEN LARRY WAYNE

    Abstract: An apparatus, program product, and method of processing a request to create an immutable object reuse an existing immutable object in appropriate circumstances to represent redundant data without the necessity for creating an additional immutable object. Prior to creating a new object in response to a request to create an immutable object, a determination is made as to whether a matching immutable object already exists that has the same contents as the requested immutable object. If so, creation of a new object is inhibited, and a reference to the matching immutable object is returned in response to the request.

    DATA FILE DIRECTORIES AND METHODS

    公开(公告)号:CA2045948C

    公开(公告)日:1998-11-17

    申请号:CA2045948

    申请日:1991-06-28

    Applicant: IBM

    Abstract: A data storage medium having the ability to recover from media errors includes a directory located at any desired region of a data storage area with redundant directory pointers at reserved locations. A unique file token is included in the directory entry for each data file and is also included in each extent list where the locations of parts of a fragmented data file are stored. Multiple extent lists are chained in two directions to facilitate reconstruction of the chain if part of the pointer information is lost.

    MULTIPROCESSOR SYSTEM COMPRISING A TASK HANDLING ARRANGEMENT

    公开(公告)号:DE3273912D1

    公开(公告)日:1986-11-27

    申请号:DE3273912

    申请日:1982-03-09

    Applicant: IBM

    Abstract: The task handling arrangement is provided in a multiprocessor system in which each processor (5) includes a task dispatcher and a signal dispatcher. The signal dispatcher runs in a processor whenever a task dispatching element (TDE) is put on the task dispatching queue (TDQ) as a result of the task running in the processor. The signal dispatcher examines the TDEs enqueued on the TDQ and determines if any task dispatcher should be invoked, i.e. if any processor is running a lower priority task a task switch should occur. If so, it signals the selected processor to invoke its task dispatcher. After completing the task switch, the selected processor must invoke its signal dispatcher to determine if the task it had been performing should now be performed on some other processor in the multiprocessor system.

Patent Agency Ranking