Quicksilver Scalable Multicast (QSM)

Ostrowski, K; Birman, Kenneth P.; Dolev, Danny

doi:10.1109/nca.2008.33

Cited by 19 publications

(22 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Ambos se basan en los servicios de difusión (multicast) confiable con Orden Total y las notificaciones de membresía de grupo que brinda el GCS [19]. Para la implementación de SLOTS se eligió Spread Toolkit por su madurez, adecuado rendimiento y abundante documentación, frente a otros GCS tales como Ring Paxos [20] en el que aún permanecen algunas características sin implementar, o QuickSilver [21], que solo está disponible para plataforma Windows o Corosync [22] que no está completamente documentado.…”

Section: Antecedentes Y Trabajos Relacionadosunclassified

A Fault-Tolerant Algorithm For Distributed Resource Allocation

Pessolani

Jara

Gonnet

et al. 2017

IEEE Latin Am. Trans.

View full text Add to dashboard Cite

Abstract-Resource allocation is a usual problem that must be faced during a distributed system design. Despite the large number of algorithms proposed in literature to solve this problem, most papers lack of detailed descriptions about how to turn these algorithms into real-world reliable protocols. This article presents a fault-tolerant algorithm for distributed resource allocation named SLOTS which is implemented as an executable protocol. It allocates resources among members in a fairly manner using simple heuristics and employing a donation approach. SLOTS supports the dynamic behavior of clusters and provides high availability services. It bases its fault-tolerance properties and membership changes in atomic sets of operations (like transactions) using services provided by an underlying Group Communication System.

show abstract

Section: Antecedentes Y Trabajos Relacionadosunclassified

A Fault-Tolerant Algorithm For Distributed Resource Allocation

Pessolani

Jara

Gonnet

et al. 2017

IEEE Latin Am. Trans.

View full text Add to dashboard Cite

show abstract

“…Notable examples of group communication toolkits are Spread [3], Totem [4], JGroups [30], Isis [12], Isis 2 [11], Transis [31], QuickSilver [59], and Horus [75].…”

Section: Group Communicationmentioning

confidence: 99%

High availability, elasticity, and strong consistency for massively parallel scans over relational data

Unterbrunner¹,

Alonso

Kossmann

2013

The VLDB Journal

View full text Add to dashboard Cite

An elastic and highly available data store is a key component of many cloud applications. Existing data stores with strong consistency guarantees are designed and optimized for small updates, key-value access, and (if supported) small range queries over a predefined key column. This raises performance and availability problems for applications which inherently require large updates, non-key access, and large range queries. This paper presents a solution to these problems: Crescando/RB; a distributed, scan-based, main memory, relational data store (single table) with robust performance and high availability. The system addresses a real, large-scale industry use case: the Amadeus travel management system. This paper focuses on the distribution layer of Crescando/RB, the problem and theory behind it, the rationale underlying key design decisions, and the novel multicast protocol and replication framework it is composed of. Highlighting the key features of the distribution layer, we present experimental results showing that even under permanent node failures and large-scale data repartitioning, Crescando/RB remains fully available and capable of sustaining a heavy query and update load.

show abstract

“…In most anticipated use scenarios, individual office documents would be accessed by just a few users at a time. A comprehensive discussion of throughput and scalability of the multicast substrates provided by the live objects platform can be found in [5].…”

Section: Performance Evaluationmentioning

confidence: 99%

Using live distributed objects for office automation

Ahnn

Birman

Ostrowski

et al. 2008

Proceedings of the ACM/IFIP/USENIX Middleware '08 Conference Companion

Self Cite

View full text Add to dashboard Cite

Abstract. Web services and platforms such as .NET make it easy to integrate interactive end-user applications with backend services. However, it remains hard to build collaborative applications in which information is shared within teams. This paper introduces a new drag-and-drop technology, in which standard office documents (spreadsheets, databases, etc.) are interconnected with event-driven middleware ("live distributed objects"), to create distributed applications in which changes to underlying data propagate quickly to downstream applications. Information is replicated in a consistent manner, making it easy for team members to share updates and to coordinate their actions. We present our middleware platform, and show that it offers good performance and scalability, with small resource footprint. Moreover, because the approach is highly automated, and the underlying middleware is highly configurable, we're in a position to automatically address security and reliability needs that might otherwise be onerous. In addition to reviewing our existing system, we list open issues, which include integration with external data sources, and updating stored, but inactive objects.

show abstract

Quicksilver Scalable Multicast (QSM)

Cited by 19 publications

References 18 publications

A Fault-Tolerant Algorithm For Distributed Resource Allocation

A Fault-Tolerant Algorithm For Distributed Resource Allocation

High availability, elasticity, and strong consistency for massively parallel scans over relational data

Using live distributed objects for office automation

Contact Info

Product

Resources

About