Log in

Relevant bibliographies by topics / Resource bounds analysis

Contents

Journal articles

Academic literature on the topic 'Resource bounds analysis'

Author: Grafiati

Published: 28 June 2021

Last updated: 17 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Resource bounds analysis.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Resource bounds analysis"

1

Kahn, David M., and Jan Hoffmann. "Automatic amortized resource analysis with the Quantum physicist’s method." Proceedings of the ACM on Programming Languages 5, ICFP (2021): 1–29. http://dx.doi.org/10.1145/3473581.

Full text

Abstract:

We present a novel method for working with the physicist's method of amortized resource analysis, which we call the quantum physicist's method. These principles allow for more precise analyses of resources that are not monotonically consumed, like stack. This method takes its name from its two major features, worldviews and resource tunneling, which behave analogously to quantum superposition and quantum tunneling. We use the quantum physicist's method to extend the Automatic Amortized Resource Analysis (AARA) type system, enabling the derivation of resource bounds based on tree depth. In doin

APA, Harvard, Vancouver, ISO, and other styles

2

Navas, Jorge, Mario Méndez-Lojo, and Manuel V. Hermenegildo. "User-Definable Resource Usage Bounds Analysis for Java Bytecode." Electronic Notes in Theoretical Computer Science 253, no. 5 (2009): 65–82. http://dx.doi.org/10.1016/j.entcs.2009.11.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

SERRANO, A., P. LOPEZ-GARCIA, and M. V. HERMENEGILDO. "Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types." Theory and Practice of Logic Programming 14, no. 4-5 (2014): 739–54. http://dx.doi.org/10.1017/s147106841400057x.

Full text

Abstract:

AbstractWe present a novel general resource analysis for logic programs based on sized types. Sized types are representations that incorporate structural (shape) information and allow expressing both lower and upper bounds on the size of a set of terms and their subterms at any position and depth. They also allow relating the sizes of terms and subterms occurring at different argument positions in logic predicates. Using these sized types, the resource analysis can infer both lower and upper bounds on the resources used by all the procedures in a program as functions on input term (and subterm

APA, Harvard, Vancouver, ISO, and other styles

4

ALBERT, ELVIRA, MIQUEL BOFILL, CRISTINA BORRALLERAS, ENRIQUE MARTIN-MARTIN, and ALBERT RUBIO. "Resource Analysis driven by (Conditional) Termination Proofs." Theory and Practice of Logic Programming 19, no. 5-6 (2019): 722–39. http://dx.doi.org/10.1017/s1471068419000152.

Full text

Abstract:

AbstractWhen programs feature a complex control flow, existing techniques for resource analysis produce cost relation systems (CRS) whose cost functions retain the complex flow of the program and, consequently, might not be solvable into closed-form upper bounds. This paper presents a novel approach to resource analysis that is driven by the result of a termination analysis. The fundamental idea is that the termination proof encapsulates the flows of the program which are relevant for the cost computation so that, by driving the generation of the CRS using the termination proof, we produce a l

APA, Harvard, Vancouver, ISO, and other styles

5

Wu, Zeyang, Kameng Nip, and Qie He. "A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints." INFORMS Journal on Computing 33, no. 3 (2021): 1197–212. http://dx.doi.org/10.1287/ijoc.2020.1006.

Full text

Abstract:

The separable convex resource allocation problem with nested bound constraints aims to allocate B units of resources to n activities to minimize a separable convex cost function, with lower and upper bounds on the total amount of resources that can be consumed by nested subsets of activities. We develop a new combinatorial algorithm to solve this model exactly. Our algorithm is capable of solving instances with millions of activities in several minutes. The running time of our algorithm is at most 73% of the running time of the current best algorithm for benchmark instances with three classes

APA, Harvard, Vancouver, ISO, and other styles

6

Stefanov, Stefan M. "Solution of some convex separable resource allocation and production planning problems with bounds on the variables." Journal of Interdisciplinary Mathematics 13, no. 5 (2010): 541–69. http://dx.doi.org/10.1080/09720502.2010.10700719.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Albert, Elvira, Nikolaos Bezirgiannis, Frank de Boer, and Enrique Martin-Martin. "A Formal, Resource Consumption-Preserving Translation from Actors with Cooperative Scheduling to Haskell*." Fundamenta Informaticae 177, no. 3-4 (2020): 203–34. http://dx.doi.org/10.3233/fi-2020-1988.

Full text

Abstract:

We present a formal translation of a resource-aware extension of the Abstract Behavioral Specification (ABS) language to the functional language Haskell. ABS is an actor-based language tailored to the modeling of distributed systems. It combines asynchronous method calls with a suspend and resume mode of execution of the method invocations. To cater for the resulting cooperative scheduling of the method invocations of an actor, the translation exploits for the compilation of ABS methods Haskell functions with continuations. The main result of this article is a correctness proof of the translat

APA, Harvard, Vancouver, ISO, and other styles

8

Yoon, Man-Ki, Chang-Gun Lee, and Junghee Han. "Migrating from Per-Job Analysis to Per-Resource Analysis for Tighter Bounds of End-to-End Response Times." IEEE Transactions on Computers 59, no. 7 (2010): 933–42. http://dx.doi.org/10.1109/tc.2009.174.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Sajid, Mohammad, and Zahid Raza. "An Analytical Model for Resource Characterization and Parameter Estimation for DAG-Based Jobs for Homogeneous Systems." International Journal of Distributed Systems and Technologies 6, no. 1 (2015): 34–52. http://dx.doi.org/10.4018/ijdst.2015010103.

Full text

Abstract:

High Performance Computing (HPC) systems demand and consume a significant amount of resources (e.g. server, storage, electrical energy) resulting in high operational costs, reduced reliability, and sometimes leading to waste of scarce natural resources. On one hand, the most important issue for these systems is achieving high performance, while on the other hand, the rapidly increasing resource costs appeal to effectively predict the resource requirements to ensure efficient services in the most optimized manner. The resource requirement prediction for a job thus becomes important for both the

APA, Harvard, Vancouver, ISO, and other styles

10

Picano, Benedetta. "End-to-End Delay Bound for VR Services in 6G Terahertz Networks with Heterogeneous Traffic and Different Scheduling Policies." Mathematics 9, no. 14 (2021): 1638. http://dx.doi.org/10.3390/math9141638.

Full text

Abstract:

The emerging sixth-generation networks have to provide effective support to a wide plethora of novel disruptive heterogeneous applications. This paper models the probabilistic end-to-end delay bound for the virtual reality services in the presence of heterogeneous traffic flows by resorting to the stochastic network calculus principles and exploiting the martingale envelopes. The paper presents the network performance analysis under the assumption of different scheduling policies, considering both the earliest deadline first and the first-in-first-out queue discipline. Furthermore, differently

APA, Harvard, Vancouver, ISO, and other styles

More sources

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!