Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,885,978 papers from all fields of science
Search
Sign In
Create Free Account
Deterministic memory
With respect to computers, Deterministic Memory is computer memory which contains values that can be depended on from access to access. The term is…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Broader (1)
Computer memory
Embedded system
Memory architecture
Memory management
Real-time computing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The Deterministic Memory Abstraction and Supporting Cache Architecture for Multicore Real-Time Systems
F. Farshchi
,
P. K. Valsan
,
R. Mancuso
,
H. Yun
2017
Corpus ID: 86593409
Poor timing predictability of multicore processors has been a long-standing challenge in the real-time systems community. In this…
Expand
2014
2014
Deterministic memory sharing in Kahn process networks: Ultrasound imaging as a case study
Andreas Tretter
,
Harshavardhan Pandit
,
Pratyush Kumar
,
L. Thiele
IEEE Workshop on Embedded Systems for Real-Time…
2014
Corpus ID: 7628932
Kahn process networks are a popular programming model for programming multi-core systems. They ensure determinacy of applications…
Expand
2013
2013
Divide and Conquer Ray Tracing Algorithm Based on BVH Partition
Wu Zhefu
,
Yu Hong
,
Chen Bin
International Conference on Virtual Reality and…
2013
Corpus ID: 37085150
A new fast divide and conquer ray tracing algorithm based on BVH partition which can remove unnecessary rays in subspace is…
Expand
Highly Cited
2009
Highly Cited
2009
Dacota: Post-silicon validation of the memory subsystem in multi-core designs
Andrew DeOrio
,
I. Wagner
,
V. Bertacco
IEEE 15th International Symposium on High…
2009
Corpus ID: 7838277
The number of functional errors escaping design verification and being released into final silicon is growing, due to the…
Expand
2008
2008
Dynamic Memory Access Management for High-Performance DSP Applications Using High-Level Synthesis
B. Gal
,
E. Casseau
,
Sylvain Huet
IEEE Transactions on Very Large Scale Integration…
2008
Corpus ID: 2122118
Multimedia applications such as video and image processing are often characterized by a huge number of data accesses. In many…
Expand
2008
2008
Quantifying distortion of RF power amplifiers for estimation of predistorter performance
P. Draxler
,
Anding Zhu
,
Jonmei J. Yan
,
P. Kolinko
,
D. Kimball
,
P. Asbeck
IEEE MTT-S International Microwave Symposium…
2008
Corpus ID: 33744667
This paper demonstrates a method to quantify the accuracy of memory models and the effectiveness of digital predistortion of…
Expand
2007
2007
Configurable Hybridkernel for Embedded Real-Time Systems
Timo Kerstan
,
Simon Oberthür
International Conference on Exploring Services…
2007
Corpus ID: 14353689
When designing a kernel for an operating system the developer has to choose between an microkernel or monolithic kernel approach…
Expand
2007
2007
Scalable Router Memory Architecture Based on Inter-leaved DRAM: Analysis and Numerical Studies
Feng Wang
,
M. Hamdi
IEEE International Conference on Communications
2007
Corpus ID: 12591178
Routers need buffers to store and forward packets, especially when there is network congestion. With current memory technology…
Expand
1999
1999
A Java Framework for Spatial Embedded Systems
Ludovic Apvrille
,
P. Sénac
,
M. Diaz
1999
Corpus ID: 30468983
Satellite constellations will soon play a fundamental role in global broadband and heterogeneous communication architectures…
Expand
1999
1999
Real-time TSpaces
G. Bollella
,
S. Graham
,
T. J. Lehman
IECON'99. Conference Proceedings. 25th Annual…
1999
Corpus ID: 60668079
TSpaces is a global communication middleware component that incorporates database features, such as transactions, persistent…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE