Sciweavers

436 search results - page 59 / 88
» On the interconnection of message passing systems
Sort
View
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
13 years 8 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
ACSD
2008
IEEE
108views Hardware» more  ACSD 2008»
13 years 11 months ago
Modular construction of finite and complete prefixes of Petri net unfoldings
This paper considers distributed systems, defined as a collection of components interacting through interfaces. Components, interfaces and distributed systems are modeled as Petri...
Agnes Madalinski, Eric Fabre
RTSS
2009
IEEE
14 years 3 months ago
Timing Analysis of Concurrent Programs Running on Shared Cache Multi-Cores
—Memory accesses form an important source of timing unpredictability. Timing analysis of real-time embedded software thus requires bounding the time for memory accesses. Multipro...
Yan Li, Vivy Suhendra, Yun Liang, Tulika Mitra, Ab...
COORDINATION
2007
Springer
14 years 3 months ago
A Coordination Model for Triplespace Computing
Recent advances in middleware technologies propose semantics-aware tuplespaces as an instrument for coping with the requirements of scalability, heterogeneity and dynamism arising ...
Elena Paslaru Bontas Simperl, Reto Krummenacher, L...
ACOM
2006
Springer
14 years 3 months ago
Flexible Conversations Using Social Commitments and a Performatives Hierarchy
In this research, we re-arrange FIPA’s ACL performatives to form a subsumption lattice (ontology) and apply a theory of social commitments to achieve a simplified and observable...
Robert C. Kremer, Roberto A. Flores