Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
291
search results - page 59 / 59
»
A Parallel BSP Algorithm for Irregular Dynamic Programming
Sort
relevance
views
votes
recent
update
View
thumb
title
147
Voted
CF
2005
ACM
166
views
Applied Computing
»
more
CF 2005
»
A case for a working-set-based memory hierarchy
15 years 5 months ago
Download
www.cs.mtu.edu
Modern microprocessor designs continue to obtain impressive performance gains through increasing clock rates and advances in the parallelism obtained via micro-architecture design...
Steve Carr, Soner Önder
claim paper
Read More »
« Prev
« First
page 59 / 59
Last »
Next »