The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Grendler London Crowds in the Reign of Charles II, by Tim Harris. New York, Cambridge University Press, 1987. xiv, 264 pp. $42.50 U.S. ... Harris insists (p. 155) that the tories were strong in London because they, like the whigs, exploited the fears of popery and tyranny. ...doi:10.3138/cjh.23.2.261 fatcat:lwgin2wyonfwfgezyuk5v6bvtm
done in Lyon by Harry Halpin and Alexandre Monnin in November 2010, edited for publication and published with permission of Tim Berners-Lee. ... Harry Halpin: Wasn't it controversial that when the Web was first starting that everything could be named with a URI? Tim Berners-Lee: At the IETF 7 certainly there was resistance. ...doi:10.1002/9781118700143.ch12 fatcat:fau6hblht5cz5fuz2r2jv3xyg4
D Tim Harris is group leader in Molecular Biology at Celltech Ltd., Slough. of Molecular Biology. Editor-in-chief John D. Baxter. Mary Ann Liebert. 4/yr. $120 US; elsewhere $136 (surface), $152 (air). ...doi:10.1038/305479b0 fatcat:wvjk3osp2rgdzoulwsxxfyzrhe
Tim Harris Harris Vectors: A Survey of Molecular Cloning Vectors and Their Uses. Edited by Raymond L. Rodriguez and David T. Denhardt. Butterworths:1988. Pp.578. £45,$54.95. ... Tim Harris is Head of Molecular Biology at Celltech Ltd, 216 Bath Road, Slough SLJ 4EN, UK. Invisible Frontiers: The Race to Synthesize a Human Gene, by StephenS. Hall, is now available in Britain. ...doi:10.1038/332318b0 fatcat:kzeydfx2izc3nbbcd5vfm7cndm
Author Tim Tingle is a member of the Choctaw Nation of Oklahoma, and illustrator Jeanne Rorex Bridges is of Cherokee ancestry. ...doi:10.18251/ijme.v9i1.50 fatcat:a527mg77pzf6dclklauvfiszxi
We prove that an abstract oval is an abstract conic if and only if all of its involutions are regular and all of its secant lines are Pascalian. In doing so, we provide a new characterisation of the rank 1 projective general linear groups over arbitrary fields.doi:10.1515/jgth-2018-0028 fatcat:ou6dpnlvtna4dle34mrljuboma
Tim Harris is in the Division of Molecular Biology, Celltech Ltd, 250 Bath Road, Slough, SL/ 4DY, UK. ... Persistently puzzling prions from Tim Harris MANY features of scrapie -a degenerative neurological disease of sheep and goatsincluding pathological similarities to the human degenerative diseases kuru ...doi:10.1038/315275a0 pmid:3923360 fatcat:ulwxvh5wm5c2jh5jxu5yq4hpr4
ACM SIGACT News
This article is about three trends in computer hardware, and some of the challenges and opportunities that I think they provide for the distributed computing community. A common theme in all of these trends is that hardware is moving away from assumptions that have often been made about the relative performance of different operations (e.g., computation versus network communication), the reliability of operations (e.g., that memory accesses are reliable, but network communication is not), anddoi:10.1145/2789149.2789165 fatcat:77jnr3wpkrcctegvqqg24xnyhy
more »... en some of the basic properties of the system (e.g., that the contents of main memory are lost on power failure). Section 1 introduces "rack-scale" systems and the kinds of properties likely in their interconnect networks. Section 2 describes challenges in systems with shared physical memory but without hardware cache coherence. Section 3 discusses nonvolatile byte-addressable memory. The article is based in part on my talk at the ACM PODC 2014 event in celebration of Maurice Herlihy's sixtieth birthday.
The common wisdom is that distributed transactions do not scale. But what if distributed transactions could be made scalable using the next generation of networks and a redesign of distributed databases? There would no longer be a need for developers to worry about co-partitioning schemes to achieve decent performance. Application development would become easier as data placement would no longer determine how scalable an application is. Hardware provisioning would be simplified as the systemdoi:10.14778/3055330.3055335 fatcat:v3yfkdn2fbf5nhjvpq5i6znf44
more »... inistrator can expect a linear scaleout when adding more machines rather than some complex sub-linear function, which is highly application specific. In this paper, we present the design of our novel scalable database system NAM-DB and show that distributed transactions with the very common Snapshot Isolation guarantee can indeed scale using the next generation of RDMA-enabled network technology without any inherent bottlenecks. Our experiments with the TPC-C benchmark show that our system scales linearly to over 6.5 million new-order (14.5 million total) distributed transactions per second on 56 machines.
This paper introduces AC, a set of language constructs for composable asynchronous IO in native languages such as C/C++. Unlike traditional synchronous IO interfaces, AC lets a thread issue multiple IO requests so that they can be serviced concurrently, and so that long-latency operations can be overlapped with computation. Unlike traditional asynchronous IO interfaces, AC retains a sequential style of programming without requiring code to use multiple threads, and without requiring code to bedoi:10.1145/2076021.2048134 fatcat:d54pmciprzhazj324moemsoq4y
more »... stack-ripped" into chains of callbacks. AC provides an async statement to identify opportunities for IO operations to be issued concurrently, a do..finish block that waits until any enclosed async work is complete, and a cancel statement that requests cancellation of unfinished IO within an enclosing do..finish. We give an operational semantics for a core language. We describe and evaluate implementations that are integrated with message passing on the Barrelfish research OS, and integrated with asynchronous file and network IO on Microsoft Windows. We show that AC offers comparable performance to existing C/C++ interfaces for asynchronous IO, while providing a simpler programming model.
Harris, Johnson Hsieh, Michael Isard, CC '09 (to appear) "Composable memory transactions", Tim Harris, Simon Marlow, Simon Peyton Jones, Maurice Herlihy. ... PPoPP '05 "Semantics of Transactional Memory and Automatic Mutual Exclusion", Martín Abadi, Andrew Birrell, Tim Harris, Michael Isard. ...doi:10.1145/1594834.1480883 fatcat:pkun3e5aqzfq7hznu3e4zsuiu4
The Generalized Eigenvalue Problem (GEVP) has been used extensively in the past in order to reliably extract energy levels from time-dependent Euclidean correlators calculated in Lattice QCD. We propose a formulation of the GEVP in frequency space. Our approach consists of applying the model-independent Backus-Gilbert method to a set of Euclidean two-point functions with common quantum numbers. A GEVP analysis in frequency space is then applied to a matrix of estimators that allows us, amongarXiv:1611.02499v1 fatcat:3xvkmdrszvakliigndndai62ie
more »... er things, to obtain particular linear combinations of the initial set of operators that optimally overlap to different local regions in frequency. We apply this method to lattice data from NRQCD. This approach can be interesting both for vacuum physics as well as for finite-temperature problems.
This paper introduces a new abstraction to accelerate the readbarriers and write-barriers used by language runtime systems. We exploit the fact that, dynamically, many barrier executions perform checks but no real work-e.g., in generational garbage collection (GC), frequent checks are needed to detect the creation of intergenerational references, even though such references occur rarely in many workloads. We introduce a form of dynamic filtering that identifies redundant checks by (i) recordingdoi:10.1145/1735971.1736027 fatcat:rwazndcpjzc47oqav25jivtxga
more »... checks that have recently been executed, and (ii) detecting when a barrier is repeating one of these checks. We show how this technique can be applied to a variety of algorithms for GC, transactional memory, and language-based security. By supporting dynamic filtering in the instruction set, we show that the fast-paths of these barriers can be streamlined, reducing the impact on the quality of surrounding code. We show how we accelerate the barriers used for generational GC and transactional memory in the Bartok research compiler. With a 2048-entry filter, dynamic filtering eliminates almost all the overhead of the GC write-barriers. Dynamic filtering eliminates around half the overhead of STM over a non-synchronized baseline-even when used with an STM that is already designed for low overhead, and which employs static analyses to avoid redundant operations.
Preventing duplicate evaluation The existing implementation of thunk evaluation in GHC is designed to be thread-safe (Harris et al. 2005) . ... Ennals 2004 ) has suggested that this is true in practice, and earlier work on storage management in other languages has shown static allocation sites to be a predictor of properties of the data's usage (Harris ...doi:10.1145/1291220.1291192 fatcat:2efqcymesza5rcip4kwk3fthz4
Kuiper et al., 2012; Rosen et al., 2016; Harries et al., 2017) . ... Further major developments include the implementation of molecular transport and hydrodynamics , radiation pressure and sink particles (Harries, 2015; Harries et al., 2017) . ... (2019) Synthetic observations of self-gravitating discs around massive YSOs Dust continuum models Harries et al. (2000) Dust scattering in Wolf-Rayet/O-star binary WR137. ...arXiv:1903.06672v1 fatcat:ixvzbjuocbdfzmobopwczwxhjm
« Previous Showing results 1 — 15 out of 45,951 results