scholarly journals A Heuristic for Scheduling Parallel Programs with Synchronous Communication Model in the Network Computing Environments

2005 ◽  
pp. 270-273
Author(s):  
Mingyu Zhao ◽  
Tianwen Zhang
Keyword(s):  
Parallel Programs ◽  
Synchronous Communication ◽  
Communication Model ◽  
Network Computing ◽  
Computing Environments

Visualizing parallel simulations that execute in network computing environments

1999 ◽  
Vol 15 (4) ◽  
pp. 513-529 ◽  
Author(s):  
C.D. Carothers ◽  
Brad Topol ◽  
R.M. Fujimoto ◽  
J.T. Stasko ◽  
Vaidy Sunderam
Keyword(s):  
Network Computing ◽  
Parallel Simulations ◽  
Computing Environments

Visualizing parallel simulations in network computing environments

1997 ◽  
Author(s):  
Christopher D. Carothers ◽  
Brad Topol ◽  
Richard M. Fujimoto ◽  
John T. Stasko ◽  
Vaidy Sunderam
Keyword(s):  
Network Computing ◽  
Parallel Simulations ◽  
Computing Environments

scholarly journals Naming in Multichannel with Beeps in the Strong Model

2020 ◽  
Vol 10 (20) ◽  
pp. 7164
Author(s):  
Layla S. Aldawsari ◽  
Tom Altman
Keyword(s):  
Collision Detection ◽  
Single Channel ◽  
Synchronous Communication ◽  
Monte Carlo Algorithm ◽  
Optimal Time ◽  
Communication Model ◽  
Multiple Channels ◽  
Probability Of Success ◽  
Las Vegas Algorithm ◽  
Anonymous Processes

In this paper, a system of anonymous processes is considered that communicates with beeps through multiple channels in a synchronous communication model. In beeping channels, processes are limited to hearing either a beep or a silence from the channel with no collision detection. A strong model is assumed in which a process can beep on any single channel and listen on any specific channel during a single round. The goal is to develop distributed naming algorithms for two models where the number of processes is either known or unknown. A Las Vegas algorithm was developed for naming anonymous processes when the number of processes is known. This algorithm has an optimal time complexity of O(nlogn) rounds and uses O(nlogn) random bits, where n is the number of processes for the largest group. For the model with an unknown number of processes, a Monte Carlo algorithm was developed, which has an optimal running time of O(nlogn) rounds and a probability of success that is at least 1−12Ω(logn). The algorithms solve the naming problem in new models where processes communicate through multiple channels.

scholarly journals Cross-chain deals and adversarial commerce

2021 ◽  
Author(s):  
Maurice Herlihy ◽  
Barbara Liskov ◽  
Liuba Shrira
Keyword(s):  
Synchronous Communication ◽  
Management Systems ◽  
Communication Model ◽  
Distributed Data ◽  
Data Management Systems ◽  
Distributed Data Management ◽  
Distributed Computations ◽  
Liveness Properties ◽  
Atomic Transactions ◽  
Access To Data

AbstractModern distributed data management systems face a new challenge: how can autonomous, mutually distrusting parties cooperate safely and effectively? Addressing this challenge brings up familiar questions from classical distributed systems: how to combine multiple steps into a single atomic action, how to recover from failures, and how to synchronize concurrent access to data. Nevertheless, each of these issues requires rethinking when participants are autonomous and potentially adversarial. We propose the notion of a cross-chain deal, a new way to structure complex distributed computations that manage assets in an adversarial setting. Deals are inspired by classical atomic transactions, but are necessarily different, in important ways, to accommodate the decentralized and untrusting nature of the exchange. We describe novel safety and liveness properties, along with two alternative protocols for implementing cross-chain deals in a system of independent blockchain ledgers. One protocol, based on synchronous communication, is fully decentralized, while the other, based on semi-synchronous communication, requires a globally shared ledger. We also prove that some degree of centralization is required in the semi-synchronous communication model.

scholarly journals Interprocess Communication with Java in a Microsoft Windows Environment

2017 ◽  
Vol 29 (3) ◽  
Author(s):  
Dylan Gregory Smith ◽  
George Wells
Keyword(s):  
Programming Language ◽  
Multicore Processors ◽  
Synchronous Communication ◽  
Multiprocessor System ◽  
Communication Model ◽  
Interprocess Communication ◽  
Java Programming Language ◽  
Java Programming ◽  
Programming Techniques ◽  
Microsoft Windows

The Java programming language provides a comprehensive set of multithreading programming techniques but currently lacks interprocess communication (IPC) facilities, other than slow socket-based communication mechanisms (which are intended primarily for distributed systems, not interprocess communication on a multicore or multiprocessor system). This is problematic due to the ubiquity of modern multicore processors, and the widespread use of Java as a programming language throughout the software development industry. This work aimed to address this problem by utilising Microsoft Windows’ native IPC mechanisms through a framework known as the Java Native Interface. This enabled the use of native C code that invoked the IPC mechanisms provided by Windows, which allowed successful synchronous communication between separate Java processes. The results obtained illustrate the performance dichotomy between socket-based communication and native IPC facilities, with Windows’ facilities providing significantly faster communication. Ultimately, these results show that there are far more effective communication structures available. In addition, this work presents generic considerations that may aid in the eventual design of a generic, platform-independent IPC system for the Java programming language. The fundamental considerations include shared memory with semaphore synchronisation, named pipes and a socket communication model.

PVaniM: a tool for visualization in network computing environments

1998 ◽  
Vol 10 (14) ◽  
pp. 1197-1222 ◽  
Author(s):  
Brad Topol ◽  
John T. Stasko ◽  
Vaidy Sunderam
Keyword(s):  
Network Computing ◽  
Computing Environments

Using Binding Communication to Promote Conservation Among Hotel Guests

2015 ◽  
Vol 74 (3) ◽  
pp. 169-175 ◽  
Author(s):  
Lohyd Terrier ◽  
Benedicte Marfaing
Keyword(s):  
Low Cost ◽  
Communication Strategies ◽  
Communication Strategy ◽  
Communication Model ◽  
Classical Communication ◽  
Persuasive Message ◽  
Sustainable Behavior ◽  
And Behavior ◽  
Attitudes And Behavior

This research applies the binding communication model to the sustainable communication strategies implemented in most hotels. The binding communication model links a persuasive message with the implementation of a low-cost commitment to strengthen the link between the attitudes and behavior of those receiving the message. We compared the effectiveness of a classical communication strategy (n = 86) with that of a binding communication strategy (n = 101) to encourage guests to choose sustainable behavior. Our results show that using the binding communication strategy generates significantly more sustainable behavior in guests than using the classical communication strategy. We discuss our results and suggest future avenues of research.

Sign in / Sign up

Export Citation Format

Share Document