Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Optimal Algorithm for Concatenating Data in Message-Passing Systems with a Multiport Communication Model

IP.com Disclosure Number: IPCOM000105684D
Original Publication Date: 1993-Aug-01
Included in the Prior Art Database: 2005-Mar-20
Document File: 2 page(s) / 20K

Publishing Venue

IBM

Related People

Bruck, J: AUTHOR [+3]

Abstract

Disclosed is an optimal algorithm for performing concatenation (i.e., all-to-all broadcasting) in a message-passing parallel system with a d-port communication model, for any integer d < 1. In a d-port communication model, each node can send messages to d different nodes and, simultaneously in the same time step, receive messages from d different nodes. The disclosed algorithm performs a concatenation complexity measures:

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 100% of the total text.

Optimal Algorithm for Concatenating Data in Message-Passing Systems with a Multiport Communication Model

      Disclosed is an optimal algorithm for performing concatenation
(i.e., all-to-all broadcasting) in a message-passing parallel system
with a d-port communication model, for any integer d < 1.  In a
d-port communication model, each node can send messages to d
different nodes and, simultaneously in the same time step, receive
messages from d different nodes.  The disclosed algorithm performs a
concatenation complexity measures:

1.  the number of communication steps

2.  the amount of data transferred in sequence by any processor

3.  the total amount of data communicated over the network.