Sciweavers

804 search results - page 29 / 161
» Algorithms for Programmers
Sort
View
IPPS
2000
IEEE
15 years 6 months ago
Augmenting Modern Superscalar Architectures with Configurable Extended Instructions
The instruction sets of general-purpose microprocessors are designed to offer good performance across a wide range of programs. The size and complexity of the instruction sets, how...
Xianfeng Zhou, Margaret Martonosi
IPPS
2006
IEEE
15 years 8 months ago
Parallel FPGA-based all-pairs shortest-paths in a directed graph
With rapid advances in VLSI technology, Field Programmable Gate Arrays (FPGAs) are receiving the attention of the Parallel and High Performance Computing community. In this paper,...
Uday Bondhugula, Ananth Devulapalli, Joseph Fernan...
PLDI
1998
ACM
15 years 6 months ago
A Study of Dead Data Members in C++ Applications
Object-oriented applications may contain data members that can be removed from the application without a ecting program behavior. Such \dead" data members may occur due to un...
Peter F. Sweeney, Frank Tip
110
Voted
DAC
1997
ACM
15 years 6 months ago
Data Memory Minimisation for Synchronous Data Flow Graphs Emulated on DSP-FPGA Targets
The paper presents an algorithm to determine the close-tosmallest possible data buffer sizes for arbitrary synchronous data flow (SDF) applications, such that we can guarantee the...
Marleen Adé, Rudy Lauwereins, J. A. Peperst...
WDAG
1995
Springer
100views Algorithms» more  WDAG 1995»
15 years 5 months ago
Universal Constructions for Large Objects
We present lock-free and wait-free universal constructions for implementing large shared objects. Most previous universal constructions require processes to copy the entire object...
James H. Anderson, Mark Moir