Sciweavers

2703 search results - page 112 / 541
» Optimizing memory transactions
Sort
View
CSREAESA
2006
13 years 10 months ago
Static Program Partitioning for Embedded Processors
Modern processors have a small on-chip local memory for instructions. Usually it is in the form of a cache but in some cases it is an addressable memory. In the latter, the user is...
Bageshri Sathe, Uday P. Khedker
JSS
2006
99views more  JSS 2006»
13 years 8 months ago
A tunable hybrid memory allocator
Dynamic memory management can make up to 60% of total program execution time. Object oriented languages such as C++ can use 20 times more memory than procedural languages like C. ...
Yusuf Hasan, J. Morris Chang
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 8 months ago
An Optimal Dynamic Mechanism for Multi-Armed Bandit Processes
We consider the problem of revenue-optimal dynamic mechanism design in settings where agents' types evolve over time as a function of their (both public and private) experien...
Sham M. Kakade, Ilan Lobel, Hamid Nazerzadeh
CL
2000
Springer
14 years 14 days ago
FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine
This paper reports on the design and implementation of FLORA -- a powerful DOOD system that incorporates the features of F-logic, HiLog, and Transaction Logic. FLORA is implemented...
Guizhen Yang, Michael Kifer
MICRO
2008
IEEE
137views Hardware» more  MICRO 2008»
13 years 8 months ago
Verification of chip multiprocessor memory systems using a relaxed scoreboard
Verification of chip multiprocessor memory systems remains challenging. While formal methods have been used to validate protocols, simulation is still the dominant method used to ...
Ofer Shacham, Megan Wachs, Alex Solomatnikov, Amin...