Sciweavers

1415 search results - page 52 / 283
» Can Parallel Algorithms Enhance Serial Implementation
Sort
View
PARELEC
2002
IEEE
15 years 7 months ago
Dynamic Process Partitioning and Migration for Irregular Applications
Many practical applications generate irregular, nonbalanced divide-and-conquer trees which have different depths, possibly also different numbers of successors at different levels...
Pawel Czarnul
114
Voted
JSS
2007
79views more  JSS 2007»
15 years 2 months ago
Security problems with improper implementations of improved FEA-M
This paper reports security problems with improper implementations of an improved version of FEA-M (fast encryption algorithm for multimedia). It is found that an implementation-d...
Shujun Li, Kwok-Tung Lo
JSSPP
2005
Springer
15 years 7 months ago
Enhancing Security of Real-Time Applications on Grids Through Dynamic Scheduling
Real-time applications with security requirements are emerging in various areas including government, education, and business. The security sensitive real-time applications can ta...
Tao Xie 0004, Xiao Qin
162
Voted
IPPS
2007
IEEE
15 years 8 months ago
Software and Algorithms for Graph Queries on Multithreaded Architectures
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
Jonathan W. Berry, Bruce Hendrickson, Simon Kahan,...
115
Voted
PDPTA
1996
15 years 3 months ago
Hyper-Systolic Matrix Multiplication
A novel parallel algorithm for matrix multiplication is presented. It is based on a 1-D hyper-systolic processor abstraction. The procedure can be implemented on all types of para...
Thomas Lippert, Klaus Schilling