Sciweavers

4081 search results - page 261 / 817
» Scheduling in polling systems
Sort
View
ACNS
2011
Springer
231views Cryptology» more  ACNS 2011»
14 years 10 months ago
Cold Boot Key Recovery by Solving Polynomial Systems with Noise
A method for extracting cryptographic key material from DRAM used in modern computers has been recently proposed in [9]; the technique was called Cold Boot attacks. When considerin...
Martin Albrecht, Carlos Cid
SSDBM
2005
IEEE
132views Database» more  SSDBM 2005»
16 years 6 days ago
Co-Scheduling of Computation and Data on Computer Clusters
Scientific investigations have to deal with rapidly growing amounts of data from simulations and experiments. During data analysis, scientists typically want to extract subsets o...
Alexandru Romosan, Doron Rotem, Arie Shoshani, Der...
DAC
2000
ACM
16 years 7 months ago
Interactive co-design of high throughput embedded multimedia
The idea of Force-Directed Scheduling (FDS) was first introduced by Paulin and Knight to minimize the number of resources required in the high-level synthesis of high-throughput A...
Thierry J.-F. Omnés, Thierry Franzetti, Fra...
RTAS
2008
IEEE
16 years 1 months ago
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...
Harini Ramaprasad, Frank Mueller
ASPLOS
2000
ACM
15 years 11 months ago
Symbiotic Jobscheduling for a Simultaneous Multithreading Processor
Simultaneous Multithreading machines fetch and execute instructions from multiple instruction streams to increase system utilization and speedup the execution of jobs. When there ...
Allan Snavely, Dean M. Tullsen