NDLI: Computing maximum blocking times with explicit path analysis under non-local flow bounds

Please wait, while we are loading the content...

Exponentially timed SADF: compositional semantics, reductions, and analysis

Refinement calculus of reactive systems

Precise piecewise affine models from input-output data

Embedded software reliability for unreliable hardware

Multiple shooting, CEGAR-based falsification for hybrid systems

SiPTA: signal processing for trace-based anomaly detection

Blaming in component-based real-time systems

A general approach for expressing infeasibility in implicit path enumeration technique

Computing maximum blocking times with explicit path analysis under non-local flow bounds

Extending typical worst-case analysis using response-time dependencies to bound deadline misses

Energy efficient DVFS scheduling for mixed-criticality systems

p-YDS algorithm: an optimal extension of YDS algorithm to minimize expected energy for real-time jobs

Robust strategy synthesis for probabilistic systems applied to risk-limiting renewable-energy pricing

Deductive control synthesis for alternating-time logics

Infinite horizon safety controller synthesis through disjunctive polyhedral abstract interpretation

Synthesising optimal timing delays for timed I/O automata

Automated software testing of memory performance in embedded GPUs

On the existence of probe effect in multi-threaded embedded programs

Can we put concurrency back into redundant multithreading?

Schedulability analysis of global memory-predictable scheduling

Supporting read/write applications in embedded real-time systems via suspension-aware analysis

Task mapping in heterogeneous embedded systems for fast completion time

Contract-based integration of cyber-physical analyses

CPSGrader: synthesizing temporal logic testers for auto-grading an embedded systems laboratory

Real-time system support for hybrid structural simulation

Parallel many-core avionics systems

Real-time multi-core virtual machine scheduling in xen

EDF as an arbitration policy for wormhole-switched priority-preemptive NoCs: myth or fact?

Building high-performance smartphones via non-volatile memory: the swap approach

Computing maximum blocking times with explicit path analysis under non-local flow bounds

Content Provider	ACM Digital Library
Author	Marwedel, Peter Kleinsorge, Jan C.
Abstract	Worst-case time (WCET) analyses for single tasks are well established and their results ultimately serve the purpose of providing execution time parameters for schedulability analyses. Besides WCET analysis, an important problem is maximum blocking time (MBT) analysis which is essential in deferred preemption schedules for the selection of preemption points. Among the most pressing problems in this context is the need for good path analyses, which are a fundamental bottleneck for selecting these points. Current state of the art relies on ILP-based or severely constrained explicit path analyses, both of which are unsatisfactory in general. In this paper, we propose a general explicit path analysis to compute maximum blocking times, specifically for scheduling policies with deferred preemption. The proposal improves the current state of the art significantly for both WCET and MBT analysis, as it is efficient, accurate, easily extensible and computes path lengths between all program points, without imposing any artificial constraints, and under a general flow bound model, unmatched by other existing explicit path analyses, while significantly outperforming the ILP-based approach. To the best of the authors' knowledge, no explicit path analysis for MBT has been proposed yet.
Starting Page	1
Ending Page	10
Page Count	10
File Format	PDF
ISBN	9781450330527
DOI	10.1145/2656045.2656051
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-10-12
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Path analysis Static analysis Worst-case execution time
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in