Sciweavers

506 search results - page 16 / 102
» Distributing synchronous programs using bounded queues
Sort
View
SOCA
2010
IEEE
13 years 6 months ago
Weighted fair share scheduling for loosely controlled concurrent event systems
In asynchronous event systems, the production of an event is decoupled from its consumption via an event queue. The loose coupling of such systems allows great flexibility as to ...
Sean Rooney, Luis Garcés-Erice, Kristijan D...
CASES
2009
ACM
14 years 2 months ago
Tight WCRT analysis of synchronous C programs
Accurate estimation of the tick length of a synchronous program is essential for efficient and predictable implementations that are devoid of timing faults. The techniques to dete...
Partha S. Roop, Sidharta Andalam, Reinhard von Han...
MICRO
2010
IEEE
156views Hardware» more  MICRO 2010»
13 years 6 months ago
Explicit Communication and Synchronization in SARC
SARC merges cache controller and network interface functions by relying on a single hardware primitive: each access checks the tag and the state of the addressed line for possible...
Manolis Katevenis, Vassilis Papaefstathiou, Stamat...
IANDC
2007
84views more  IANDC 2007»
13 years 7 months ago
The perfectly synchronized round-based model of distributed computing
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
IPPS
2006
IEEE
14 years 1 months ago
Modelling job allocation where service duration is unknown
In this paper a novel job allocation scheme in distributed systems (TAG) is modelled using the Markovian process algebra PEPA. This scheme requires no prior knowledge of job size ...
Nigel Thomas