Sciweavers

6480 search results - page 306 / 1296
» Proximity Communication and Time
Sort
View
IEEEPACT
2005
IEEE
16 years 11 days ago
HUNTing the Overlap
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
Costin Iancu, Parry Husbands, Paul Hargrove
INFORMATICALT
2006
154views more  INFORMATICALT 2006»
15 years 6 months ago
Efficient Adaptive Algorithms for Transposing Small and Large Matrices on Symmetric Multiprocessors
Matrix transpose in parallel systems typically involves costly all-to-all communications. In this paper, we provide a comparative characterization of various efficient algorithms f...
Rami Al Na'mneh, W. David Pan, Seong-Moo Yoo
CCS
2007
ACM
16 years 29 days ago
Detecting covert timing channels: an entropy-based approach
The detection of covert timing channels is of increasing interest in light of recent practice on the exploitation of covert timing channels over the Internet. However, due to the ...
Steven Gianvecchio, Haining Wang
FATES
2004
Springer
16 years 5 days ago
Testing Deadlock-Freeness in Real-Time Systems: A Formal Approach
A Time Action Lock is a state of a Real-time system at which neither time can progress nor an action can occur. Time Action Locks are often seen as signs of errors in the model or ...
Behzad Bordbar, Kozo Okano
CONCUR
1999
Springer
15 years 11 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea