Filters








17,071 Hits in 6.8 sec

Algorithms for signal and message asynchronous communication mechanisms and their analysis

Fei Xia, I. Clark
Proceedings Second International Conference on Application of Concurrency to System Design  
This paper presents new algorithms for the Signal and Message asynchronous data communication mechanisms (ACMs) and their modelling and analysis using Petri net techniques.  ...  Shang and A. Bystrov for enlightening discussions.  ...  Acknowledgements This work was supported by the EPSRC through grants GR/L93775 at Newcastle University and GR/L92471 at King's College London (Project COMFORT). The authors wish also to thank A.  ... 
doi:10.1109/csd.2001.981765 dblp:conf/acsd/XiaC01 fatcat:gn3rzc5ekjaodio2v7vgswio2m

Security-aware mapping for TDMA-based real-time distributed systems

Chung-Wei Lin, Qi Zhu, Alberto Sangiovanni-Vincentelli
2014 2014 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)  
To protect against attacks on TDMA-based real-time distributed systems, we apply a message authentication mechanism with time-delayed release of keys, which provides a good balance between security and  ...  The TDMA-based protocol we consider is an abstraction of many time-triggered protocols that are being adopted in various safety-critical systems for their more predictable timing behavior, such as FlexRay  ...  signals are mapped to an asynchronous message.  ... 
doi:10.1109/iccad.2014.7001325 dblp:conf/iccad/LinZS14 fatcat:u2zyw3kd6ve6hjp5wgp4ecvexi

Obtaining consistent global state dumps to interactively debug systems on chip with multiple clocks

Bart Vermeulen, Kees Goossens
2010 2010 IEEE International High Level Design Validation and Test Workshop (HLDVT)  
We reuse the same functionality that is used to ensure correct functional communication between asynchronous IP blocks, namely the handshake signals common in on-chip communication protocols.  ...  Post-silicon debugging of a system on chip (SOC) is complex due to (1) the intrinsic limits on the internal observability, (2) the absence of a single global clock, and (3) the need for asynchronous intellectual  ...  mechanism to reliably communicate data between any two, asynchronous IP blocks.  ... 
doi:10.1109/hldvt.2010.5496668 dblp:conf/hldvt/VermeulenG10 fatcat:hkaj67cg2be4fo36vota2gy7pm

Predicting Cluster Formation in Decentralized Sensor Grids [chapter]

Astrid Zeman, Mikhail Prokopenko
2006 Lecture Notes in Computer Science  
The predictor is based on the assumption that decentralized cluster formation creates multiagent chaotic dynamics in the communication space, and estimates irregularity of the communication-volume time  ...  In terms of predictive power, the auto-correlation function is observed to outperform and be less sensitive to noise in the communication space than the correlation entropy.  ...  The authors are grateful to Piraveenan Mahendra and Peter Wang for helpful discussions and valuable contributions to earlier versions of the algorithm.  ... 
doi:10.1007/11893011_42 fatcat:j27dnam3trftdonpzvyxstjqmi

Dynamic Load Balancing Based on Applications Global States Monitoring

Eryk Laskowski, Marek Tudruj, Richard Olejnik, Damian Kopanski
2013 2013 IEEE 12th International Symposium on Parallel and Distributed Computing  
The framework provides highlevel distributed control primitives at process level and a special control infrastructure for global asynchronous execution control at thread level.  ...  Both kinds of control assume observations of current multicore processor performance and communication throughput enabled in the executive distributed system.  ...  The tasks send load reports to synchronizers and modify their behavior in response to signals received asynchronously from the synchronizers. V.  ... 
doi:10.1109/ispdc.2013.11 dblp:conf/ispdc/LaskowskiTOK13 fatcat:ievg6t3fgvdiznbyifcymljei4

A real-time agent model in an asynchronous-object environment [chapter]

Z. Guessoum, M. Dojat
1996 Lecture Notes in Computer Science  
Our agents communicate by message-passing and are implemented in an asynchronous-object environment.  ...  Each agent uses a production system and is provided with a synchronization mechanism to avoid the possible inconsistencies of the asynchronous execution of several rule-bases.  ...  Their activity consists in transmitting the message, waiting for the result and then forwarding it to the sender.  ... 
doi:10.1007/bfb0031856 fatcat:n75q7bjbuzarzpmsakc2mmkhte

Distributed Delay and Sum Beamformer for Speech Enhancement via Randomized Gossip

Yuan Zeng, Richard C. Hendriks
2014 IEEE/ACM Transactions on Audio Speech and Language Processing  
For convergence analysis, we first provide bounds for the worst case averaging time of the ADDSB for the best and worst connected networks, and then we compare the convergence rate of the ADDSB with the  ...  than the original synchronous communication scheme, in particular for non-regular networks.  ...  Improved Synchronous Communication In the asynchronous communication scheme, only one pair of neighboring nodes and performs an update per iteration, while the other nodes keep their estimates.  ... 
doi:10.1109/taslp.2013.2290861 fatcat:nohd62sijnetvn2gfm6d53rrr4

Constraint Based Coordination of Autonomous Agents

