Sciweavers

403 search results - page 29 / 81
» Data Partitioning for Minimizing Transferred Data in MapRedu...
Sort
View
ICALP
2001
Springer
15 years 8 months ago
A Framework for Index Bulk Loading and Dynamization
Abstract. In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced parti...
Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, ...
SOSP
2009
ACM
16 years 28 days ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
ENTCS
2002
80views more  ENTCS 2002»
15 years 3 months ago
Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited
In this paper, we revisit the forward and backward approaches to the verification of extensions of infinite state Petri Nets. As contributions, we propose an efficient data struct...
Alain Finkel, Jean-François Raskin, Mathias...
DFT
2006
IEEE
203views VLSI» more  DFT 2006»
15 years 10 months ago
Self Testing SoC with Reduced Memory Requirements and Minimized Hardware Overhead
This paper describes a methodology of creating a built-in diagnostic system of a System on Chip and experimental results of the system application on the AT94K FPSLIC with cores d...
Ondrej Novák, Zdenek Plíva, Jiri Jen...
POPL
2004
ACM
16 years 4 months ago
Separation and information hiding
We investigate proof rules for information hiding, using the recent formalism of separation logic. In essence, we use the separating conjunction to partition the internal resource...
Peter W. O'Hearn, Hongseok Yang, John C. Reynolds