NDLI: Establishing a tight bound on task interference in embedded system instruction caches

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

A vision for embedded software

A new method for compiling schizophrenic synchronous programs

A software development tool chain for a reconfigurable processor

Efficient longest executable path search for programs with complex flows and pipeline effects

The emerging power crisis in embedded processors: what can a poor compiler do?

Textiles and computing: background and opportunities for convergence

Algorithms for energy optimization using processor instructions

Establishing a tight bound on task interference in embedded system instruction caches

An empirical evaluation of high level transformations for embedded processors

Hardware compilation of sequential ada

Tailoring pipeline bypassing and functional unit mapping to application in clustered VLIW architectures

Application specific architectures: a recipe for fast, flexible and power efficient designs

A prototype network embedded in textile fabric

The performance and energy consumption of three embedded real-time operating systems

Storage allocation for embedded processors

Combined partitioning and data padding for scheduling multiple loop nests

Design space characterization for architecture/compiler co-exploration

A system-on-a-chip lock cache with task preemption support

Comparing power consumption of an SMT and a CMP DSP for mobile phone workloads

Patchable instruction ROM architecture

A novel approach to code analysis of digital signal processing systems

A compiler framework for mapping applications to a coarse-grained reconfigurable computer architecture

ShiftQ: a bufferred interconnect for custom loop accelerators

EDF scheduling using two-mode voltage-clock-scaling for hard real-time systems

Heterogeneous memory management for embedded systems

The very portable optimizer for digital signal processors

Pattern matching in reconfigurable logic for packet classification

Heads and tails: a variable-length instruction format supporting parallel fetch and decode

Energy-efficient instruction cache using page-based placement

Transparent data-memory organizations for digital signal processors

Design challenges using nanometer process technology (Invited Talk)

Computation offloading to save energy on handheld devices: a partition scheme

Personal, handheld, wireless: the future of digital technology (Panel session)

Establishing a tight bound on task interference in embedded system instruction caches

Content Provider	ACM Digital Library
Author	Dwyer, Harry Fernando, John
Abstract	To help meet the increasing performance demands of embedded applications, caches are utilized in some embedded systems. However, caches are problematic in real-time systems because they may cause a task's execution time to be uncertain, making a tight worst-case time-bound difficult to achieve. To simplify an execution time analysis, conservative assumptions are often made that may waste system capability or lead to an unnecessarily costly system. Efficient system design requires methods to tightly bound the effect of complex cache behavior.This paper presents methods that bound the effect of sharing an instruction cache among multiple tasks. If an application is interrupted, the intervening task often changes cache state - so the application experiences degraded performance when it resumes. Techniques that tightly bound this effect are the goal of this paper.Our methodology uses the concept of a "live cache frame," a cache frame that contains a block that is accessed in the future and without an intervening eviction. An intervening task delays the completion of an application both by its execution time and by evicting blocks from the application's live frames (LRU status changes have a secondary effect). Only these evictions cause future misses that would not otherwise occur. The maximum number of live frames coexistent during the execution of an application bound such misses, independent of intervening tasks. This is central to one method presented. We also present methods that exploit knowledge of the character of an intervening task to achieve a tighter bound when possible.
Starting Page	8
Ending Page	14
Page Count	7
File Format	PDF
ISBN	1581133995
DOI	10.1145/502217.502220
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2001-11-16
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

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

Instruction fetch energy reduction using loop caches for embedded applications with small tight loops

Instruction fetch energy reduction using loop caches for embedded applications with small tight loops

Optimal Code Placement of Embedded Software for Instruction Caches

Instruction Fetch Energy Reduction Using Loop Caches for Embedded Applications with Small Tight Loops (1999)

Instruction cache locking inside a binary rewriter

Energy-Efficient Design for Highly Associative Instruction Caches in Next-Generation Embedded Processors

Adaptive Performance Monitoring for Embedded Multicore Systems

Cluster miss prediction with prefetch on miss for embedded CPU instruction caches

Tuning Mechanism for Two-Level Cache Hierarchy Intended for Instruction Caches and Low Energy Consumption

Establishing a tight bound on task interference in embedded system instruction caches

Similar Documents

Instruction fetch energy reduction using loop caches for embedded applications with small tight loops

Instruction fetch energy reduction using loop caches for embedded applications with small tight loops

Optimal Code Placement of Embedded Software for Instruction Caches

Instruction Fetch Energy Reduction Using Loop Caches for Embedded Applications with Small Tight Loops (1999)

Instruction cache locking inside a binary rewriter

Energy-Efficient Design for Highly Associative Instruction Caches in Next-Generation Embedded Processors

Adaptive Performance Monitoring for Embedded Multicore Systems

Cluster miss prediction with prefetch on miss for embedded CPU instruction caches

Tuning Mechanism for Two-Level Cache Hierarchy Intended for Instruction Caches and Low Energy Consumption

Establishing a tight bound on task interference in embedded system instruction caches