NDLI: Workload-Aware Partitioning for Maintaining Temporal Consistency upon Multiprocessor Platforms

Content Provider	IEEE Xplore Digital Library
Author	Jianjun Li Jian-Jia Chen Ming Xiong Guohui Li
Copyright Year	2011
Abstract	Deriving deadlines and periods of update transactions for maintaining timeliness and data freshness has long been recognized as an important problem in real-time database research. Despite years of active research, the state of the art only focuses on uniprocessor systems. In this paper, we take a first step of studying the workload-aware temporal consistency maintenance problem upon multiprocessor platforms. We consider the problem of how to partition a set of update transactions to $m \ge 2$ processors to maintain the temporal consistency of real-time data objects under earliest deadline first (EDF) scheduling, while minimizing the total workload on $m$ processors. Firstly, we only consider the feasibility aspect of the problem by proposing a polynomial time partitioning scheme, Temporal Consistency Partitioning (TCP), and formally showing that the resource augmentation bound of TCP is $({3 - \frac{1}{m}})$. Secondly, we address the partition problem globally by proposing a polynomial time heuristic, Density factor Balancing Fit (DBF), where density factor balancing plays a major role in producing workload-efficient partitionings. Finally, we evaluate the feasibility and workload performances of DBF versus other heuristics with comparable quality experimentally.
Starting Page	126
Ending Page	135
File Size	284913
Page Count	10
File Format	PDF
ISBN	9781457720000
ISSN	10528725
DOI	10.1109/RTSS.2011.19
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-11-29
Publisher Place	Austria
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Program processors Real time systems Processor scheduling Scheduling Partitioning algorithms Databases Algorithm design and analysis Multiprocessor Real-Time Databases Temporal Consistency Deadline and Period Partitioning
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Hardware and Architecture Software

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

An Empirical Comparison of Global, Partitioned, and Clustered Multiprocessor EDF Schedulers

Feasibility analysis of preemptive real-time systems upon heterogeneous multiprocessor platforms

Energy-Aware Scheduling for Frame-Based Tasks on Heterogeneous Multiprocessor Platforms

Workload-Efficient Deadline and Period Assignment for Maintaining Temporal Consistency under EDF

On the Scalability of Real-Time Scheduling Algorithms on Multicore Platforms: A Case Study

Mixed-Criticality Scheduling upon Varying-Speed Processors

RUN: Optimal Multiprocessor Real-Time Scheduling via Reduction to Uniprocessor

OUTSTANDING PAPER: Optimal and Adaptive Multiprocessor Real-Time Scheduling: The Quasi-Partitioning Approach

Generalized Tardiness Bounds for Global Multiprocessor Scheduling

Workload-Aware Partitioning for Maintaining Temporal Consistency upon Multiprocessor Platforms

Similar Documents

An Empirical Comparison of Global, Partitioned, and Clustered Multiprocessor EDF Schedulers

Feasibility analysis of preemptive real-time systems upon heterogeneous multiprocessor platforms

Energy-Aware Scheduling for Frame-Based Tasks on Heterogeneous Multiprocessor Platforms

Workload-Efficient Deadline and Period Assignment for Maintaining Temporal Consistency under EDF

On the Scalability of Real-Time Scheduling Algorithms on Multicore Platforms: A Case Study

Mixed-Criticality Scheduling upon Varying-Speed Processors

RUN: Optimal Multiprocessor Real-Time Scheduling via Reduction to Uniprocessor

OUTSTANDING PAPER: Optimal and Adaptive Multiprocessor Real-Time Scheduling: The Quasi-Partitioning Approach

Generalized Tardiness Bounds for Global Multiprocessor Scheduling

Workload-Aware Partitioning for Maintaining Temporal Consistency upon Multiprocessor Platforms