ACM Home Page
Please provide us with feedback. Feedback
Time-predictable memory arbitration for a Java chip-multiprocessor
Full text PdfPdf (240 KB)
Source ACM International Conference Proceeding Series; Vol. 343 archive
Proceedings of the 6th international workshop on Java technologies for real-time and embedded systems table of contents
Santa Clara, California
SESSION: Application analysis table of contents
Pages 115-122  
Year of Publication: 2008
ISBN:978-1-60558-337-2
Author
Christof Pitter  Vienna University of Technology, Austria
Sponsors
ACM : Assoc. for Computing Machinery
: Sun Microsystems, Inc.
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 32,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1434790.1434808
What is a DOI?

ABSTRACT

In this paper, we propose an approach to calculate worst-case execution times (WCET) of tasks running on a homogeneous Java multiprocessor. These processors access a shared main memory. Hence, the tasks running on different CPUs may influence the execution times of each other. Therefore, we implemented a time division multiple access arbiter that divides the memory access time into equal time slots, one time slot for each CPU. This memory arbitration allows calculating upper bounds for the execution time of Java bytecodes depending on the number of CPUs, the size of the time slot, and the memory access time. A WCET analysis tool can utilize these results and generate temporal, upper bounds for application tasks. We further explore how the size of the time slot and the number of CPUs in the system influence the WCET results. Furthermore, a real-world application task is used to compare the analyzed results with measured execution times. This paper describes the timing analysis of a time-predictable Java multiprocessor with shared memory.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
A. Ermedahl and J. Engblom. Execution time analysis for embedded real-time systems. pages 35.1--35.17. Chapman & Hall/CRC - Taylor and Francis Group, August 2007.
 
3
 
4
M. Joseph and P. K. Pandya. Finding response times in a real-time system. Comput. J, 29(5):390--395, 1986.
 
5
6
 
7
8
 
9
C. Pitter and M. Schoeberl. Time predictable CPU and DMA shared memory access. In International Conference on Field-Programmable Logic and its Applications (FPL 2007), Amsterdam, Netherlands, August 2007.
 
10
C. Pitter and M. Schoeberl. Performance Evaluation of a Java Chip-Multiprocessor. In Proceedings of the IEEE Third Symposium on Industrial Embedded Systems (SIES 2008), Montpellier, France, June 2008.
 
11
F. Poletti, D. Bertozzi, L. Benini, and A. Bogliolo. Performance Analysis of Arbitration Policies for SoC Communication Architectures. Design Automation for Embedded Systems, 8:189--210(22), 200306/09.
 
12
 
13
 
14
M. Schoeberl. A time predictable instruction cache for a Java processor. In On the Move to Meaningful Internet Systems 2004: Workshop on Java Technologies for Real-Time and Embedded Systems (JTRES 2004), volume 3292 of LNCS, pages 371--382, Agia Napa, Cyprus, October 2004. Springer.
 
15
M. Schoeberl. JOP: A Java Optimized Processor for Embedded Real-Time Systems. PhD thesis, Vienna University of Technology, 2005.
 
16
M. Schoeberl. SimpCon - a simple and efficient SoC interconnect. In Proceedings of the 15th Austrian Workhop on Microelectronics, Austrochip 2007, Graz, Austria, October 2007.
 
17
18
 
19
20
 
21