Sciweavers

487 search results - page 38 / 98
» Schedulability analysis of AADL models
Sort
View
CLUSTER
2004
IEEE
14 years 1 months ago
A comparison of local and gang scheduling on a Beowulf cluster
Gang Scheduling and related techniques are widely believed to be necessary for efficientjob scheduling on distributed memory parallel computers. This is hecause they minimize cont...
Peter E. Strazdins, John Uhlmann
FORMATS
2003
Springer
14 years 3 months ago
Analysis of Real Time Operating System Based Applications
This text is dedicated to modelling of real-time applications running under multitasking operating system. Theoretical background is based on timed automata by Alur and Dill. As th...
Libor Waszniowski, Zdenek Hanzálek
RTCSA
2007
IEEE
14 years 4 months ago
Modeling Real-time Garbage Collection Cost
Given the major advantages of productivity and safety, the use of garbage collection (GC) in real-time systems has gained increasing attention. Guaranteeing garbage collection act...
Wei Fu, Carl Hauser
ICCD
2005
IEEE
108views Hardware» more  ICCD 2005»
14 years 6 months ago
Methods for Modeling Resource Contention on Simultaneous Multithreading Processors
Simultaneous multithreading (SMT) seeks to improve the computation throughput of a processor core by sharing primary resources such as functional units, issue bandwidth, and cache...
Tipp Moseley, Dirk Grunwald, Joshua L. Kihm, Danie...
IPCO
1998
152views Optimization» more  IPCO 1998»
13 years 11 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz