Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Parallel communication”

Massively Parallel Communication

Dan Suciu, Main Cost Disk I/o, Main Cost Communication et al. · 2015

• How much communication is needed to solve a “problem ” on p servers? • This talk: define a parallel model (MPC) and analyze the communication cost for full conjunctive queries • Why Highlights of Logic? Queries + parallel processing + communication complexity References:

Cited by 0

PARALLEL COMMUNICATION INTERFACE

A. V. Ryabov, O. Sh. Shakhruhanov, Vladimir Ivanov et al. · SHILAP Revista de lepidopterología · 2017

Structural circuit design of an interface working in the line as long as 30 m is developed and given. In working with computerized control systems data transmission from the central computer to peripherals and vice versa is needed. We have developed a parallel communication interface which permits to transmit an eight-bit signal in TTL-levels from the unibus of the PC-type IBM AT at a distance up to 30 meters, at a velocity up to 400 kilobyte/sec.Structural scheme of the device is given in the Figure below. Similarly is arranged the information reception in PC. A computer part of the interface is executed in the form of a circuit-board inserted into a unibus of PC. A real product of this type provides stable work of the information device as distant from the control computer as 32 meters. This system is supposed to be used in the automatic observational devices of the meridian circle.

Cited by 0Open access

Communication-Efficient Parallel Sorting

Michael T. Goodrich · SIAM Journal on Computing · 1999

We study the problem of sorting n numbers on a p-processor bulk-synchronous parallel (BSP) computer, which is a parallel multicomputer that allows for general processor-to-processor communication rounds provided each processor sends and receives at most h items in any round. We provide parallel sorting methods that use internal computation time that is $O({n\log n \over p})$ and a number of communication rounds that is $O({\log n \over \log (h+1)})$ for $h=\Theta(n/p)$. The internal computation bound is optimal for any comparison-based sorting algorithm. Moreover, the number of communication rounds is bounded by a constant for the (practical) situations when $p\le n^{1-{1/c}}$ for a constant $c\ge 1$. In fact, we show that our bound on the number of communication rounds is asymptotically optimal for the full range of values for p, for we show that just computing the "or"of n bits distributed evenly to the first O(n/h) of an arbitrary number of processors in a BSP computer requires $\Omega(\log n/\log (h+1))$ communication rounds.

Cited by 131

Communication Issues Regarding Parallel . . .

Marco Kesseler · 1992

Efficient communication is the basis of an implementation of a parallel language on a distributed machine architecture. This article handles about the communication mechanism that is needed to support parallel graph rewriting in Concurrent Clean. The danger of deadlock is imminent at several levels of such a system. Communication problems and their solutions are closely related to memory management issues, garbage collection in particular. In fact the communication mechanism presented here is a global memory management system. It is part of a distributed runtime system that has been moulded to fit parallel graph rewriting as implemented in Concurrent Clean.

Cited by 0

Communication optimization in parallel applications

Minfeng Zhu · DR-NTU (Nanyang Technological University) · 2002

The proliferation of the distributed computing is due to the improved performance and increased reliability of these systems. Many parallel programming languages and related parallel programming models have become widely accepted. However, one of the major shortcomings of running parallel applications on distributed computing environments is the high communication overhead incurred.

Cited by 1

Semantic of Communication Parallel Processes

Greif, Irene Gloria · DSpace@MIT (Massachusetts Institute of Technology) · 1975

The thesis of this dissertation is that an understanding of the ordering constraints that are introduced among events of parallel process is essential to the understanding of synchronization and that therefore any language for specifying synchronization of parallel processes should be based on a theory of such orderings. While it is possible to write specifications for systems communicating parallel processes by reference to the time ordering of some global clock external to the system, such specifications cannot be as useful as ones which are in terms of orderings derivable within the system.

Cited by 0Open access

Communication Issues in Parallel Computation

Newman-Wolfe, Richard Ernest, Peterson, Gary L. · UR Research (University of Rochester)

Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science Dept., 1986. Simultaneously published in the Technical Report series.

Cited by 1Open access

Parallel processing spacecraft communication system

Wood, Steven H., Luong, Huy H., Bolotin, Gary S. et al. · NASA Technical Reports Server (NASA)

An uplink controlling assembly speeds data processing using a special parallel codeblock technique. A correct start sequence initiates processing of a frame. Two possible start sequences can be used; and the one which is used determines whether data polarity is inverted or non-inverted. Processing continues until uncorrectable errors are found. The frame ends by intentionally sending a block with an uncorrectable error. Each of the codeblocks in the frame has a channel ID. Each channel ID can be separately processed in parallel. This obviates the problem of waiting for error correction processing. If that channel number is zero, however, it indicates that the frame of data represents a critical command only. That data is handled in a special way, independent of the software. Otherwise, the processed data further handled using special double buffering techniques to avoid problems from overrun. When overrun does occur, the system takes action to lose only the oldest data.

Cited by 0Open access