Sciweavers

352 search results - page 17 / 71
» On implementation choices for iterative improvement partitio...
Sort
View
ICASSP
2008
IEEE
14 years 4 months ago
A fast approximate joint diagonalization algorithm using a criterion with a block diagonal weight matrix
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...
Petr Tichavský, Arie Yeredor, Jan Nielsen
IEEEARES
2009
IEEE
14 years 5 months ago
Perfect Failure Detection in the Partitioned Synchronous Distributed System Model
—In this paper we show that it is possible to implement a perfect failure detector P (one that detects all faulty processes if and only if those processes failed) in a non-synchr...
Raimundo José de Araújo Macêdo...
GLVLSI
2006
IEEE
126views VLSI» more  GLVLSI 2006»
14 years 4 months ago
Hardware/software partitioning of operating systems: a behavioral synthesis approach
In this paper we propose a hardware real time operating system (HW-RTOS) solution that makes use of a dedicated hardware in order to replace the standard support provided by the P...
Sathish Chandra, Francesco Regazzoni, Marcello Laj...
ESTIMEDIA
2006
Springer
14 years 1 months ago
Loop Nest Splitting for WCET-Optimization and Predictability Improvement
This paper presents the influence of the loop nest splitting source code optimization on the worst-case execution time (WCET). Loop nest splitting minimizes the number of executed...
Heiko Falk, Martin Schwarzer
SIAMSC
2010
132views more  SIAMSC 2010»
13 years 5 months ago
Some Improvements for the Fast Sweeping Method
In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapi...
Stanley Bak, Joyce R. McLaughlin, Daniel Renzi