high_scalability high_scalability-2012 high_scalability-2012-1273 knowledge-graph by maker-knowledge-mining
Source: html
Introduction: Neil Conway from Berkeley CS is giving an advanced level talk at a meetup today in San Francisco on a new paper: Logic and Lattices for Distributed Programming - extending set logic to support CRDT-style lattices. The description of the meetup is probably the clearest introduction to the paper: Developers are increasingly choosing datastores that sacrifice strong consistency guarantees in exchange for improved performance and availability. Unfortunately, writing reliable distributed programs without the benefit of strong consistency can be very challenging. In this talk, I'll discuss work from our group at UC Berkeley that aims to make it easier to write distributed programs without relying on strong consistency. Bloom is a declarative programming language for distributed computing, while CALM is an analysis technique that identifies programs that are guaranteed to be eventually consistent. I'll then discuss our recent work on extending CALM to support a broader range of
sentIndex sentText sentNum sentScore
1 Neil Conway from Berkeley CS is giving an advanced level talk at a meetup today in San Francisco on a new paper: Logic and Lattices for Distributed Programming - extending set logic to support CRDT-style lattices. [sent-1, score-0.435]
2 The description of the meetup is probably the clearest introduction to the paper: Developers are increasingly choosing datastores that sacrifice strong consistency guarantees in exchange for improved performance and availability. [sent-2, score-0.476]
3 Unfortunately, writing reliable distributed programs without the benefit of strong consistency can be very challenging. [sent-3, score-0.654]
4 In this talk, I'll discuss work from our group at UC Berkeley that aims to make it easier to write distributed programs without relying on strong consistency. [sent-4, score-0.679]
5 Bloom is a declarative programming language for distributed computing, while CALM is an analysis technique that identifies programs that are guaranteed to be eventually consistent. [sent-5, score-0.801]
6 I'll then discuss our recent work on extending CALM to support a broader range of programs, drawing upon ideas from CRDTs (A Commutative Replicated Data Type). [sent-6, score-0.479]
7 Abstract from the paper: In recent years there has been interest in achieving application-level consistency criteria without the latency and availability costs of strongly consistent storage infrastructure. [sent-8, score-0.247]
8 A standard technique is to adopt a vocabulary of commutative operations; this avoids the risk of inconsistency due to message reordering. [sent-9, score-0.383]
9 A more powerful approach was recently captured by the CALM theorem, which proves that logically monotonic programs are guaranteed to be eventually consistent. [sent-10, score-0.703]
10 In logic languages such as Bloom, CALM analysis can automatically verify that program modules achieve consistency without coordination. [sent-11, score-0.451]
11 In this paper we present BloomL, an extension to Bloom that takes inspiration from both these traditions. [sent-12, score-0.235]
12 BloomL generalizes Bloom to support lattices and extends the power of CALM analysis to whole programs containing arbitrary lattices. [sent-13, score-0.856]
13 We show how the Bloom interpreter can be generalized to support efficient evaluation of lattice-based code using well-known strategies from logic programming. [sent-14, score-0.399]
14 Finally, we use BloomL to develop several practical distributed programs, including a key-value store similar to Amazon Dynamo, and show how BloomL encourages the safe composition of small, easy-to-analyze lattices into larger programs. [sent-15, score-0.526]
wordName wordTfidf (topN-words)
[('calm', 0.423), ('blooml', 0.397), ('programs', 0.306), ('bloom', 0.292), ('lattices', 0.27), ('commutative', 0.143), ('logic', 0.125), ('extending', 0.121), ('consistency', 0.118), ('meetup', 0.116), ('berkeley', 0.113), ('paper', 0.112), ('guaranteed', 0.107), ('strong', 0.102), ('technique', 0.091), ('monotonic', 0.09), ('analysis', 0.088), ('vocabulary', 0.085), ('discuss', 0.084), ('interpreter', 0.081), ('ata', 0.081), ('datastores', 0.073), ('crdts', 0.073), ('support', 0.073), ('identifies', 0.071), ('uc', 0.071), ('recent', 0.07), ('cs', 0.07), ('neil', 0.07), ('distributed', 0.069), ('eventually', 0.069), ('composition', 0.068), ('sacrifice', 0.067), ('drawing', 0.067), ('proves', 0.066), ('inspiration', 0.066), ('logically', 0.065), ('inconsistency', 0.064), ('broader', 0.064), ('generalized', 0.062), ('encourages', 0.061), ('extends', 0.061), ('verify', 0.061), ('dynamo', 0.061), ('without', 0.059), ('aims', 0.059), ('containing', 0.058), ('show', 0.058), ('extension', 0.057), ('theorem', 0.056)]
simIndex simValue blogId blogTitle
same-blog 1 1.0 1273 high scalability-2012-06-27-Paper: Logic and Lattices for Distributed Programming
Introduction: Neil Conway from Berkeley CS is giving an advanced level talk at a meetup today in San Francisco on a new paper: Logic and Lattices for Distributed Programming - extending set logic to support CRDT-style lattices. The description of the meetup is probably the clearest introduction to the paper: Developers are increasingly choosing datastores that sacrifice strong consistency guarantees in exchange for improved performance and availability. Unfortunately, writing reliable distributed programs without the benefit of strong consistency can be very challenging. In this talk, I'll discuss work from our group at UC Berkeley that aims to make it easier to write distributed programs without relying on strong consistency. Bloom is a declarative programming language for distributed computing, while CALM is an analysis technique that identifies programs that are guaranteed to be eventually consistent. I'll then discuss our recent work on extending CALM to support a broader range of
2 0.27359784 844 high scalability-2010-06-18-Paper: The Declarative Imperative: Experiences and Conjectures in Distributed Logic
Introduction: The Declarative Imperative: Experiences and Conjectures in Distributed Logic is written by UC Berkeley's Joseph Hellerstein for a keynote speech he gave at PODS . The video version of the talk is here . You may have heard about Mr. Hellerstein through the Berkeley Orders Of Magnitude project ( BOOM ), whose purpose is to help people build systems that are OOM (orders of magnitude) bigger than are building today, with OOM less effort than traditional programming methodologies . A noble goal which may be why BOOM was rated as a top 10 emerging technology for 2010 by MIT Technology Review . Quite an honor. The motivation for the talk is a familiar one: it's a dark period for computer programming and if we don't learn how to write parallel programs the children of Moore's law will destroy us all. We have more and more processors, yet we are stuck on figuring out how the average programmer can exploit them. The BOOM solution is the Bloom language which is based on Dedalus:
3 0.1135193 591 high scalability-2009-05-06-Dyrad
Introduction: The Dryad Project is investigating programming models for writing parallel and distributed programs to scale from a small cluster to a large data-center.
4 0.099860646 1227 high scalability-2012-04-13-Stuff The Internet Says On Scalability For April 13, 2012
Introduction: It's HighScalability Time: 50 million in 50 days : Draw Something downloads; 40 million concurrent users : Skype Key to making sensors ubiquitous is getting the BOM cost down. Here's a dream way of making that happen: Bye-Bye Batteries: Radio Waves as a Low-Power Source . “Silicon technology has advanced to the point where even tiny amounts of energy can do useful work.” No batteries == cheaper, smaller products == ubiquity. The MySQL “swap insanity” problem and the effects of the NUMA architecture . Jeremy Cole with a spectacular article on the differences between NUMA and SMP/UMA systems and the mostly unsatisfactory tricks required to get MySQL to perform on NUMA systems. There are really two issues: the evils of an OS controlled swap and NUMA performance effects due to a single node (in the NUMA sense) running out of memory. This is the kind of stuff you only see when you push your systems to the edge. Also, Measuring NUMA effects with the STREAM benchmark , MongoDB
5 0.093595713 1625 high scalability-2014-04-03-Leslie Lamport to Programmers: You're Doing it Wrong
Introduction: Famous computer scientist Leslie Lamport is definitely not a worse is better kind of guy. In Computation and State Machines he wants to make the case that to get better programs we need to teach programmers to think better. And programmers will think better when they learn to think in terms of concepts firmly grounded in the language of mathematics. I was disappointed that there was so much English in the paper. Surely it would have been more convincing if it was written as a mathematical proof. Or would it? This whole topic has been argued extensively throughout thousands of years of philosophy. Mathematics has always been a strange attractor for those trying to escape a flawed human rationality. In the end as alluring as the utopia of mathematics is, it lacks a coherent theory of meaning and programming is not about rearranging ungrounded symbols, it's about manipulating and shaping meaning. For programmers I think Ludwig Wittgenstein has the right sense of things. Mean
6 0.091345802 963 high scalability-2010-12-23-Paper: CRDTs: Consistency without concurrency control
7 0.087343529 787 high scalability-2010-03-03-Hot Scalability Links for March 3, 2010
8 0.087123089 1509 high scalability-2013-08-30-Stuff The Internet Says On Scalability For August 30, 2013
9 0.083319604 589 high scalability-2009-05-05-Drop ACID and Think About Data
10 0.082171068 687 high scalability-2009-08-24-How Google Serves Data from Multiple Datacenters
11 0.081616394 1302 high scalability-2012-08-10-Stuff The Internet Says On Scalability For August 10, 2012
12 0.078682706 704 high scalability-2009-09-13-How is Berkely DB fare against other Key-Value Database
13 0.074845687 1146 high scalability-2011-11-23-Paper: Don’t Settle for Eventual: Scalable Causal Consistency for Wide-Area Storage with COPS
14 0.074151859 397 high scalability-2008-09-28-Product: Happy = Hadoop + Python
15 0.07385923 1022 high scalability-2011-04-13-Paper: NoSQL Databases - NoSQL Introduction and Overview
16 0.068445966 1637 high scalability-2014-04-25-Stuff The Internet Says On Scalability For April 25th, 2014
17 0.068035975 526 high scalability-2009-03-05-Strategy: In Cloud Computing Systematically Drive Load to the CPU
18 0.066412456 1339 high scalability-2012-10-12-Stuff The Internet Says On Scalability For October 12, 2012
19 0.066014148 1374 high scalability-2012-12-18-Georeplication: When Bad Things Happen to Good Systems
20 0.065875031 1153 high scalability-2011-12-08-Update on Scalable Causal Consistency For Wide-Area Storage With COPS
topicId topicWeight
[(0, 0.091), (1, 0.038), (2, 0.037), (3, 0.068), (4, -0.004), (5, 0.068), (6, -0.002), (7, 0.002), (8, -0.031), (9, 0.021), (10, 0.013), (11, 0.016), (12, -0.035), (13, -0.05), (14, 0.016), (15, -0.0), (16, 0.034), (17, 0.007), (18, 0.026), (19, -0.039), (20, 0.041), (21, 0.035), (22, -0.052), (23, 0.035), (24, -0.072), (25, -0.015), (26, 0.016), (27, -0.021), (28, 0.014), (29, -0.033), (30, 0.03), (31, 0.021), (32, -0.062), (33, 0.028), (34, -0.031), (35, -0.065), (36, -0.009), (37, 0.023), (38, 0.018), (39, 0.058), (40, -0.013), (41, 0.038), (42, -0.023), (43, -0.028), (44, 0.009), (45, -0.009), (46, -0.022), (47, 0.011), (48, 0.019), (49, -0.056)]
simIndex simValue blogId blogTitle
same-blog 1 0.97504133 1273 high scalability-2012-06-27-Paper: Logic and Lattices for Distributed Programming
Introduction: Neil Conway from Berkeley CS is giving an advanced level talk at a meetup today in San Francisco on a new paper: Logic and Lattices for Distributed Programming - extending set logic to support CRDT-style lattices. The description of the meetup is probably the clearest introduction to the paper: Developers are increasingly choosing datastores that sacrifice strong consistency guarantees in exchange for improved performance and availability. Unfortunately, writing reliable distributed programs without the benefit of strong consistency can be very challenging. In this talk, I'll discuss work from our group at UC Berkeley that aims to make it easier to write distributed programs without relying on strong consistency. Bloom is a declarative programming language for distributed computing, while CALM is an analysis technique that identifies programs that are guaranteed to be eventually consistent. I'll then discuss our recent work on extending CALM to support a broader range of
2 0.82686836 1243 high scalability-2012-05-10-Paper: Paxos Made Moderately Complex
Introduction: If you are a normal human being and find the Paxos protocol confusing, then this paper, Paxos Made Moderately Complex , is a great find. Robbert van Renesse from Cornell University has written a clear and well written paper with excellent explanations. The Abstract: For anybody who has ever tried to implement it, Paxos is by no means a simple protocol, even though it is based on relatively simple invariants. This paper provides imperative pseudo-code for the full Paxos (or Multi-Paxos) protocol without shying away from discussing various implementation details. The initial description avoids optimizations that complicate comprehension. Next we discuss liveness, and list various optimizations that make the protocol practical. Related Articles Paxos on HighScalability.com
3 0.76785338 1374 high scalability-2012-12-18-Georeplication: When Bad Things Happen to Good Systems
Introduction: Georeplication is one of the standard techniques for dealing when bad things--failure and latency--happen to good systems. The problem is always: how do you do that? Murat Demirbas , Associate Professor at SUNY Buffalo, has a couple of really good posts that can help: MDCC: Multi-Data Center Consistency and Making Geo-Replicated Systems Fast as Possible, Consistent when Necessary . In MDCC: Multi-Data Center Consistency Murat discusses a paper that says synchronous wide-area replication can be feasible. There's a quick and clear explanation of Paxos and various optimizations that is worth the price of admission. We find that strong consistency doesn't have to be lost across a WAN: The good thing about using Paxos over the WAN is you /almost/ get the full CAP (all three properties: consistency, availability, and partition-freedom). As we discussed earlier (Paxos taught), Paxos is CP, that is, in the presence of a partition, Paxos keeps consistency over availability. But, P
4 0.76586711 963 high scalability-2010-12-23-Paper: CRDTs: Consistency without concurrency control
Introduction: For a great Christmas read forget The Night Before Christmas , a heart warming poem written by Clement Moore for his children, that created the modern idea of Santa Clause we all know and anticipate each Christmas eve. Instead, curl up with a some potent eggnog , nog being any drink made with rum, and read CRDTs: Consistency without concurrency control  by Mihai Letia, Nuno Preguiça, and Marc Shapiro, which talks about CRDTs (Commutative Replicated Data Type), a data type whose operations commute when they are concurrent . From the introduction, which also serves as a nice concise overview of distributed consistency issues: Shared read-only data is easy to scale by using well-understood replication techniques. However, sharing mutable data at a large scale is a difficult problem, because of the CAP impossibility result [5]. Two approaches dominate in practice. One ensures scalability by giving up consistency guarantees, for instance using the Last-Writer-Wins (LWW) approach [
5 0.75920421 507 high scalability-2009-02-03-Paper: Optimistic Replication
Introduction: To scale in the large you have to partition. Data has to be spread around, replicated, and kept consistent (keeping replicas sufficiently similar to one another despite operations being submitted independently at different sites). The result is a highly available, well performing, and scalable system. Partitioning is required, but it's a pain to do efficiently and correctly. Until Quantum teleportation becomes a reality how data is kept consistent across a bewildering number of failure scenarios is a key design decision. This excellent paper by Yasushi Saito and Marc Shapiro takes us on a wild ride (OK, maybe not so wild) of different approaches to achieving consistency. What's cool about this paper is they go over some real systems that we are familiar with and cover how they work: DNS (single-master, state-transfer), Usenet (multi-master), PDAs (multi-master, state-transfer, manual or application-specific conflict resolution), Bayou (multi-master, operation-transfer, epidemic
6 0.74751693 844 high scalability-2010-06-18-Paper: The Declarative Imperative: Experiences and Conjectures in Distributed Logic
7 0.74579918 1459 high scalability-2013-05-16-Paper: Warp: Multi-Key Transactions for Key-Value Stores
10 0.697752 890 high scalability-2010-09-01-Paper: The Case for Determinism in Database Systems
11 0.69419765 1153 high scalability-2011-12-08-Update on Scalable Causal Consistency For Wide-Area Storage With COPS
12 0.67890203 1450 high scalability-2013-05-01-Myth: Eric Brewer on Why Banks are BASE Not ACID - Availability Is Revenue
13 0.67452592 357 high scalability-2008-07-26-Google's Paxos Made Live – An Engineering Perspective
14 0.67242843 1463 high scalability-2013-05-23-Paper: Calvin: Fast Distributed Transactions for Partitioned Database Systems
15 0.6550439 850 high scalability-2010-06-30-Paper: GraphLab: A New Framework For Parallel Machine Learning
16 0.65052706 1611 high scalability-2014-03-12-Paper: Scalable Eventually Consistent Counters over Unreliable Networks
17 0.64733553 1299 high scalability-2012-08-06-Paper: High-Performance Concurrency Control Mechanisms for Main-Memory Databases
18 0.64517456 950 high scalability-2010-11-30-NoCAP – Part III – GigaSpaces clustering explained..
19 0.64192086 705 high scalability-2009-09-16-Paper: A practical scalable distributed B-tree
20 0.63319999 676 high scalability-2009-08-08-Yahoo!'s PNUTS Database: Too Hot, Too Cold or Just Right?
topicId topicWeight
[(1, 0.132), (2, 0.211), (5, 0.293), (30, 0.04), (40, 0.015), (61, 0.087), (77, 0.031), (79, 0.026), (85, 0.019), (94, 0.049)]
simIndex simValue blogId blogTitle
1 0.95361817 534 high scalability-2009-03-12-Google TechTalk: Amdahl's Law in the Multicore Era
Introduction: Over the last several decades computer architects have been phenomenally successful turning the transistor bounty provided by Moore's Law into chips with ever increasing single-threaded performance. During many of these successful years, however, many researchers paid scant attention to multiprocessor work. Now as vendors turn to multicore chips, researchers are reacting with more papers on multi-threaded systems. While this is good, we are concerned that further work on single-thread performance will be squashed. To help understand future high-level trade-offs, we develop a corollary to Amdahl's Law for multicore chips [Hill & Marty, IEEE Computer 2008]. It models fixed chip resources for alternative designs that use symmetric cores, asymmetric cores, or dynamic techniques that allow cores to work together on sequential execution. Our results encourage multicore designers to view performance of the entire chip rather than focus on core efficiencies. Moreover, we observe that obtai
same-blog 2 0.88202035 1273 high scalability-2012-06-27-Paper: Logic and Lattices for Distributed Programming
Introduction: Neil Conway from Berkeley CS is giving an advanced level talk at a meetup today in San Francisco on a new paper: Logic and Lattices for Distributed Programming - extending set logic to support CRDT-style lattices. The description of the meetup is probably the clearest introduction to the paper: Developers are increasingly choosing datastores that sacrifice strong consistency guarantees in exchange for improved performance and availability. Unfortunately, writing reliable distributed programs without the benefit of strong consistency can be very challenging. In this talk, I'll discuss work from our group at UC Berkeley that aims to make it easier to write distributed programs without relying on strong consistency. Bloom is a declarative programming language for distributed computing, while CALM is an analysis technique that identifies programs that are guaranteed to be eventually consistent. I'll then discuss our recent work on extending CALM to support a broader range of
3 0.83521092 153 high scalability-2007-11-13-Friendster Lost Lead Because of a Failure to Scale
Introduction: Hey, this scaling stuff might just be important. Jim Scheinman, former Bebo and Friendster exec, puts the blame squarely on Friendster's inability to scale as why they lost the social networking race: VB : Can you tell me a bit about what you learned in your time at Friendster? JS : For me, it basically came down to failed execution on the technology side — we had millions of Friendster members begging us to get the site working faster so they could log in and spend hours social networking with their friends. I remember coming in to the office for months reading thousands of customer service emails telling us that if we didn’t get our site working better soon, they’d be ‘forced to join’ a new social networking site that had just launched called MySpace…the rest is history. To be fair to Friendster’s technology team at the time, they were on the forefront of many new scaling and database issues that web sites simply hadn’t had to deal with prior to Friendster. As is often
4 0.83307379 341 high scalability-2008-06-06-GigaOm Structure 08 Conference on June 25th in San Francisco
Introduction: If you just can't get enough high scalability talk you might want to take a look GigaOm's Structure 08 conference. The slate of speakers looks appropriately interesting and San Francisco is truly magical this time of year. High Scalability readers even get a price break is you use the HIGHSCALE discount code! I'll be on vacation so I won't see you there, but it looks like a good time. For a nice change of pace consider visiting MoMA next door. Here's a blurb on the conference: A reminder to our readers about Structure 08, GigaOm's upcoming conference dedicated to web infrastructure. In addition to keynotes from leaders like Jim Crowe, chairman and CEO of Level 3 Communications and Werner Vogels, CTO of Amazon, the event will feature workshops from Google App Engine, Microsoft and a special workshop from Fenwick and West who will cover how to raise money for an infrastructure start up. Learn from the guru's at Amazon, Google, Microsoft, Sun, VMWare and more about what the future
5 0.81476414 1113 high scalability-2011-09-09-Stuff The Internet Says On Scalability For September 9, 2011
Introduction: Scale the modern way / No brush / No lather / No rub-in / Big tube 35 cents - Drug stores / HighScalability : GAE Serves 1.5 Billion Pages a Day Potent quotables : @ kendallmiller : The code changes I'm most proud of are the ones few people will ever see - like I just tripled the scalability of our session analysis. @ Kellblog : Heard: "Cassandra is more a system on which you build a DBMS than a DBMS itself." @DDevine_au : Ah dammit . I'm thinking of using a # NoSQL database. Down the rabbit hole I go. A comprehensive guide to parallel video decoding . Emeric Grange with a sweet explanation of the decoding process. Node.js vs. Scala - "Scaling in the large" . tedsuo tldrs it: in node, there is only one concurrency model. A number of other platforms offer multiple concurrency models. If you want access to one of those other models down the line, you will have to carve off that part of your application and rewrite i
6 0.79057771 899 high scalability-2010-09-09-How did Google Instant become Faster with 5-7X More Results Pages?
7 0.77815479 1487 high scalability-2013-07-05-Stuff The Internet Says On Scalability For July 5, 2013
8 0.77590835 485 high scalability-2009-01-05-Messaging is not just for investment banks
9 0.77385825 1523 high scalability-2013-09-27-Stuff The Internet Says On Scalability For September 27, 2013
10 0.77340758 1247 high scalability-2012-05-18-Stuff The Internet Says On Scalability For May 18, 2012
11 0.76799339 262 high scalability-2008-02-26-Architecture to Allow High Availability File Upload
12 0.74447119 1424 high scalability-2013-03-15-Stuff The Internet Says On Scalability For March 15, 2013
13 0.73933452 174 high scalability-2007-12-05-Product: Tugela Cache
15 0.72144932 42 high scalability-2007-07-30-Product: GridLayer. Utility computing for online application
16 0.69337058 126 high scalability-2007-10-20-Should you build your next website using 3tera's grid OS?
17 0.68475187 595 high scalability-2009-05-08-Publish-subscribe model does not scale?
18 0.68460494 963 high scalability-2010-12-23-Paper: CRDTs: Consistency without concurrency control
19 0.67708302 1042 high scalability-2011-05-17-Facebook: An Example Canonical Architecture for Scaling Billions of Messages
20 0.67672688 1642 high scalability-2014-05-02-Stuff The Internet Says On Scalability For May 2nd, 2014