Sciweavers

3202 search results - page 447 / 641
» Memory access scheduling
Sort
View
ICS
2005
Tsinghua U.
14 years 1 months ago
Improving the computational intensity of unstructured mesh applications
Although unstructured mesh algorithms are a popular means of solving problems across a broad range of disciplines—from texture mapping to computational fluid dynamics—they ar...
Brian S. White, Sally A. McKee, Bronis R. de Supin...
EUROPAR
2004
Springer
14 years 1 months ago
A Data Management and Communication Layer for Adaptive, Hexahedral FEM
The parallel realization of adaptive finite element methods (FEM) has to deal with several irregular and dynamic algorithmic properties caused by adaptive mesh refinement (AMR). ...
Judith Hippold, Gudula Rünger
ACSD
2003
IEEE
103views Hardware» more  ACSD 2003»
14 years 1 months ago
Design Validation of ZCSP with SPIN
— We consider the problem of specifying a model of the Zero Copy Secured Protocol for the purpose of LTL verification with the SPIN Model Checker. ZCSP is based on Direct Memory...
Vincent Beaudenon, Emmanuelle Encrenaz, Jean Lou D...
DATE
2003
IEEE
97views Hardware» more  DATE 2003»
14 years 1 months ago
Enhancing Speedup in Network Processing Applications by Exploiting Instruction Reuse with Flow Aggregation
Instruction reuse is a microarchitectural technique that improves the execution time of a program by removing redundant computations at run-time. Although this is the job of an op...
G. Surendra, Subhasis Banerjee, S. K. Nandy
FTDCS
2003
IEEE
14 years 1 months ago
Distributed Shared State
Increasingly, Internet-level distributed systems are oriented as much toward information access as they are toward computation. From computer-supported collaborative work to peer-...
Michael L. Scott, DeQing Chen, Sandhya Dwarkadas, ...