Sciweavers

118 search results - page 19 / 24
» Graph based communication analysis for hardware software cod...
Sort
View
RANDOM
1998
Springer
13 years 11 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
TCAD
2002
146views more  TCAD 2002»
13 years 7 months ago
Static scheduling of multidomain circuits for fast functional verification
With the advent of system-on-a-chip design, many application specific integrated circuits (ASICs) now require multiple design clocks that operate asynchronously to each other. This...
Murali Kudlugi, Russell Tessier
EMSOFT
2006
Springer
13 years 11 months ago
Modeling a system controller for timing analysis
Upper bounds on worst-case execution times, which are commonly called WCET, are a prerequisite for validating the temporal correctness of tasks in a real-time system. Due to the e...
Stephan Thesing
INFOCOM
2009
IEEE
14 years 1 months ago
Wi-Sh: A Simple, Robust Credit Based Wi-Fi Community Network
— Wireless community networks, where users share wireless bandwidth is attracting tremendous interest from academia and industry. Companies such as FON have been successful in at...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
ECMDAFA
2005
Springer
130views Hardware» more  ECMDAFA 2005»
14 years 25 days ago
Control Flow Analysis of UML 2.0 Sequence Diagrams
This article presents a control flow analysis methodology based on UML 2.0 sequence diagrams (SD). In contrast to the conventional code-based control flow analysis techniques, thi...
Vahid Garousi, Lionel C. Briand, Yvan Labiche