36 results about "Collective communication" patented technology

A group messaging system enabling anonymous collective communications in a group which is locally defined in association with a group owner's messaging account, wherein messaging software at the group owner converts a group message into multiple one-to-one group messages destined to each group member in collaboration with the said group membership resolution process. The invention further includes a group message reply process wherein the messaging software at a recipient's side composes a reply message and transmits it to the group owner messaging software which then forwards it to the group members in collaboration with said group membership resolution process, thereby providing a means of designating the identity of a group in the group owner messaging account, sending a group message, and hiding the identities of individual recipients during the lifetime of the group message. The group owner side can additionally perform access control for group communications.

A facility is provided for communicating among processes in a symmetric multi-processing (SMP) cluster environment wherein at least some SMP nodes of the SMP cluster include multiple processes. The facility includes transferring intra-nodal at an SMP node messages of a collective communication among processes employing a shared memory of the SMP node; and responsive to the intra-nodal transferring, concurrently transferring inter-nodal multiple messages of the collective communication from n SMP node(s) to m other SMP node(s), wherein at least one of n or m is greater than one. The concurrently transferring is performed by multiple processes of at least one of the n SMP node(s) or the m other SMP node(s). More particularly, the facility includes concurrently transferring inter-nodal the multiple messages from one of: one SMP node to multiple other SMP nodes, multiple SMP nodes to one other SMP node, or multiple SMP nodes to multiple other SMP nodes.

A system and method for supporting collective communications on a plurality of processors that use different parallel programming paradigms, in one aspect, may comprise a schedule defining one or more tasks in a collective operation an executor that executes the task, a multisend module to perform one or more data transfer functions associated with the tasks, and a connection manager that controls one or more connections and identifies an available connection. The multisend module uses the available connection in performing the one or more data transfer functions. A plurality of processors that use different parallel programming paradigms can use a common implementation of the schedule module, the executor module, the connection manager and the multisend module via a language adaptor specific to a parallel programming paradigm implemented on a processor.

The invention discloses a collective communication mobile terminal system and application of the system. The system comprises a mobile terminal instant messaging client, a UST module, a UPUSH engine module, and a background server, wherein the mobile terminal instant messaging client runs on the mobile terminal of a user and is used for inputting and displaying information; the UST module is used for verifying a user, managing and storing user information, such as the related account information of the user-bound instant messaging tool and a social website; the UPUSH engine module is used for pushing the communication messages of the mobile terminal instant messaging client to the background server or pushing the messages of the background server to the mobile terminal instant messaging client; and the background server is used for communicating with the user-bound instant messaging tool and the social website. According to the invention, the system can bind a plurality of instant messaging tools to realize unified management of the instant messaging tools and to realize message sending cross the messaging tools.

A system and method for enabling high-speed, low-latency global collective communications among interconnected processing nodes. The global collective network optimally enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices ate included that interconnect the nodes of the network via links to facilitate performance of low-latency global processing operations at nodes of the virtual network and class structures. The global collective network may be configured to provide global barrier and interrupt functionality in asynchronous or synchronized manner. When implemented in a massively-parallel supercomputing structure, the global collective network is physically and logically partitionable according to needs of a processing algorithm.

An electronic shelf label system includes a plurality of electronic shelf labels, plurality of transmitters, and a transmission controller. The transmission controller divides the transmitters into a plurality of communication groups so that each of the communication groups has a collective communication area including at least one of the transmitters, and to control the transmitters in units of the communication groups. The transmission controller also controls all of the transmitters included in one of the communication group, which is determined based on input of position specification information for specifying a position of a worker who is utilizing a portable information processing device, to cause product information of a target product to be transmitted to a target electronic shelf label by one of the transmitters that belongs to the communication group.

Intra-node data transfer in collective communications is facilitated. A memory object of one task of a collective communication is concurrently attached to the address spaces of a plurality of other tasks of the communication. Those tasks that attach the memory object can access the memory object as if it was their own. Data can be directly written into or read from an application data structure of the memory object by the attaching tasks without copying the data to/from shared memory.

A communication method for collective operations is provided which eliminates the need for a three layered structure. Instead, the method of the present invention employs a control structure which is specifically designed to keep track of the progress of the collective communication operations and the facilities for the handling of asynchronous message passing. The method of the present invention thus eliminates the need for an intermediary, point-to-point communication layer that is required to follow message matching semantics for sending messages, receiving messages and for awaiting message arrivals. Application layer tasks and user defined programs running in the communication layer share access to the control structure as a mechanism for synchronizing and scheduling the progress of the collective communication operation.

The invention provides a collective communication method based on physical location awareness. The method includes the steps of: sensing the location of an objective process; when the objective process and a current process are located in a same physical chip, determining whether a local operation core is idle through query; and under the condition that the local operation core is idle, initiating a memory direct access operation through the local operation core, and directly writing communication data in an objective process main memory on the same physical chip, so that communication in the same physical chip no longer needs to transfer through a network interface. According to the collective communication method based on physical location awareness, when large-scale collective communication is performed, through sensing of the location of the objective process, based on a router chip routing algorithm, and according to a port-conflict-free principle, routing conflict during communication is minimized.

Methods, apparatuses, and computer program products for optimizing collective communications within a parallel computer comprising a plurality of hardware threads for executing software threads of a parallel application are provided. Embodiments include a processor of a parallel computer determining for each software thread, an affinity of the software thread to a particular hardware thread. Each affinity indicates an assignment of a software thread to a particular hardware thread. The processor also generates one or more affinity domains based on the affinities of the software threads. Embodiments also include a processor generating, for each affinity domain, a topology of the affinity domain based on the affinities of the software threads to the hardware threads. According to embodiments of the present application, a processor also performs, based on the generated topologies of the affinity domains, a collective operation on one or more software threads.

The invention relates to a collective communication function modeling method of a parallel program, and aims to eliminate the defects in the prior art that communication time data can not be accurately obtained and a great quantity of time and money is consumed. The collective communication function modeling method of the parallel program comprises the following specific process: S1: measuring a collective communication function under an experimental platform for N times, and obtaining the communication time data of the collective communication function under different degrees of parallelism and data sizes; and S2: utilizing an artificial neural network based on a BP (Back Propagation) algorithm to fit the communication time data of the collective communication function under different degrees of parallelism and data sizes to obtain a neural network model of a corresponding communication function. The collective communication function modeling method is used for the field of the communication technology.

A collective communication apparatus and method for parallel computing systems. For example, one embodiment of an apparatus comprises a plurality of processor elements (PEs); collective interconnect logic to dynamically form a virtual collective interconnect (VCI) between the PEs at runtime without global communication among all of the PEs, the VCI defining a logical topology between the PEs in which each PE is directly communicatively coupled to a only a subset of the remaining PEs; and execution logic to execute collective operations across the PEs, wherein one or more of the PEs receive first results from a first portion of the subset of the remaining PEs, perform a portion of the collective operations, and provide second results to a second portion of the subset of the remaining PEs.