中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

5 records (took 0.014 seconds)

    2.
    发明专利
    未知

    公开(公告)号：DE2628363A1

    公开(公告)日：1977-01-20

    申请号：DE2628363

    申请日：1976-06-24

    Applicant: IBM

    Inventor： HAIBT LUTHER HAROLD ,  MULLERY ALVIN PAUL

    IPC: G06F9/46 ,  G06F12/00 ,  G06F13/18 ,  G06F15/173 ,  G06F9/18

    Abstract: A data communication network having a plurality of nodes interconnected with a communication link, wherein each node shares given ones of its data sets in common with other nodes in the network, and each node is operative to update any shared data set, except if one of the other nodes is also seeking to update the same data set, in which case the node having the higher priority prevails. Each node has a memory which stores the node location of each shared data set and the updating priority which each node has with respect to each respective set of shared data. A node receiving competing requests for update will access this memory and, depending upon the sequence of the requests, may accept a higher priority request and refuse a lower priority request.

    DATA PROCESSING SYSTEM
    4.
    发明专利
    DATA PROCESSING SYSTEM 未知

    公开(公告)号：GB1269300A

    公开(公告)日：1972-04-06

    申请号：GB5826170

    申请日：1970-12-08

    Applicant: IBM

    Inventor： MULLERY ALVIN PAUL ,  ZURCHER FRANK WILLIAM JR

    IPC: G06F9/48

    Abstract: 1,269,300. Data processing. INTERNATIONAL BUSINESS MACHINES CORP. 8 Dec., 1970 [10 Dec., 1969], No. 58261/70. Heading G4A. In a data processing system, a data processing device performs tasks specified by task words transferred to it from a programme scheduling device which stores task words and transfers them to the processing device in an order determined by their service ratios, the service ratio of a task word being directly proportional to the time needed to complete the task and inversely proportional to the time remaining before the task must be completed. A task word consists of an address (pointing to the task status word which includes the first instruction of the task programme), and the two times (see above) from which the service ratio is calculated. The task words in the scheduler are each stored in a "table" respective to the range in which its service ratio lies, each "table" having associated with it a respective series of boundary counters specifying groups of task words in the "table" in the order of how long the tasks have not received service. The task words in the "tables" are updated periodically and the service ratios recalculated, at a frequency which is higher, the higher the range of service ratios respective to the "table", task words being transferred between "tables" as appropriate to the new service ratios. Task words are selected from the "tables" for allocation to respective processors, the higher the range of service ratios of a "table" the more frequently that "table" is chosen, task words being chosen from a given "table" on the basis of oldest first. When a task word is allocated to a processor, this is an idle processor or one chosen on the basis of having a current task with the smallest service ratio. In the latter case, the processor is interrupted and its current task word is supplied back to the scheduler for storage in one of the "tables". A processor cannot be interrupted as above more than once in a predetermined time slot. A processor may execute multiple instructions simultaneously.

Patent Agency Ranking