サクサク読めて、アプリ限定の機能も多数!
トップへ戻る
ノーベル賞
blog.acolyer.org
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic My VM is lighter (and safer) than your container Manco et al., SOSP’17 Can we have the improved isolation of VMs, with the efficiency of containers? In today’s paper choice the authors investigate the boundaries of Xen-based VM performance. They find and eliminate bottlenecks when
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic Serverless computing: economic and architectural impact Adzic et al., ESEC/FSE’17 Today we have another paper inspired by talks from the GOTO Copenhagen conference, in this case Gojko Adzic’s talk on ”Designing for the serverless age.” It’s a case study on how serverless computing
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic HoTTSQL: Proving query rewrites with univalent SQL semantics Chu et al., PLDI’17 Query rewriting is a vital part of SQL query optimisation, in which rewrite rules are applied to a query to transform it into forms with (hopefully!) a lower execution cost. Clearly when a query is re
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic Bringing the web up to speed with WebAssembly Haas et al., PLDI 2017 This is a joint paper from authors at Google, Mozilla, Microsoft and Apple describing the motivations for WebAssembly together with a very concise exposition of its core semantics. If you’re following along with
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic To type or not to type: quantifying detectable bugs in JavaScript Gao et al., ICSE 2017 This is a terrific piece of work with immediate practical applications for many project teams. Is it worth the extra effort to add static type annotations to a JavaScript project? Should I use
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic On the design of distributed programming models Meiklejohn, arXiv 2017. Today’s choice is a lovely thought piece by Christopher Meiklejohn, making the case for distributed programming models. We’ve witnessed a progression in data structures from sequential (non-thread safe) to con
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic Automatic database management system tuning through large-scale machine learning Aken et al. , SIGMOD’17 Achieving good performance in DBMSs is non-trivial as they are complex systems with many tunable options that control nearly all aspects of their runtime operation. OtterTune u
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic A general purpose counting filter: making every bit count Pandey et al., SIGMOD’17 It’s been a while since we looked at a full on algorithms and data structures paper, but this one was certainly worth waiting for. We’re in the world of Approximate Membership Query (AMQ) data struc
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic Spanner: becoming a SQL system Bacon et al., SIGMOD’17 This week we’ll start digging into some of the papers from SIGMOD’17. First up is a terrific ‘update’ paper on Google’s Spanner which brings the story up to date in the five years since the original OSDI’12 paper. … in many wa
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic ImageNet Classification with Deep Convolutional Neural Networks – Krizhevsky et al. 2012 Like the large-vocabulary speech recognition paper we looked at yesterday, today’s paper has also been described as a landmark paper in the history of deep learning. It’s also a surprisingly e
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic System programming in Rust: beyond safety Balasubramanian et al., HotOS’17 Balasubramanian et al. want us to switch all of our systems programming over to Rust. This paper sets out the case. Despite many advances in programming languages, clean-slate operating systems, hypervisors
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic Node.fz: Fuzzing the server-side event-driven architecture Davis et al., EuroSys’17 This paper provides a fascinating look at common causes of concurrency bugs in server-side event driven architecture (EDA) based applications. By far the most popular framework supporting this styl
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic Mosaic: Processing a trillion-edge graph on a single machine Maass et al., EuroSys’17 Unless your graph is bigger than Facebook’s, you can process it on a single machine. With the inception of the internet, large-scale graphs comprising web graphs or social networks have become co
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic An empirical study on the correctness of formally verified distributed systems Fonseca et al., EuroSys’17 “Is your distributed system bug free?” “I formally verified it!” “Yes, but is your distributed system bug free?” There’s a really important discussion running through this pap
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic Understanding deep learning requires re-thinking generalization Zhang et al., ICLR’17 This paper has a wonderful combination of properties: the results are easy to understand, somewhat surprising, and then leave you pondering over what it all might mean for a long while afterwards
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic DeepCoder: Learning to write programs Balog et al., ICLR 2017 I’m mostly trying to wait until the ICLR conference itself before diving into the papers to be presented there, but this particular paper follows nicely on from yesterday, so I’ve decided to bring it forward. In ‘Large
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic Yesterday we looked at a series of papers on DNN understanding, generalisation, and transfer learning. One additional way of understanding what’s going on inside a network is to understand what can break it. Adversarial examples are deliberately constructed inputs which cause a ne
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic Weld: A common runtime for high performance data analytics Palkar et al. CIDR 2017 This is the first in a series of posts looking at papers from CIDR 2017. See yesterday’s post for my conference overview. We have a proliferation of data and analytics libraries and frameworks – for
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic Pivot Tracing: Dynamic Causal Monitoring for Distributed Systems – Mace et al. 2015 Problems in distributed systems are complex, varied, and unpredictable. By default, the information required to diagnose an issue may not be reported by the system or contained in system logs. Curr
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic Update: links giving 404s were too confusing, so I’ve removed links to not-yet published posts and will add them back in at the end of week! Last year we looked at Murat Demirbas’ Distributed systems seminar reading list for Spring 2016. Now of course it’s 2017 and Prof. Demirbas
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic Learning to learn by gradient descent by gradient descent Andrychowicz et al. NIPS 2016 One of the things that strikes me when I read these NIPS papers is just how short some of them are – between the introduction and the evaluation sections you might find only one or two pages! A
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic … and post a write-up on this blog. That sounds crazy of course – who has the time to read a paper every weekday? Let alone write it up! I’ve done it for each of the last two calendar years though, so I do have some reason to believe it might be possible ;). (Ok, technically it’s
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic Simple testing can prevent most critical failures: an analysis of production failures in distributed data-intensive systems Yuan et al. OSDI 2014 After yesterday’s paper I needed something a little easier to digest today, and ‘Simple testing can prevent most critical failures’ cer
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic On designing and deploying internet-scale services James Hamilton LISA ’07 Want to know how to build cloud native applications? You’ll be hard-pushed to find a better collection of wisdom, best practices, and hard-won experience than this 2007 paper from James Hamilton. It’s amazi
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic Goods: organizing Google’s datasets Havely et al. SIGMOD 2016 You can (try and) build a data cathedral. Or you can build a data bazaar. By data cathedral I’m referring to a centralised Enterprise Data Management solution that everyone in the company buys into and pays homage to, m
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic Identifying and quantifying architectural debt – Xiao et al., ICSE 2016 (Update: thanks to Lu Xiao for providing an open access version of this paper, the link above has now been updated to point to it.) So finally we have arrived at Xiao et al.’s 2016 ICSE paper (see the write-up
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic BTrDB: Optimizing Storage System Design for Timeseries Processing – Anderson & Culler 2016 It turns out you can accomplish quite a lot with 4,709 lines of Go code! How about a full time-series database implementation, robust enough to be run in production for a year where it store
次のページ
このページを最初にブックマークしてみませんか?
『the morning paper | a random walk through Computer Science research, by Adria...』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く