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.
Filters
Towards formally verifiable resource bounds for real-time embedded systems
2006
ACM SIGBED Review
Preserved Fulltext
This paper describes ongoing work aimed at the construction of formal cost models and analyses that are capable of producing verifiable guarantees of resource usage (space, time and ultimately power consumption ...
) in the context of realtime embedded systems. ...
The EmBounded project (IST-2004-510255 of EU Framework VI), led by Dr Kevin Hammond, aims to research this problem. ...
doi:10.1145/1183088.1183093
fatcat:ojcxy3hksffrhfywvlrk5xky6e
Scalable Kernel Fusion for Memory-Bound GPU Applications
2014
SC14: International Conference for High Performance Computing, Networking, Storage and Analysis
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 paper also proposes a codeless performance upper-bound projection model to achieve effective fusions. ...
This paper introduces a problem definition and proposes a scalable method for searching the space of possible kernel fusions to identify optimal kernel fusions for large problems. ...
The objective function in Equation (1) is defined as the new kernel's projected runtime bound (in seconds) as follows T pro = ( N F l + M F lop(x) * Hal B * T hr ) * 10 −9 P M emBound , x ∈ S (10) V. ...
doi:10.1109/sc.2014.21
dblp:conf/sc/WahibM14
fatcat:ct23w7scs5awbjpabb4b3ksbcy
Performance upper bound analysis and optimization of SGEMM on Fermi and Kepler GPUs
2013
Proceedings of the 2013 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)
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.
In this paper, we present an approach to estimate GPU applications' performance upper bound based on algorithm analysis and assembly code level benchmarking. ...
According to our analysis, the nature of Fermi (Kepler) instruction set and the limited issue throughput of the schedulers are the main limitation factors for SGEMM to approach the theoretical peak performance ...
In this paper, we present an approach to project performance upper bound using algorithm analysis and assembly code level benchmarking. ...
doi:10.1109/cgo.2013.6494986
dblp:conf/cgo/LaiS13
fatcat:5lumigwq4zah5fr322vx6sptdm
A Proof-Carrying-Code Infrastructure for Resources
2009
2009 Fourth Latin-American Symposium on Dependable Computing
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.
This paper tackles the issue of increasing dependability of distributed systems in the presence of mobile code. ...
heap consumption and independently validate this certificate at the consumer side by checking the certificate. ...
ACKNOWLEDGEMENTS We would like to thank our colleagues in the MRG project, ...
doi:10.1109/ladc.2009.13
dblp:conf/ladc/LoidlMJB09
fatcat:bt3m5rvwmbcdhm5tw6zxuzwh7q
Certified Complexity (CerCo)
[chapter]
2014
Lecture Notes in Computer Science
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.
Some hope has been provided by the EmBounded project [11] , which compositionally compiles high-level code to a byte code that is executed by an interpreter with guarantees on the maximal execution time ...
The details on the proof techniques employed and the proof sketch can be found in the CerCo deliverables and papers [9] . ...
doi:10.1007/978-3-319-12466-7_1
fatcat:v7qsmewnarectofwkpjvyuwdbu
Towards an Implicit Characterization of NC k
[chapter]
2006
Lecture Notes in Computer Science
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 2009; you can also visit the original URL.
The file type is application/pdf.
Research supported by the joint french-portuguese project Theorie et langages de programmation pour les calculsà ressources bornées/Teorias e linguagens de programação para computações com recursos limitados ...
Special attention is put on the description of T 2 and T 3 and on the proof of T 2 ⊆ N C 2 ⊆ T 3 . Such a hierarchy yields a characterization of N C. ...
In an other context, such an approach has been established on the theoretical study of Hofmann [Hof99, Hof02] which found applications in the Embounded Project 1 . ...
doi:10.1007/11874683_14
fatcat:4lcospa725bmlbmfvxsok255ve
Hume box calculus: robust system development through software transformation
2010
Higher-Order and Symbolic Computation
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.
In this paper, we present an overview of the Hume box calculus and its applications in program development. ...
Furthermore, the "Hierarchical Hume" extension enables strong locality of the effects of program manipulation, as well as providing a principled encapsulation mechanism. ...
This work has been supported by the EU FP6 EmBounded project and the UK EPSRC Islay project (EP/F030592, EP/F030657, EP/F03072, and EP/F031017) "Adaptive Hardware Systems with Novel Algorithmic Design ...
doi:10.1007/s10990-011-9067-y
fatcat:fmpmiaspzjaafchjq4haeut4hu
'Central London under siege': Diaspora, 'race' and the right to the (global) city
2017
Sociological Review
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.
The authors critically engage with Henri Lefebvre's 'right to the city' as a way of explaining how the urban is not only the site but also, increasingly, a stake in urban protests. ...
ÔCentral London under siegeÕ: Diaspora, ÔraceÕ and the right to the (global) city ...
At 6pm the police follow strict instructions to disperse protestors: [É] Doing that protest there, everything started fine, it was again in Downing Street, and then the police started pushing for people ...
doi:10.1177/0038026117703251
fatcat:onef4uujqrcyrfnm7z3olon3xa
Amortised Memory Analysis Using the Depth of Data Structures
[chapter]
2009
Lecture Notes in Computer Science
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.
Constraints on these annotations in the type system ensure that the total potential assigned to the input is an upper bound on the total memory required to satisfy all allocations. ...
We will also present the extra steps that must be taken to construct a typing during the analysis. ...
Further work on the system could include enhancing the language (perhaps using the existing Hofmann-Jost extensions mentioned above), removing the need for users to provide the structure for type signatures ...
doi:10.1007/978-3-642-00590-9_14
fatcat:xqpno3rvefdrrjg4xe2ve2uxly
Relational semantics for effect-based program transformations with dynamic allocation
2007
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '07
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 2008; you can also visit the original URL.
The file type is application/pdf.
The function Vsum can even be typed as Thus will be (correctly) regarded as pure by our analysis. Unfortunately, the masking rule does not apply to the type of the pure computation Mmem. ...
Indeed, if it did, the impure M buf which has the same type as Mmem would be falsely given a pure typing. ...
It thus contains the main technical contribution of the paper. Definition 5 (logical relation). ...
doi:10.1145/1273920.1273932
dblp:conf/ppdp/BentonKBH07
fatcat:zoduxqdparg6xivocxf26h2hqm
Resource analyses for parallel and distributed coordination
2011
Concurrency and Computation
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.
Contributions made by the paper We start by motivating resource prediction for parallel/distributed systems (Section 2). ...
This paper synthesises progress in both areas to survey the state-of-the-art in resource analysis for parallel and distributed computing. ...
We also acknowledge the anonymous referees whose comments have significantly improved the paper. This ...
doi:10.1002/cpe.1898
fatcat:abmlmqopxraofkdqbvk5r575ya
Collected Size Semantics for Functional Programs over Lists
[chapter]
2011
Lecture Notes in Computer Science
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.
This work is part of the AHA project [17] which is sponsored by the Netherlands Organisation for Scientific Research (NWO) under grant nr. 612.063.511. ...
We focus on the connection between the rewriting rules and lower and upper bounds on the multivalued size functions, when the bounds are given by piecewise polynomials. ...
The EmBounded project aims to identify and certify resource-bounded code in Hume, a domain-specific high-level programming language for real-time embedded systems. ...
doi:10.1007/978-3-642-24452-0_7
fatcat:fxy72jrcbffxdhmb2z56wbfysy
Static determination of quantitative resource usage for higher-order programs
2010
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '10
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 2012; you can also visit the original URL.
The file type is application/pdf.
The bounds we infer depend on the sizes of the various inputs to a program. They thus expose the impact of specific inputs on the overall cost behaviour. ...
We use a type-based approach, exploiting linearity to allow inference, and place a new emphasis on the number of references to a data object. ...
Acknowledgements We would like to thank our colleagues Pedro Vasconcelos and Hugo Simões (both Universidade do Porto, Portugal) for their fruitful discussion of the rules and proofs, and the anonymous ...
doi:10.1145/1706299.1706327
dblp:conf/popl/JostHLH10
fatcat:e2rri6kg65eaxhik2lv4o3j4su
Exploiting Purely Functional Programming to Obtain Bounded Resource Behaviour: The Hume Approach
[chapter]
2006
Lecture Notes in Computer Science
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 2008; you can also visit the original URL.
The file type is application/pdf.
The purpose of the Hume language design is to explore the expressibility/costability spectrum in resource-constrained systems, such as real-time embedded or control systems. ...
The use of a strict, purely functional programming notation allows the construction of a strong cost model for expressions, which can then be embedded into a simple cost model for processes. ...
Acknowledgements This work has been generously supported by EU Framework VI grant IST-2004-510255 (EmBounded) and by EPSRC Grant EPC/0001346. ...
doi:10.1007/11894100_4
fatcat:eizvmibnjbbl7hwx4ozd6dnz7q
Low-Level Programming in Hume: An Exploration of the HW-Hume Level
[chapter]
Lecture Notes in Computer Science
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.
This paper describes the HW-Hume level of the novel Hume language. HW-Hume is the simplest subset of Hume that we have identified. ...
In this paper, we introduce HW-Hume, show some simple example programs, describe an eAEcient software implementation, and demonstrate how important properties can be exposed as part of an integrated formally-based ...
interpreter written in portable C; t humec gives corresponding times under the general Hume to C template-compiler we are constructing as part of the EmBounded project; and t HW gives times under the ...
doi:10.1007/978-3-540-74130-5_6
fatcat:5nkqt3vrybfyfgfjgqdxsl654u
« Previous
Showing results 1 — 15 out of 18 results