Sciweavers

483 search results - page 22 / 97
» Timing Games and Shared Memory
Sort
View
ATAL
2010
Springer
13 years 11 months ago
Planning against fictitious players in repeated normal form games
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
Enrique Munoz de Cote, Nicholas R. Jennings
SIGMETRICS
2000
ACM
111views Hardware» more  SIGMETRICS 2000»
13 years 9 months ago
AMVA techniques for high service time variability
Motivated by experience gained during the validation of a recent Approximate Mean Value Analysis (AMVA) model of modern shared memory architectures, this paper re-examines the &qu...
Derek L. Eager, Daniel J. Sorin, Mary K. Vernon
HPDC
2007
IEEE
14 years 4 months ago
Feedback-directed thread scheduling with memory considerations
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...
Fengguang Song, Shirley Moore, Jack Dongarra
WCET
2007
13 years 11 months ago
Finding DU-Paths for Testing of Multi-Tasking Real-Time Systems using WCET Analysis
Memory corruption is one of the most common software failures. For sequential software and multitasking software with synchronized data accesses, it has been shown that program fa...
Daniel Sundmark, Anders Pettersson, Christer Sandb...
TSMC
1998
97views more  TSMC 1998»
13 years 9 months ago
Parallel algorithms for modules of learning automata
— Parallel algorithms are presented for modules of learning automata with the objective of improving their speed of convergence without compromising accuracy. A general procedure...
M. A. L. Thathachar, M. T. Arvind