In this paper, we develop efficient selection and sorting schemes for processing large files distributed over a network. The efficiencies of the schemes are expressed in terms of message count and communication delay. The schemes are developed using the concept of coteries which is a class of communication structures widely used in the development of some classical distributed algorithms, namel...

Component orientation is a current trend for creating modern applications. The concept of a component is broad and includes plugins and other units of modularization. Typically, components exhibit dependencies on other components or resources; any such dependencies are requirements needed for the component to function. As a consequence, deploying a component requires deploying the transitive cl...

Message Passing Interface (MPI) is the most commonly used method for programming distributed-memory systems. Most MPI implementations use a rendezvous protocol for transmitting large messages. One of the features desired in a MPI implementation is the ability to asynchronously progress the rendezvous protocol. This is important to provide potential for good computation and communication overlap...