Sciweavers

968 search results - page 72 / 194
» A faster implementation of APlace
Sort
View
154
Voted
DATE
2005
IEEE
154views Hardware» more  DATE 2005»
15 years 9 months ago
A Time Slice Based Scheduler Model for System Level Design
Efficient evaluation of design choices, in terms of selection of algorithms to be implemented as hardware or software, and finding an optimal hw/sw design mix is an important re...
Luciano Lavagno, Claudio Passerone, Vishal Shah, Y...
NCA
2005
IEEE
15 years 9 months ago
Slingshot: Time-Critical Multicast for Clustered Applications
Datacenters are complex environments consisting of thousands of failure-prone commodity components connected by fast, high-capacity interconnects. The software running on such dat...
Mahesh Balakrishnan, Stefan Pleisch, Ken Birman
GRID
2004
Springer
15 years 9 months ago
Performance Comparison of Security Mechanisms for Grid Services
Security is one of the most important features for Grid services. There are several specifications used to add security to Grid services, and some of them have been implemented a...
Satoshi Shirasuna, Aleksander Slominski, Liang Fan...
LCTRTS
2004
Springer
15 years 9 months ago
Flattening statecharts without explosions
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
Andrzej Wasowski
SPIN
2004
Springer
15 years 9 months ago
Minimization of Counterexamples in SPIN
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster th...
Paul Gastin, Pierre Moro, Marc Zeitoun