Sciweavers

1415 search results - page 9 / 283
» Can Parallel Algorithms Enhance Serial Implementation
Sort
View
INFORMATICALT
2006
77views more  INFORMATICALT 2006»
13 years 7 months ago
Parallel Numerical Algorithms for 3D Parabolic Problem with Nonlocal Boundary Condition
Three parallel algorithms for solving the 3D problem with nonlocal boundary condition are considered. The forward and backward Euler finite-difference schemes, and LOD scheme are t...
Raimondas Ciegis
CACM
2011
84views more  CACM 2011»
13 years 2 months ago
Using simple abstraction to reinvent computing for parallelism
ple abstraction encapsulating the desired interface between programmers and system builders. Using Simple ion to Reinvent Computing for Parallelism doi:10.1145/1866739.1866757 abst...
Uzi Vishkin
VTS
2003
IEEE
95views Hardware» more  VTS 2003»
14 years 26 days ago
Built-In Reseeding for Serial Bist
Reseeding is used to improve fault coverage in pseudo-random testing. Most of the work done on reseeding is based on storing the seeds in an external tester. Besides its high cost...
Ahmad A. Al-Yamani, Edward J. McCluskey
PADS
2003
ACM
14 years 26 days ago
An Implementation of the SSF Scalable Simulation Framework on the Cray MTA
Large-scale parallel discrete event simulations of massive networks, such as the Internet, are “Grand Challenge” problems: packet level simulation of even a small fraction of ...
Robert R. Henry, Simon Kahan, Jason Liu, David M. ...
IPPS
2002
IEEE
14 years 16 days ago
Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...
Minsoo Jeon, Dongseung Kim