Sciweavers

7456 search results - page 1475 / 1492
» Parallelism in Logic Programming
Sort
View
IWMM
2009
Springer
152views Hardware» more  IWMM 2009»
14 years 2 months ago
A new approach to parallelising tracing algorithms
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
Cosmin E. Oancea, Alan Mycroft, Stephen M. Watt
IWMM
2009
Springer
127views Hardware» more  IWMM 2009»
14 years 2 months ago
Investigating the effects of using different nursery sizing policies on performance
In this paper, we investigate the effects of using three different nursery sizing policies on overall and garbage collection performances. As part of our investigation, we modify ...
Xiaohua Guan, Witawas Srisa-an, ChengHuan Jia
CF
2009
ACM
14 years 2 months ago
Mapping the LU decomposition on a many-core architecture: challenges and solutions
Recently, multi-core architectures with alternative memory subsystem designs have emerged. Instead of using hardwaremanaged cache hierarchies, they employ software-managed embedde...
Ioannis E. Venetis, Guang R. Gao
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 2 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
CDC
2008
IEEE
132views Control Systems» more  CDC 2008»
14 years 2 months ago
A distributed auction algorithm for the assignment problem
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
Michael M. Zavlanos, Leonid Spesivtsev, George J. ...
« Prev « First page 1475 / 1492 Last » Next »