Sciweavers

1890 search results - page 298 / 378
» Querying Big Data by Accessing Small Data
Sort
View
HPCC
2009
Springer
15 years 3 months ago
On Instruction-Level Method for Reducing Cache Penalties in Embedded VLIW Processors
Usual cache optimisation techniques for high performance computing are difficult to apply in embedded VLIW applications. First, embedded applications are not always well structur...
Samir Ammenouche, Sid Ahmed Ali Touati, William Ja...
SPDP
1993
IEEE
15 years 3 months ago
How to Share an Object: A Fast Timing-Based Solution
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
Rajeev Alur, Gadi Taubenfeld
ADL
2000
Springer
373views Digital Library» more  ADL 2000»
15 years 3 months ago
BlueView: Virtual Document Servers for Digital Libraries
In the BlueView project, digital library services are developed and partially implemented based on the architecture of virtual document servers. Using standard tools like fulltext...
Andreas Heuer, Holger Meyer, Beate Porst, Patrick ...
ICDCS
1995
IEEE
15 years 2 months ago
Specifying Weak Sets
nt formal speci cations of a new abstraction, weak sets, which can be used to alleviate high latencies when retrieving data from a wide-area information system like the World Wide...
Jeannette M. Wing, David C. Steere
109
Voted
ICDT
2012
ACM
242views Database» more  ICDT 2012»
13 years 1 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher