Concept

Partition type

Publications associées (10)

Adaptive partitioning and indexing for in situ query processing

Anastasia Ailamaki, Manolis Karpathiotakis, Ioannis Alagiannis, Manoussos Gavriil Athanassoulis, Matthaios Alexandros Olma

The constant flux of data and queries alike has been pushing the boundaries of data analysis systems. The increasing size of raw data files has made data loading an expensive operation that delays the data-to-insight time. To alleviate the loading cost, in ...

SPRINGER2020

Statistical Physics Methods for Community Detection

Chun Lam Chan

This thesis is devoted to information-theoretic aspects of community detection. The importance of community detection is due to the massive amount of scientific data today that describes relationships between items from a network, e.g., a social network. I ...

EPFL2019

Almost tiling of the Boolean lattice with copies of a poset

Istvan Tomon

Let P be a partially ordered set. If the Boolean lattice (2[n],⊂) can be partitioned into copies of P for some positive integer n, then P must satisfy the following two trivial conditions: (1) the size of P is a power of 2, (2) P has a unique maximal and m ...

ELECTRONIC JOURNAL OF COMBINATORICS2018

Fast Partitioning of Vector-Valued Images

Martin Kurt Storath

We propose a fast splitting approach to the classical variational formulation of the image partitioning problem, which is frequently referred to as the Potts or piecewise constant Mumford-Shah model. For vector-valued images, our approach is significantly ...

Siam Publications2014

Clock-SI: Snapshot Isolation for Partitioned Data Stores Using Loosely Synchronized Clocks

Willy Zwaenepoel, Sameh Mohamed Elnikety, Jiaqing Du

Clock-SI is a fully distributed protocol that implements snapshot isolation (SI) for partitioned data stores. It derives snapshot and commit timestamps from loosely synchronized clocks, rather than from a centralized timestamp authority as used in current ...

2013

Robust Software Partitioning with Multiple Instantiation

Daniel Kuhn, Wolfram Wiesemann

The purpose of software partitioning is to assign code segments of a given computer program to a range of execution locations such as general-purpose processors or specialist hardware components. These execution locations differ in speed, communication cha ...

2012

Cost-efficient and Differentiated Data Availability Guarantees in Data Clouds

Karl Aberer, Nicolas Bonvin

Failures of any type are common in current datacenters. As data scales up, its availability becomes more complex, while different availability levels per application or per data item may be required. In this paper, we propose a self- managed key-value stor ...

IEEE2010

A self-organized, fault-tolerant and scalable replication scheme for cloud storage

Karl Aberer, Nicolas Bonvin

Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while different availability levels per application or per data item may be required. In t ...

ACM2010

On the Specification of Partitionable Group Membership

André Schiper, Stefan Pleisch, Olivier Rütti

Group communication in partitionable systems has been the focus of many research activities over the last decade. Fault-tolerant applications in a partitionable system model generally rely on two basic services: a group membership service and a reliable mu ...

IEEE Computer Society2008

Transparent Replication for Fault Tolerance in Distributed Ada 95

In this paper we present the foundations of Rapids ("Replicated Ada Partitions In Distributed Systems"), an implementaion of the PCS supporting the transparent replication of partitions in distributed Ada 95 using semi-active replication. The inherently no ...

ACM Press1999

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search