Sascha Ossowski
2001 Electronical Notes in Theoretical Computer Science  
Finally, it is shown how this algorithm can be integrated into an operational coordination mechanism for a real-world domain.  ...  A distributed asynchronous algorithm is presented that computes potential outcomes of coordination in these scenarios.  ...  The Algorithm In decentralised MAS, coordination should rely on a decentralised mechanism. So, we are interested in an asynchronous, distributed algorithm for computing solutions to the above COP.  ... 
doi:10.1016/s1571-0661(04)00158-6 fatcat:i3tmi3t63vfnrbov6r433as6u4

A HIERARCHICAL MODEL FOR DISTRIBUTED COLLABORATIVE COMPUTATION IN WIRELESS SENSOR NETWORKS

Mitali Singh, Viktor K. Prasanna
2004 International Journal of Foundations of Computer Science  
To illustrate algorithm design using our model, we discuss implementation of algorithms for sorting and summing in sensor networks. ¤ ¦ ¥ § and © ¥ .  ...  All sensors in a cluster are time synchronized, whereas the clusterheads communicate asynchronously.  ...  The sensors in a cluster are time synchronized with their clusterhead. The communication between clusterheads is asynchronous using message passing. 6.  ... 
doi:10.1142/s012905410400256x fatcat:kj22hnsplba7nkgsj3hlfw3lj4

Asynchronous resource discovery in peer-to-peer networks

Shay Kutten, David Peleg
2007 Computer Networks  
A vertex (peer) can communicate with another vertex directly if and only if it knows a certain routing information to that other vertex.  ...  The current paper extends the deterministic algorithm of [15] to the environment of asynchronous networks, maintaining similar complexities (translated to the asynchronous model).  ...  This algorithm has time complexity O(log n), message complexity O(n log n) and communication complexity O(|E 0 | log 2 n). However, the algorithm does not function correctly on asynchronous networks.  ... 
doi:10.1016/j.comnet.2006.02.005 fatcat:7ci3hiix6nazfa63vzk32bkz4e

Implementing hierarchical scheduling on COTS Ethernet switches using a master/slave approach

Zahid Iqbal, Luis Almeida, Ricardo Marau, Moris Behnam, Thomas Nolte
2012 7th IEEE International Symposium on Industrial Embedded Systems (SIES'12)  
We use the FTT-SE protocol for being open source and a bandwidth efficient master/slave alternative currently available for real-time communication over Ethernet.  ...  We present a response-time analysis for the traffic submitted within each partition and we validate it using experimental results obtained from a prototype implementation.  ...  Finally, to compute the end-to-end delay of the messages, two extra ECs should be added to the response time of messages to consider the delay caused by the asynchronous traffic signaling mechanism.  ... 
doi:10.1109/sies.2012.6356572 dblp:conf/sies/IqbalAMBN12 fatcat:ratvtrczn5ganlfd4hi5qfbnhi

Distributed consensus with mixed time/communication bandwidth performance metrics

Federico Rossi, Marco Pavone
2014 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)  
In this paper we study the inherent trade-off between time and communication complexity for the distributed consensus problem.  ...  We prove a lower bound on the bandwidth complexity of the consensus problem and provide a matching consensus algorithm that is bandwidth-optimal for a wide class of consensus functions.  ...  In an asynchronous execution, all nodes can transmit their first message simultaneously.  ... 
doi:10.1109/allerton.2014.7028468 dblp:conf/allerton/RossiP14 fatcat:jthnkrewsrezvl2e3epas5fr6y

PARMI: A Publish/Subscribe Based Asynchronous RMI Framework for Cluster Computing [chapter]

Heejin Son, Xiaolin Li
2007 Lecture Notes in Computer Science  
Based on publish/subscribe paradigm, PARMI realizes asynchronous communication and computation by decoupling objects in space and time.  ...  The design of PARMI is motivated by the needs of scientific applications that adopt asynchronous iterative algorithms.  ...  Fig. 7 (b) shows, the iteration numbers for asynchronous version has irregular because of asynchronous algorithm.  ... 
doi:10.1007/978-3-540-75444-2_8 fatcat:2vv54h5zanbmnemv3kzle3uu34

On-chip interconnects and instruction steering schemes for clustered microarchitectures

J.-M. Parcerisa, J. Sahuquillo, A. Gonzalez, J. Duato
2005 IEEE Transactions on Parallel and Distributed Systems  
In particular, in a clustered microarchitecture, a low intercluster communication latency is essential for high performance.  ...  Clustering is an effective microarchitectural technique for reducing the impact of wire delays, the complexity, and the power requirements of microprocessors.  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous referees for their valuable comments.  ... 
doi:10.1109/tpds.2005.23 fatcat:d653755qevf45gtiibunn3rwxi

Distributed Broadcast with Minimum Latency in Asynchronous Wireless Sensor Networks under SINR-Based Interference

Shiliang Xiao, Lebing Pan, Jianpo Liu, Baoqing Li, Xiaobing Yuan
2013 International Journal of Distributed Sensor Networks  
We then conduct extensive simulations to evaluate the practical capability of DAB in asynchronous WSNs and the results corroborate our theoretical analysis.  ...  Existing works all assume strict time synchronization and provide centralized TDMA scheduling algorithms. However, WSNs in practice are more likely to be distributed asynchronous systems.  ...  In recent years, physical algorithm, that is, algorithm for the physical interference model, has attracted a lot of attention both in the algorithm community and in the communication community.  ... 
doi:10.1155/2013/506797 fatcat:lfwfubzodnb6rfy2bdgfc2irmu
« Previous Showing results 1 — 15 out of 17,071 results