Sciweavers

1406 search results - page 2 / 282
» Information Flow in Systems with Schedulers
Sort
View
EUROMICRO
1998
IEEE
13 years 9 months ago
Process Scheduling for Performance Estimation and Synthesis of Hardware/Software Systems
The paper presents an approach to process scheduling for embedded systems. Target architectures consist of several processors and ASICs connected by shared busses. We have develop...
Petru Eles, Krzysztof Kuchcinski, Zebo Peng, Alexa...
HIPC
2004
Springer
13 years 10 months ago
A-FAST: Autonomous Flow Approach to Scheduling Tasks
Abstract. This paper investigates the problem of autonomously allocating a large number of independent, equal sized tasks on a distributed heterogeneous grid-like platform, using o...
Sagnik Nandy, Larry Carter, Jeanne Ferrante
CCS
2008
ACM
13 years 6 months ago
Avoiding timing channels in fixed-priority schedulers
A practically feasible modification to fixed-priority schedulers allows to avoid timing channels despite threads having access to precise clocks. This modification is rather simpl...
Marcus Völp, Claude-Joachim Hamann, Hermann H...
ASPDAC
2005
ACM
98views Hardware» more  ASPDAC 2005»
13 years 10 months ago
Bitwidth-aware scheduling and binding in high-level synthesis
- Many high-level description languages, such as C/C++ or Java, lack the capability to specify the bitwidth information for variables and operations. Synthesis from these specifica...
Jason Cong, Yiping Fan, Guoling Han, Yizhou Lin, J...
QEST
2010
IEEE
13 years 2 months ago
Information Hiding in Probabilistic Concurrent Systems
Information hiding is a general concept which refers to the goal of preventing an adversary to infer secret information from the observables. Anonymity and Information Flow are exa...
Miguel E. Andrés, Catuscia Palamidessi, Pet...