Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Supporting Soft Real-Time Parallel Applications on Multicore Processors Cong Liu and James H. Anderson
 

Summary: Supporting Soft Real-Time Parallel Applications on Multicore Processors
Cong Liu and James H. Anderson
Department of Computer Science, University of North Carolina at Chapel Hill
Abstract
The prevalence of multicore processors has resulted in the
wider applicability of parallel programming models such as
OpenMP and MapReduce. A common goal of running paral-
lel applications implemented under such models is to guaran-
tee bounded response times while maximizing system utiliza-
tion. Unfortunately, little previous work has been done that
can provide such performance guarantees. In this paper, this
problem is addressed by applying soft real-time scheduling
analysis techniques. Analysis and conditions are presented
for guaranteeing bounded response times for parallel appli-
cations under global EDF multiprocessor scheduling.
1 Introduction
The growing prevalence of multicore platforms has resulted in
the wider applicability of parallel programming models such
as OpenMP [4] and MapReduce [6]. Such models can be ap-
plied to parallelize certain segments of programs, thus better

  

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

 

Collections: Computer Technologies and Information Sciences