Sciweavers

6434 search results - page 428 / 1287
» The Dynamic Data Cube
Sort
View
IEEEPACT
1999
IEEE
15 years 11 months ago
A Fully Asynchronous Superscalar Architecture
An asynchronous superscalar architecture is presented based on a novel architectural feature called instruction compounding. This enables efficient dynamic scheduling and forwardi...
D. K. Arvind, Robert D. Mullins
FCT
1995
Springer
15 years 10 months ago
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
Hristo Djidjev, Grammati E. Pantziou, Christos D. ...
PDPTA
1996
15 years 8 months ago
Exploiting Task-Level Parallelism Using pTask
This paper presents pTask-- a system that allows users to automatically exploit dynamic task-level parallelism in sequential array-based C programs. The system employs compiler an...
Tarek S. Abdelrahman, Sum Huynh
JUCS
2007
102views more  JUCS 2007»
15 years 6 months ago
The Use of Runtime Reconfiguration on FPGA Circuits to Increase the Performance of the AES Algorithm Implementation
: This article presents an architecture that encrypts data with the AES algorithm. This architecture can be implemented on the Xilinx Virtex II FPGA family, by applying pipelining ...
Oscar Pérez, Yves Berviller, Camel Tanougas...
CORR
2004
Springer
117views Education» more  CORR 2004»
15 years 6 months ago
Traffic-driven model of the World Wide Web graph
We propose a model for the World Wide Web graph that couples the topological growth with the traffic's dynamical evolution. The model is based on a simple traffic-driven dynam...
Alain Barrat, Marc Barthelemy, Alessandro Vespigna...