Sciweavers

6808 search results - page 457 / 1362
» Distributed Concurrency Control
Sort
View
AIPS
1994
15 years 8 months ago
A Framework for Automatic Problem Decomposition in Planning
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
Qiang Yang, Shuo Bai, Guiyou Qiu
STTT
2008
89views more  STTT 2008»
15 years 6 months ago
Modelling defence logistics networks
Military logistics concerns the activities required to support operational forces. It encompasses the storage and distribution of materiel, management of personnel and the provisio...
Guy Edward Gallasch, Nimrod Lilith, Jonathan Billi...
IPPS
2010
IEEE
15 years 4 months ago
Evaluating database-oriented replication schemes in Software Transactional Memory systems
Software Transactional Memories (STMs) are emerging as a highly attractive programming model, thanks to their ability to mask concurrency management issues to the overlying applic...
Roberto Palmieri, Francesco Quaglia, Paolo Romano,...
IPPS
2010
IEEE
15 years 4 months ago
Restructuring parallel loops to curb false sharing on multicore architectures
The memory hierarchy of most multicore systems contains one or more levels of cache that is shared among multiple cores. The shared-cache architecture presents many opportunities f...
Santosh Sarangkar, Apan Qasem
ICPP
2009
IEEE
15 years 4 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...