Sciweavers

555 search results - page 26 / 111
» Efficiently Implementing Episodic Memory
Sort
View
ICDCS
1996
IEEE
14 years 2 months ago
Larchant: Persistence by Reachability in Distributed Shared Memory Through Garbage Collection
We consider a shared store based on distributed shared memory (DSM), supporting persistence by reachability (PBR), a very simple data sharing model for a distributed system. This ...
Paulo Ferreira, Marc Shapiro
ISSRE
2010
IEEE
13 years 7 months ago
Preventing Overflow Attacks by Memory Randomization
Buffer overflow is known to be a common memory vulnerability affecting software. It is exploited to gain various kinds of privilege escalation. C and C++ are very commonly used to ...
Vivek Iyer, Amit Kanitkar, Partha Dasgupta, Raghun...
ECOOP
1987
Springer
14 years 1 months ago
Dynamic Grouping in an Object-Oriented Virtual Memory Hierarchy
Object oriented programming environments frequently suffer serious performance degradation because of a high level of paging activity when implemented using a conventional virtual...
Ifor Williams, Mario Wolczko, Trevor Hopkins
IJON
2006
109views more  IJON 2006»
13 years 9 months ago
Associative memory of connectivity patterns
The goal of the visual correspondence problem is to establish a connectivity pattern (a mapping) between two images such that features projected from the same scene point are conn...
Junmei Zhu, Christoph von der Malsburg
ICPP
2009
IEEE
13 years 7 months ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...