Results 211 to 220 of about 10,148 (267)

Concurrency and Synchronisation in Actel

Anais do IX Simpósio Brasileiro de Engenharia de Software (SBES 1995), 1995
This paper introduces concurrency mechanisms of a new concurrent object based language called Actel. In particular, it focuses on the issues of how to explore parallel computation with object oriented techniques, how to achieve a good run time efficiency, and how to avoid the burden of explicit synchronisation. Actel offers a variety of inter and intra-
Zair Abdelouahab, Peter M. Dew
openaire   +1 more source

Practical barrier synchronisation

Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -, 2002
We investigate the performance of barrier synchronisation on both shared memory and distributed memory architectures, using a wide range of techniques. The performance results obtained show that distributed memory architectures behave predictably, although their performance for barrier synchronisation is relatively poor. For shared memory architectures,
Jonathan M. D. Hill, David B. Skillicorn
openaire   +1 more source

Synchronising asynchronous communications

1997
BSP is a model of parallel computation which employs global synchronisation as a means of ensuring that a set of communications has reached completion. The efficiency properties of the model have been widely investigated. In this paper the model's associated semantic framework is studied.
Alan Stewart, Maurice Clint
openaire   +1 more source

Universal classifier and synchroniser

International Journal of Autonomous and Adaptive Communications Systems, 2010
Extracting parameters from a received signal and auto-demodulating based on these parameters without prior information from the transmitter can be beneficial to dynamic spectrum access, cognitive radio and many other applications. Universal classifier and synchroniser (UCS) is conceived as such a self-contained system that can detect, classify and ...
Ying Wang, Qinqin Chen, Charles W. Bostian   +2 more
openaire   +1 more source

Continuously synchronised growth

Journal of Applied Chemistry and Biotechnology, 1972
AbstractThe advent of cell synchrony as a refinement in technique for cultivating microbes has given new dimensions to the study of microbial growth.By wedding synchrony to continuous culture, it becomes possible to convert and resolve the invariant (steady state) performance of asynchronous growth in a chemostat into a recognisable pattern of (cell ...
openaire   +1 more source

Global synchronisation in Linda

Concurrency: Practice and Experience, 1994
AbstractThe paper examines the ‘Distributed Summation’ problem, and its solution in Linda. A number of problems with the current set of primitives are examined, and a new primitive, collect, is proposed.
Paul Butcher, Alan C. Wood, Martin Atkins   +2 more
openaire   +1 more source

Barrier synchronisation optimisation

1997
This paper describes a new compiler algorithm to reduce the number of barrier synchronisations in parallelised programs. A preliminary technique to rapidly determine critical data dependences is developed. This forms the basis of the Fast First Sink (FFS) algorithm which places, provably, the minimal number of barriers in polynomial time for codes with
Elena Stöhr, Michael F. P. O'Boyle
openaire   +1 more source

Synchronisation Techniques for HIPERLAN

Wireless Personal Communications, 1997
Timing recovery in the High Performance Radio Local Area Network (HIPERLAN) standard is likely to be performed with the aid of synchronisation sequences embedded in the user data, which will be detected with matched filters. A directed search using a form of genetic algorithm has been performed to obtain suitable sequences of lengths up to 80 bits, and
David A. G. Gillies, Y. Jay Guo, Stephen K. Barton   +2 more
openaire   +1 more source

Complexity issues in synchronisation

Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228), 2002
In this paper, we look at synchronization over a finite window of data from a computational complexity point of view. The setting is purely in discrete time. It is shown that for polynomial systems the computational complexity of a readily available global Newton algorithm adapted to identify the finite trajectory of the dynamical system's state over ...
openaire   +1 more source

Synchronised crop failure

Nature Ecology & Evolution, 2019
When local crop failures in different regions occur simultaneously, the result can be an amplification of global food production shocks. Better understanding of the role of production synchronicity in historic food system stability is an important step towards anticipating possible future losses.
openaire   +2 more sources