Sciweavers

2366 search results - page 240 / 474
» Mapping time
Sort
View
MICRO
2005
IEEE
123views Hardware» more  MICRO 2005»
16 years 4 days ago
A Criticality Analysis of Clustering in Superscalar Processors
Clustered machines partition hardware resources to circumvent the cycle time penalties incurred by large, monolithic structures. This partitioning introduces a long inter-cluster ...
Pierre Salverda, Craig B. Zilles
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
15 years 12 months ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara
CLOUD
2010
ACM
15 years 11 months ago
Making cloud intermediate data fault-tolerant
Parallel dataflow programs generate enormous amounts of distributed data that are short-lived, yet are critical for completion of the job and for good run-time performance. We ca...
Steven Y. Ko, Imranul Hoque, Brian Cho, Indranil G...
VLDB
1999
ACM
149views Database» more  VLDB 1999»
15 years 10 months ago
The Persistent Cache: Improving OID Indexing in Temporal Object-Oriented Database Systems
In a temporal OODB, an OID index (OIDX) is needed to map from OID to the physical location of the object. In a transaction time temporal OODB, the OIDX should also index the objec...
Kjetil Nørvåg
MOBILIGHT
2010
15 years 4 months ago
A Framework for the Design Space Exploration of Software-Defined Radio Applications
Abstract. This paper describes a framework for the design space exploration of resource-efficient software-defined radio architectures. This design space exploration is based on a ...
Thorsten Jungeblut, Ralf Dreesen, Mario Porrmann, ...