Sciweavers

1931 search results - page 205 / 387
» Why we blog
Sort
View
CAL
2005
15 years 6 months ago
On Reusing the Results of Pre-Executed Instructions in a Runahead Execution Processor
Previous research on runahead execution took it for granted as a prefetch-only technique. Even though the results of instructions independent of an L2 miss are correctly computed d...
Onur Mutlu, Hyesoon Kim, Jared Stark, Yale N. Patt
CSUR
2000
61views more  CSUR 2000»
15 years 6 months ago
Framelets - small and loosely coupled frameworks
Not only the design of complex frameworks is hard, but also the reuse of such artefacts. Furthermore, the internal working of different frameworks is usually not compatible so that...
Wolfgang Pree, Kai Koskimies
ISCI
2002
92views more  ISCI 2002»
15 years 6 months ago
Software engineering technology watch
Predicting the evolution of software engineering technology is, at best, a dubious proposition; most typically, it is a frustrating exercise in disappointment and anxiety. It is n...
Robert David Cowan, Alan McKendall Jr., Ali Mili, ...
IJDSN
2008
81views more  IJDSN 2008»
15 years 6 months ago
A Flexible Stochastic Automaton-Based Algorithm for Network Self-Partitioning
This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a...
Yan Wan, Sandip Roy, Ali Saberi, Bernard C. Lesieu...
QUESTA
2007
88views more  QUESTA 2007»
15 years 6 months ago
A simple proof for the constructions of optical priority queues
Constructions of optical queues by optical Switches and fiber Delay Lines (SDL) have received a lot of attention lately. In this short paper, we provide a simple proof for the co...
Hsien-Chen Chiu, Cheng-Shang Chang, Jay Cheng, Dua...