-
公开(公告)号：JP2002108671A
公开(公告)日：2002-04-12
申请号：JP2001198477
申请日：2001-06-29
Applicant: IBM
Inventor： CHALLENGER JAMES R H , DANTZIG PAUL M , DIAS DANIEL M , IYENGAR ARUN K , SONG JUNEHWA
Abstract: PROBLEM TO BE SOLVED: To provide a method and system for caching customized information in a network server system. SOLUTION: A rule for deciding whether at least one customized block of data should be generated or fetched is defined. Then, a customizable template is generated. This customizable template includes the rule reference and offset specifying a place where the customized block is inserted into the customizable template. Then, the customized block is inserted into the place specified by the offset of the customizable template. The customized block, the customizable template, and/or the rule can be preliminarily stored in a cache 106 of this computer processing system. Also, the customized block can be dynamically generated.
-
公开(公告)号：CA2351151A1
公开(公告)日：2002-01-26
申请号：CA2351151
申请日：2001-06-21
Applicant: IBM
Inventor： IYENGAR ARUN K , SONG JUNEHWA , DANTZIG PAUL M , CHALLENGER JAMES R H , DIAS DANIEL M
Abstract: A method for providing customized information in a computer processing syste m includes the step of defining at least one rule for one of creating and retrieving at least one customized block of data. At least one customizable template is created which includes at lea st one reference to the at least one rule and at least one offset that specifies at least one positi on at which the at least one customized block is inserted into the at least one customizable template. Th e at least one customized block is inserted into the at least one customizable template at the at leas t one position specified by the at least one offset. The customized block, the customizable template, and/or the rule may be pre-stored in a cache of the computer processing system. The customized bloc k may also be dynamically created.
-
3.发明专利
公开(公告)号：CA2125201A1
公开(公告)日：1995-02-24
申请号：CA2125201
申请日：1994-06-06
Applicant: IBM
Inventor： POLYZOIS CHRISTOS A , DIAS DANIEL M , BHIDE ANUPAM K
Abstract: DIGITAL STORAGE SYSTEM AND METHOD HAVING ALTERNATING DEFERRED UPDATING OF MIRRORED STORAGE DISKS A fault-tolerant high performance mirrored disk subsystem is described which has an improved disk writing scheme that provides high throughput for random disk writes and at the same time guarantees high performance for disk reads. The subsystem also has an improved recovery mechanism which provides fast recovery in the event that one of the mirrored disks fails and during such recovery provides the same performance as during non-recovery periods. Data blocks or pages which are to be written to disk are temporarily accumulated and sorted (or scheduled) into an order (or schedule) which can be written to disk efficiently, which in a preferred embodiment is in accordance with the physical location on disk at which each such block will be written. This also generally corresponds to an order which is encountered by a write head during a physical scan of a disk. The disks of a mirrored pair are operated out of phase with each other, so that one will be in read mode while the other is in write mode. Updated blocks are written out to the disk that is in write mode in sorted order, while guaranteed read performance is provided by the other disk that is in read mode. When a batch of updates has been applied to one disk of a mirrored pair, the mirrored pair switch their modes, and the other disk is updated. Preferably the updates are kept in a non-volatile memory, which furthermore advantageously may be made fault-tolerant as well. During recovery a pair of spare alternating mirrored disks is introduced to which new updates are directed, while a background scan process copies data from the surviving disk to the new mirrored pair.
-
Patent Agency Ranking
公开(公告)号：DE3788604T2
公开(公告)日：1994-06-30
申请号：DE3788604
申请日：1987-07-21
Applicant: IBM
Inventor： BUX WERNER K , DIAS DANIEL M , GOYAL AMBUJ
IPC: H04L12/433 , H04L12/28
Abstract: In a communication system comprising several stations, access to the ring is granted to one station at a time by circulating a token on the ring and updating the priority of the token when required to provide priority access. This invention provides for a first station to transmit a token immediately after it has finished transmitting a frame containing a packet(s) needed to be transmitted from the first station without waiting for the header of the frame to return to the first station. A priority signalling packet (60) is then transmitted on the ring from the first station after the first station transmits the token on the ring. This priority signalling packet contains received information as to the particular priority level that the token should be updated to. Finally, the priority level of the token (50) is updated to correspond to the particular priority level when the priority signalling packet (60) reaches the station (17) that holds the token.
-
公开(公告)号：CA1264081A
公开(公告)日：1989-12-27
申请号：CA531780
申请日：1987-03-11
Applicant: IBM
Inventor： DIAS DANIEL M , KUMAR MANOJ , LIEN YEONG-CHANG L , MARUYAMA KIYOSHI
Abstract: DISTRIBUTED VOICE-DATA SWITCHING ON MULTI-STAGE INTERCONNECTION NETWORKS A method of switching synchronous and asynchronous data packets through a multi-stage interconnection network (MIN), so as to insure that packets with the highest assignable priority level will never be blocked at any stage of the network. More specifically, this invention relates to a method of switching voice and data packets over the MIN wherein each of the address bits in each packet determine the connection to be established at each particular stage in the network and wherein each packet has therein a priority level. In each time slot of a frame, the priority level of the packets stored in a particular originating adapter are compared and the packet with the highest priority level in each adapter is forwarded through the MIN and routed through the MIN as described above. Also, at each subswitch at each stage of the MIN, if two or more packets request the same subswitch output, only the packet with the higher priority is forwarded to the subswitch output. A packet will be assigned the highest priority only if a corresponding packet for a given circuit connection with second highest priority level was successfully transmitted through the MIN.
-
公开(公告)号：DE3787492T2
公开(公告)日：1994-05-11
申请号：DE3787492
申请日：1987-03-27
Applicant: IBM
Inventor： DIAS DANIEL M , KUMAR MANOJ , LIEN YEONG-CHANG L , MARUYAMA KIYOSHI
Abstract: A method of switching synchronous and asynchronous data packets through a multi-stage interconnection network (MIN), so as to insure that packets with the highest assignable priority level will never be blocked at any stage of the network. More specifically, this invention relates to a method of switching voice and data packets over the MIN wherein each of the address bits in each packet determine the connection to be established at each particular stage in the network and wherein each packet has therein a priority level. In each time slot of a frame, the priority level of the packets stored in a particular originating adapter are compared and the packet with the highest priority level in each adapter is forwarded through the MIN and routed through the MIN as described above. Also, at each subswitch at each stage of the MIN, if two or more packets request the same subswitch output, only the packet with the higher priority is forwarded to the subswitch output. A packet will be assigned the highest priority only if a corresponding packet for a given circuit connection with second highest priority level was successfully transmitted through the MIN.
-
公开(公告)号：DE3788604D1
公开(公告)日：1994-02-10
申请号：DE3788604
申请日：1987-07-21
Applicant: IBM
Inventor： BUX WERNER K , DIAS DANIEL M , GOYAL AMBUJ
IPC: H04L12/433 , H04L12/28
Abstract: In a communication system comprising several stations, access to the ring is granted to one station at a time by circulating a token on the ring and updating the priority of the token when required to provide priority access. This invention provides for a first station to transmit a token immediately after it has finished transmitting a frame containing a packet(s) needed to be transmitted from the first station without waiting for the header of the frame to return to the first station. A priority signalling packet (60) is then transmitted on the ring from the first station after the first station transmits the token on the ring. This priority signalling packet contains received information as to the particular priority level that the token should be updated to. Finally, the priority level of the token (50) is updated to correspond to the particular priority level when the priority signalling packet (60) reaches the station (17) that holds the token.
-
公开(公告)号：DE3787492D1
公开(公告)日：1993-10-28
申请号：DE3787492
申请日：1987-03-27
Applicant: IBM
Inventor： DIAS DANIEL M , KUMAR MANOJ , LIEN YEONG-CHANG L , MARUYAMA KIYOSHI
Abstract: A method of switching synchronous and asynchronous data packets through a multi-stage interconnection network (MIN), so as to insure that packets with the highest assignable priority level will never be blocked at any stage of the network. More specifically, this invention relates to a method of switching voice and data packets over the MIN wherein each of the address bits in each packet determine the connection to be established at each particular stage in the network and wherein each packet has therein a priority level. In each time slot of a frame, the priority level of the packets stored in a particular originating adapter are compared and the packet with the highest priority level in each adapter is forwarded through the MIN and routed through the MIN as described above. Also, at each subswitch at each stage of the MIN, if two or more packets request the same subswitch output, only the packet with the higher priority is forwarded to the subswitch output. A packet will be assigned the highest priority only if a corresponding packet for a given circuit connection with second highest priority level was successfully transmitted through the MIN.
-
-
-
-
-
-
-
Search Results
8
records
(took 0.027 seconds)
