Sciweavers

3202 search results - page 123 / 641
» Memory access scheduling
Sort
View
KBSE
2007
IEEE
16 years 1 months ago
Effective memory protection using dynamic tainting
Programs written in languages that provide direct access to memory through pointers often contain memory-related faults, which may cause non-deterministic failures and even securi...
James A. Clause, Ioannis Doudalis, Alessandro Orso...
RTAS
2007
IEEE
16 years 1 months ago
Preemption Threshold Scheduling: Stack Optimality, Enhancements and Analysis
Using preemption threshold scheduling (PTS) in a multi-threaded real-time embedded system reduces system preemptions and hence reduces run-time overhead while still ensuring real-...
Rony Ghattas, Alexander G. Dean
CODES
2000
IEEE
15 years 11 months ago
Frequency interleaving as a codesign scheduling paradigm
Frequency interleaving is introduced as a means of conceptualizing and co-scheduling hardware and software behaviors so that software models with conceptually unbounded state and ...
JoAnn M. Paul, Simon N. Peffers, Donald E. Thomas
IPPS
2007
IEEE
16 years 1 months ago
10-Gigabit iWARP Ethernet: Comparative Performance Analysis with InfiniBand and Myrinet-10G
iWARP is a set of standards enabling Remote Direct Memory Access (RDMA) over Ethernet. iWARP supporting RDMA and OS bypass, coupled with TCP/IP Offload Engines, can fully eliminat...
Mohammad J. Rashti, Ahmad Afsahi
WEA
2005
Springer
138views Algorithms» more  WEA 2005»
16 years 8 days ago
A Practical Minimal Perfect Hashing Method
We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluatio...
Fabiano C. Botelho, Yoshiharu Kohayakawa, Nivio Zi...