Sciweavers

336 search results - page 61 / 68
» Improved data structures for fully dynamic biconnectivity
Sort
View
STACS
1992
Springer
15 years 3 months ago
A Simplified Technique for Hidden-Line Elimination in Terrains
In this paper we give a practical and e cient output-sensitive algorithm for constructing the display of a polyhedral terrain. It runs in Od + nlog2 n time and uses On n space, wh...
Franco P. Preparata, Jeffrey Scott Vitter
ICPP
2009
IEEE
15 years 6 months ago
Code Semantic-Aware Runahead Threads
Memory-intensive threads can hoard shared resources without making progress on a multithreading processor (SMT), thereby hindering the overall system performance. A recent promisi...
Tanausú Ramírez, Alex Pajuelo, Olive...
ISPW
1996
IEEE
15 years 3 months ago
Feedback, evolution and software technology
A 1968 study of the software process led, inter alia, to the observation that the software process constitutes a feedback system. Attempts at its management and improvement must t...
M. M. Lehman
CODES
2005
IEEE
15 years 5 months ago
SOMA: a tool for synthesizing and optimizing memory accesses in ASICs
Arbitrary memory dependencies and variable latency memory systems are major obstacles to the synthesis of large-scale ASIC systems in high-level synthesis. This paper presents SOM...
Girish Venkataramani, Tiberiu Chelcea, Seth Copen ...
ISCA
2010
IEEE
205views Hardware» more  ISCA 2010»
15 years 4 months ago
The virtual write queue: coordinating DRAM and last-level cache policies
In computer architecture, caches have primarily been viewed as a means to hide memory latency from the CPU. Cache policies have focused on anticipating the CPU’s data needs, and...
Jeffrey Stuecheli, Dimitris Kaseridis, David Daly,...