Sciweavers

822 search results - page 77 / 165
» Contention in shared memory algorithms
Sort
View
SASP
2009
IEEE
291views Hardware» more  SASP 2009»
14 years 3 months ago
A parameterisable and scalable Smith-Waterman algorithm implementation on CUDA-compatible GPUs
—This paper describes a multi-threaded parallel design and implementation of the Smith-Waterman (SM) algorithm on compute unified device architecture (CUDA)-compatible graphic pr...
Cheng Ling, Khaled Benkrid, Tsuyoshi Hamada
SPC
2005
Springer
14 years 2 months ago
TrustAC: Trust-Based Access Control for Pervasive Devices
Alice first meets Bob in an entertainment shop, then, they wish to share multimedia content, but Do they know what are trustworthy users? How do they share such information in a s...
Florina Almenárez Mendoza, Andrés Ma...
PLDI
2004
ACM
14 years 2 months ago
Cost effective dynamic program slicing
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
Xiangyu Zhang, Rajiv Gupta
WSCG
2001
97views more  WSCG 2001»
13 years 10 months ago
Parallel Ray Tracing with 5D Adaptive Subdivision
We present strategies for parallelising ray tracing based on 5D adaptive subdivision. Our goals are to obtain good speed-up and to efficiently balance the load between the process...
G. Simiakakis, Theoharis Theoharis, A. M. Day
IPPS
2009
IEEE
14 years 3 months ago
Input-independent, scalable and fast string matching on the Cray XMT
String searching is at the core of many security and network applications like search engines, intrusion detection systems, virus scanners and spam filters. The growing size of o...
Oreste Villa, Daniel G. Chavarría-Miranda, ...