Resumes
Resumes
Shlomo Kipnis Phones & Addresses
-
Teaneck, NJ
-
Lakeland, GA
-
Brookline, MA
Publications
Us Patents
System For Selectively Packing Together Datablocks And Efficiently Routing Independent Of Network Topology In A Parallel Computer System In Accordance With A Selected Numbering System
View pageUS Patent:
55618057, Oct 1, 1996
Filed:
Oct 22, 1992
Appl. No.:
7/965491
Inventors:
Jehoshua Bruck - Palo Alto CA
Ching-Tien Ho - San Jose CA
Shlomo Kipnis - Teaneck NJ
Ching-Tien Ho - San Jose CA
Shlomo Kipnis - Teaneck NJ
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 1300
US Classification:
395800
Abstract:
A method for routing multiple message packets to their respective destinations on a parallel system is disclosed which takes into account the value of the communication start-up time and the transmission time For the specific parallel system. The preferred embodiment involves first selecting a base using the parameters of communication start-up and transmission time and then for each datablock, subtracting the node address from the destination address of the datablock using the modulo-n subtractions to Form a relative offset and representing the relative offset in the pre-selected base before sending the datablocks to their destination nodes in phases, each phase involving scanning the individual i-th digits of the relative offset value and packing those datablocks with identical i-th digits of the relative offset together.
Bus-Based Priority Arbitration System With Optimum Codewords
View pageUS Patent:
51014823, Mar 31, 1992
Filed:
Oct 16, 1989
Appl. No.:
7/422158
Inventors:
Shlomo Kipnis - Brookline MA
Assignee:
Massachusetts Institute of Technology - Cambridge MA
International Classification:
G06F 1300
US Classification:
395325
Abstract:
A bus-based priority arbitration system employs optimum priority codewords to arbitrate in time t. For m arbitration busses, each priority codeword has m bits and at most t intervals of consecutive 0's or consecutive 1's, disregarding leading consecutive 0's. The arbitration busses are wired-OR busses. An arbitration protocol performed by the modules involved in an arbitration process applies respective codewords of the contending modules to the arbitration busses, each bit on a different bus. The codewords insure that the modules determine from the arbitration busses the contending module of highest priority in at most t units of time. Also, the arbitration system defines priority codewords as a function of arbitration time and number of aribitration busses which enables design optimization of a desired arbitration system. In one case, the number of arbitration busses m required in a system of n supportable modules is defined by the relationships 1 g n. ltoreq. m. ltoreq. 1 g n +1 and t= 1/21 g n.