enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Hypercube (communication pattern) - Wikipedia

    en.wikipedia.org/wiki/Hypercube_(communication...

    dimensional hypercube is a network topology for parallel computers with processing elements. The topology allows for an efficient implementation of some basic communication primitives such as Broadcast, All-Reduce, and Prefix sum. [1]

  3. Inter-process communication - Wikipedia

    en.wikipedia.org/wiki/Inter-process_communication

    A grid computing system that connects many personal computers over the Internet via inter-process network communication. In computer science, inter-process communication (IPC), also spelled interprocess communication, are the mechanisms provided by an operating system for processes to manage shared data.

  4. Berkeley sockets - Wikipedia

    en.wikipedia.org/wiki/Berkeley_sockets

    The Berkeley socket API is a general interface for networking and interprocess communication, and supports the use of various network protocols and address architectures. The following lists a sampling of protocol families (preceded by the standard symbolic identifier) defined in a modern Linux or BSD implementation:

  5. Two-tree broadcast - Wikipedia

    en.wikipedia.org/wiki/Two-tree_broadcast

    The communication time of the algorithm is βm + αlog p + √ 4αβmlog p, [7] so the startup latency is only one half of the startup latency of the two-tree broadcast. The drawback of the ESBT broadcast is that it does not work for other values of p and it cannot be adapted for (non-commutative) reduction or prefix sum.

  6. Message Passing Interface - Wikipedia

    en.wikipedia.org/wiki/Message_Passing_Interface

    The message-passing paradigm is attractive because of wide portability and can be used in communication for distributed-memory and shared-memory multiprocessors, networks of workstations, and a combination of these elements. The paradigm can apply in multiple settings, independent of network speed or memory architecture.

  7. Collective operation - Wikipedia

    en.wikipedia.org/wiki/Collective_operation

    More information under Network topology. For each operation, the optimal algorithm can depend on the input sizes . For example, broadcast for short messages is best implemented using a binomial tree whereas for long messages a pipelined communication on a balanced binary tree is optimal.

  8. Communicating sequential processes - Wikipedia

    en.wikipedia.org/wiki/Communicating_sequential...

    CSP provides two classes of primitives in its process algebra: events and primitive processes. Events. Events represent communications or interactions. They are assumed to be instantaneous, and their communication is all that an external ‘environment’ can know about processes. An event is communicated only if the environment allows it.

  9. Computer network programming - Wikipedia

    en.wikipedia.org/wiki/Computer_network_programming

    Whether a communication is connection-oriented or connectionless, is defined by the communication protocol, and not by application programming interface (API). Examples of the connection-oriented protocols include Transmission Control Protocol (TCP) and Sequenced Packet Exchange (SPX) , and examples of connectionless protocols include User ...