-
公开(公告)号:DE3853162T2
公开(公告)日:1995-08-17
申请号:DE3853162
申请日:1988-12-23
Applicant: IBM
Inventor: BASSO CLAUDE , PAUPORTE ANDRE , LEBIZAY GERALD , POIRAUD CLEMENT , MUNIER JEAN-MARIE
IPC: G06F15/16 , G06F9/46 , G06F12/06 , G06F13/16 , G06F15/167 , G06F15/177
-
公开(公告)号:BR8200851A
公开(公告)日:1982-12-28
申请号:BR8200851
申请日:1982-02-17
Applicant: IBM
Inventor: LECHACZYNSKI MICHEL , PAUPORTE ANDRE , THERY PIERRE HENRY , WALLER RICHARD
-
公开(公告)号:DE69305734T2
公开(公告)日:1997-05-15
申请号:DE69305734
申请日:1993-06-30
Applicant: IBM
Inventor: GALAND CLAUDE , MAUDUIT DANIEL , PAUPORTE ANDRE , SPAGNOL VICTOR , LEBIZAY GERALD , MUNIER JEAN-MARIE , SAINT-GEORGES ERIC
IPC: H04L29/06
Abstract: A high performance data packet buffering method and a programmable data communication adapter for high speed packet transmission networks are disclosed. The line adapter includes programmable processing means, for receiving and transmitting data packets of fixed or variable length. This system is characterized in that it comprises means for buffering (132) said data packets, means for identifying said buffering means and said data packets in said buffering means, means for queueing (Figure 15) in storing means (131) said identifying means in a single instruction, means for dequeueing (Figure 16) from said storing (131) means said identifying means in another single instruction , means for releasing said buffering means, Each instruction comprises up to three operations executed in parallel by said processing means : an arithmetical and logical (ALU) operation on said identifying means, a memory operation on said storing means, and a sequence operation.
-
公开(公告)号:DE69305734D1
公开(公告)日:1996-12-05
申请号:DE69305734
申请日:1993-06-30
Applicant: IBM
Inventor: GALAND CLAUDE , MAUDUIT DANIEL , PAUPORTE ANDRE , SPAGNOL VICTOR , LEBIZAY GERALD , MUNIER JEAN-MARIE , SAINT-GEORGES ERIC
IPC: H04L29/06
Abstract: A high performance data packet buffering method and a programmable data communication adapter for high speed packet transmission networks are disclosed. The line adapter includes programmable processing means, for receiving and transmitting data packets of fixed or variable length. This system is characterized in that it comprises means for buffering (132) said data packets, means for identifying said buffering means and said data packets in said buffering means, means for queueing (Figure 15) in storing means (131) said identifying means in a single instruction, means for dequeueing (Figure 16) from said storing (131) means said identifying means in another single instruction , means for releasing said buffering means, Each instruction comprises up to three operations executed in parallel by said processing means : an arithmetical and logical (ALU) operation on said identifying means, a memory operation on said storing means, and a sequence operation.
-
公开(公告)号:CA2144402A1
公开(公告)日:1995-10-15
申请号:CA2144402
申请日:1995-03-10
Applicant: IBM
Inventor: LEBIZAY GERALD , MUNIER JEAN M , PAUPORTE ANDRE , SPAGNOL VICTOR
IPC: H04L12/56
Abstract: The present invention relates to an efficient point-to-point and multi-points routing system and method for programmable data communication adapters in packetswitching nodes of high speed networks. The general principles of this efficiency are as follows. First, data packets are never copied, only packet pointers are copied for each destination, Space in Buffer Memory is saved, the number of instructions is significantly reduced improving the packet throughput (number of packets per seconds that the adapter is able to transmit). and the routing is independent of the packets length. Second, no overhead is generated by the multi-points mechanism in the real time procedures, the underrun/overrun problems on the outputs are reduced and the efficiency of the adapter in term data throughput (bits per second) is significantly improved. Third, each output is processed independently by means of interrupts, lines are managed in real time and lines of different speed or protocol can be supported in parallel. Fourth, the release of the resources is entirely realized on a non priority mode.
-
公开(公告)号:BR9402596A
公开(公告)日:1995-06-13
申请号:BR9402596
申请日:1994-06-29
Applicant: IBM
Inventor: GALAND CLAUDE , LEBIZAY GERALD , MAUDUIT DANIEL , MUNIER JEAN-MARIE , PAUPORTE ANDRE , SAINT-GEORGES ERIC , SPAGNOL VICTOR
Abstract: A high performance data packet buffering method and a programmable data communication adapter for high speed packet transmission networks are disclosed. The line adapter includes programmable processing means, for receiving and transmitting data packets of fixed or variable length. This system is characterized in that it comprises means for buffering (132) said data packets, means for identifying said buffering means and said data packets in said buffering means, means for queueing (Figure 15) in storing means (131) said identifying means in a single instruction, means for dequeueing (Figure 16) from said storing (131) means said identifying means in another single instruction , means for releasing said buffering means, Each instruction comprises up to three operations executed in parallel by said processing means : an arithmetical and logical (ALU) operation on said identifying means, a memory operation on said storing means, and a sequence operation.
-
公开(公告)号:DE3689151D1
公开(公告)日:1993-11-11
申请号:DE3689151
申请日:1986-12-30
Applicant: IBM
Inventor: GIROIR DIDIER FRANCIS VILLA LE , MULLERY ALVIN PAUL , PAUPORTE ANDRE
-
公开(公告)号:DE3176193D1
公开(公告)日:1987-06-19
申请号:DE3176193
申请日:1981-12-29
Applicant: IBM
Inventor: LECHACZYNSKI MICHEL , PAUPORTE ANDRE , THERY PIERRE , WALLER RICHARD
-
公开(公告)号:CA1172381A
公开(公告)日:1984-08-07
申请号:CA395401
申请日:1982-02-02
Applicant: IBM
Inventor: LECHACZYNSKI MICHEL , PAUPORTE ANDRE , THERY PIERRE H , WALLER RICHARD
Abstract: PROCESS AND DEVICE FOR SELECTIVELY ASSIGNING THE RESOURCES OF A CONTROL UNIT TO A SELECTED USER AMONG A PLURALITY OF POTENTIAL USERS Process and device (35) for assigning a resource as the read-only memory of a control unit to a selected user among several users 1 to 6 according to their priority order and to a principle of time sharing between the users performing the longest tasks. When a user carrying out a long operation, is selected, it is maintained busy for all the duration of the operation but the other users can be selected.
-
-
-
-
-
-
-
-