Partitioned scheduling for real-time tasks on multiprocessor embedded systems with programmable shared srams

Authors:
Che-Wei Chang;Jian-Jia Chen;Waqaas Munawar;Tei-Wei Kuo;Heiko Falk
Affiliations:
Academia Sinica & National Taiwan University, Taipei, Taiwan Roc;Karlsruhe Institute of Technology, Karlsruhe, Germany;Karlsruhe Institute of Technology, Karlsruhe, Germany;Academia Sinica & National Taiwan University, Taipei, Taiwan Roc;Ulm University, Ulm, Germany
Venue:
Proceedings of the tenth ACM international conference on Embedded software
Year:
2012

Citing 20
Cited 0

MediaBench: a tool for evaluating and synthesizing multimedia and communicatons systems

MICRO 30 Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
Approximation algorithms

Approximation algorithms
Adapting the SPEC 2000 benchmark suite for simulation-based computer architecture research

Workload characterization of emerging computer applications
NetBench: a benchmarking suite for network processors

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Scratchpad memory: design alternative for cache on-chip memory in embedded systems

Proceedings of the tenth international symposium on Hardware/software codesign
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT

FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
Shared Scratch-Pad Memory Space Management

ISQED '06 Proceedings of the 7th International Symposium on Quality Electronic Design
Hierarchical memory system design for a heterogeneous multi-core processor

Proceedings of the 2008 ACM symposium on Applied computing
Optimal static WCET-aware scratchpad allocation of program code

Proceedings of the 46th Annual Design Automation Conference
Variable Partitioning and Scheduling for MPSoC with Virtually Shared Scratch Pad Memory

Journal of Signal Processing Systems
Partitioning and allocation of scratch-pad memory for priority-based preemptive multi-task systems

Proceedings of the Conference on Design, Automation and Test in Europe
An approximation scheme for energy-efficient scheduling of real-time tasks in heterogeneous multiprocessor systems

Proceedings of the Conference on Design, Automation and Test in Europe
Light-weight communications on Intel's single-chip cloud computer processor

ACM SIGOPS Operating Systems Review
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Partitioned Real-time Scheduling on Heterogeneous Shared-Memory Multiprocessors

ECRTS '11 Proceedings of the 2011 23rd Euromicro Conference on Real-Time Systems
Optimal Data Allocation for Scratch-Pad Memory on Embedded Multi-core Systems

ICPP '11 Proceedings of the 2011 International Conference on Parallel Processing
Resource Augmentation Bounds for Approximate Demand Bound Functions

RTSS '11 Proceedings of the 2011 IEEE 32nd Real-Time Systems Symposium
Partitioning sporadic task systems upon memory-constrained multiprocessors

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work is motivated by the advance of multiprocessor system architecture, in which the allocation of tasks over heterogeneous memory modules has a significant impact on the task execution. By considering two different types of memory modules with different access latencies, this paper explores joint considerations of memory allocation and real-time task scheduling to minimize the maximum utilization of processors of the system. For implicit-deadline sporadic tasks, a two-phase algorithm is developed, where the first phase determines memory allocation to derive a lower bound of the maximum utilization, and the second phase adopts worst-fit partitioning to assign tasks. It is shown that the proposed algorithm leads to a tight (2-⁄2M+1)-approximation bound where M is the number of processors. The proposed algorithm is then evaluated with 82 realistic benchmarks from MRTC, MediaBench, UTDSP, NetBench and DSPstone, and extensive simulations are further conducted to analyze the proposed algorithm.