A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
A Fault-Tolerance Shim for Serverless Computing
[article]
2020
arXiv
pre-print
Preserved Fulltext
A fractured read happens when, "... transaction T i writes versions x m and y n (in any order, with x possibly but not necessarily equal to y), [and] T j [later] reads version x m and version y k , and ...
arXiv:2003.06007v1
fatcat:aswezqbsjjdrhgzb2eemqvixg4
Crux: Locality-Preserving Distributed Services
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Distributed systems achieve scalability by distributing load across many machines, but wide-area deployments can introduce worst-case response latencies proportional to the network's diameter. Crux is a general framework to build locality-preserving distributed systems, by transforming an existing scalable distributed algorithm A into a new locality-preserving algorithm ALP, which guarantees for any two clients u and v interacting via ALP that their interactions exhibit worst-case response
arXiv:1405.0637v2
fatcat:jmvenhi77bbo7dzxdtpxpvswqq
more »
... cies proportional to the network latency between u and v. Crux builds on compact-routing theory, but generalizes these techniques beyond routing applications. Crux provides weak and strong consistency flavors, and shows latency improvements for localized interactions in both cases, specifically up to several orders of magnitude for weakly-consistent Crux (from roughly 900ms to 1ms). We deployed on PlanetLab locality-preserving versions of a Memcached distributed cache, a Bamboo distributed hash table, and a Redis publish/subscribe. Our results indicate that Crux is effective and applicable to a variety of existing distributed algorithms.
Rethinking serializable multiversion concurrency control
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The log is read (in parallel) by m concurrency control threads. These threads own a logical partition of the records in the database. ...
Faleiro et al. describe a technique for lazily evaluating transactions in the context of deterministic database systems [12] . ...
arXiv:1412.2324v3
fatcat:dn5fxbvjjnf7tctl7uwbljvj6i
Rethinking serializable multiversion concurrency control
2015
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
High performance transactions via early write visibility
2017
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
[49] , and Faleiro and Abadi [19] propose using dependency graphs to schedule transactions in deterministic systems. ...
Faleiro and Abadi's work on deterministic multi-version concurrency control is complimentary to PWV; PWV can use multiversioning to ensure that reads never block writes. ...
doi:10.14778/3055540.3055553
fatcat:nfmsjgamwzgx7a4gl4mgtklkcu
Serverless Computing: One Step Forward, Two Steps Back
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Serverless computing offers the potential to program the cloud in an autoscaling, pay-as-you go manner. In this paper we address critical gaps in first-generation serverless computing, which place its autoscaling potential at odds with dominant trends in modern computing: notably data-centric and distributed computing, but also open source and custom hardware. Put together, these gaps make current serverless offerings a bad fit for cloud innovation and particularly bad for data systems
arXiv:1812.03651v1
fatcat:gnbjeueh4vgtdmmypp3frcmfcq
more »
... n. In addition to pinpointing some of the main shortfalls of current serverless architectures, we raise a set of challenges we believe must be met to unlock the radical potential that the cloud---with its exabytes of storage and millions of cores---should offer to innovative developers.
Lazy evaluation of transactions in database systems
2014
Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Existing database systems employ an eager transaction processing scheme-that is, upon receiving a transaction request, the system executes all the operations entailed in running the transaction (which typically includes reading database records, executing userspecified transaction logic, and logging updates and writes) before reporting to the client that the transaction has completed. We introduce a lazy transaction execution engine, in which a transaction may be considered durably completed
doi:10.1145/2588555.2610529
dblp:conf/sigmod/FaleiroTA14
fatcat:rcqea7ptcbf75bi4u4anc62wvy
more »
... er only partial execution, while the bulk of its operations (notably all reads from the database and all execution of transaction logic) may be deferred until an arbitrary future time, such as when a user attempts to read some element of the transaction's write-set-all without modifying the semantics of the transaction or sacrificing ACID guarantees. Lazy transactions are processed deterministically, so that the final state of the database is guaranteed to be equivalent to what the state would have been had all transactions been executed eagerly. Our prototype of a lazy transaction execution engine improves temporal locality when executing related transactions, reduces peak provisioning requirements by deferring more non-urgent work until off-peak load times, and reduces contention footprint of concurrent transactions. However, we find that certain queries suffer increased latency, and therefore lazy database systems may not be appropriate for read-latency sensitive applications.
A fault-tolerance shim for serverless computing
2020
Proceedings of the Fifteenth European Conference on Computer Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A fractured read happens when, "... transaction T i writes versions x m and y n (in any order, with x possibly but not necessarily equal to y), [and] T j [later] reads version x m and version y k , and ...
doi:10.1145/3342195.3387535
dblp:conf/eurosys/SreekantiWCGHF20
fatcat:6rxf47vxbfeerknhas2pxahrzq
Cloudburst: Stateful Functions-as-a-Service
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Function-as-a-Service (FaaS) platforms and "serverless" cloud computing are becoming increasingly popular. Current FaaS offerings are targeted at stateless functions that do minimal I/O and communication. We argue that the benefits of serverless computing can be extended to a broader range of applications and algorithms. We present the design and implementation of Cloudburst, a stateful FaaS platform that provides familiar Python programming with low-latency mutable state and communication,
arXiv:2001.04592v2
fatcat:txil6f7nprcezlmc45qscw7voe
more »
... e maintaining the autoscaling benefits of serverless computing. Cloudburst accomplishes this by leveraging Anna, an autoscaling key-value store, for state sharing and overlay routing combined with mutable caches co-located with function executors for data locality. Performant cache consistency emerges as a key challenge in this architecture. To this end, Cloudburst provides a combination of lattice-encapsulated state and new definitions and protocols for distributed session consistency. Empirical results on benchmarks and diverse applications show that Cloudburst makes stateful functions practical, reducing the state-management overheads of current FaaS platforms by orders of magnitude while also improving the state of the art in serverless consistency.
Recensiones
2018
Archivo Español de Arqueología
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
M. ...
M. ...
doaj:5aa73e8648d74859b2c515e7cdafb7e4
fatcat:7vlcsvpwanfx5jpppckjhglxmq
Antioxidant activity of six Portuguese thyme species essential oils
2010
Flavour and Fragrance Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
× 0.25 mm i.d., fi lm thickness 0.25 μm; J&W Scientifi c, Rancho Cordova, CA, USA) and a DB-17HT fused-silica column (30 m × 0.25 mm i.d., fi lm thickness 0.15 μm; J&W Scientifi c). ...
The GC-MS unit consisted of a Autosystem XL (Perkin-Elmer) gas chromatograph, equipped with a DB-1 fused-silica column (30 m × 0.25 mm i.d., fi lm thickness 0.25 μm; J&W Scientifi c) and interfaced with ...
doi:10.1002/ffj.1972
fatcat:fbt7yxvbrvcevak7ddd3cs5j2m
Design Principles for Scaling Multi-core OLTP Under High Contention
2016
Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Faleiro et al. proposed techniques for lazy transaction evaluation [14] , and multi-version concurrency control [13] , that separate concurrency control and transaction execution. ...
doi:10.1145/2882903.2882958
dblp:conf/sigmod/RenFA16
fatcat:roaa2bqhybb4lidgkk5zaeplcy
Design Principles for Scaling Multi-core OLTP Under High Contention
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Faleiro et al. propose techniques for lazy transaction evaluation [13] and multi-version concurrency control [12] . ...
arXiv:1512.06168v3
fatcat:a5yfvxewlvf2plvptzxcqhysla
Antimicrobial activity, cytotoxicity and intracellular growth inhibition of Portuguese Thymus essential oils
2011
Revista Brasileira de Farmacognosia
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The recovery and maintenance of the microbial strains were as previously described (Faleiro et al., 2003; Faleiro et al., 2005; Hazzit et al. 2009 ). ...
x 0.25 mm i.d., film thickness 0.25 µm; J & W Scientific Inc., Rancho Cordova, CA, USA) and a DB-17HT fused-silica column [(50% phenyl)methylpolysiloxane, 30 m x 0.25 mm i.d., film thickness 0.15 µm; J ...
doi:10.1590/s0102-695x2011005000155
fatcat:2ouv3obnczeijm3nsijiwc77bm
Geo-distribution of actor-based services
2017
Proceedings of the ACM on Programming Languages
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Bernstein, Burckhardt, Bykov, Crooks, Faleiro, Kliot, Kumbhare, Rahman, Shah, Szekeres, Thelin ...
Fig. 11 . 11 Order processing throughput results.
107 : 4 : Bernstein, Burckhardt, Bykov, Crooks, Faleiro, Kliot, Kumbhare, Rahman, Shah, Szekeres, Thelin Fig. 2. ...
doi:10.1145/3133931
dblp:journals/pacmpl/BernsteinBBCFKK17
fatcat:redqe536w5epvhkeisn5jcgpgy
« Previous
Showing results 1 — 15 out of 869 results