Scheduling garbage collection in real-time systems

Kero, Martin; Aittamaa, Simon

doi:10.1145/1878961.1878971

Cited by 4 publications

(3 citation statements)

References 22 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For systems with dynamic memory allocation, heap usage can however be statically predicted (see e.g. [26], [27]), and it would be interesting to study how the character istics of input event stream (given for instance in terms of minimum and maximun inter-arrival times of atomic events) along with some information about dynamically created queries, can influence predictability and accuracy of static analysis as well as garbage collection [28], [29].…”

Section: Etc)mentioning

confidence: 99%

Towards a lightweight CEP engine for embedded systems

Pietrzak

Lindgren

Mäkitaavola

2012

IECON 2012 - 38th Annual Conference on IEEE Industrial Electronics Society

View full text Add to dashboard Cite

Industrial process automation systems are adopting event based communication. Pushing control loops towards low level devices implies a need for lightweight embedded devices that are able to recognize and to react to events. Atomic events however, such as a value read by an individual sensor exceeding certain value, do not separately suffice to capture scenarios where a reaction should occur to a sequence of low-level events matching certain pattern, rather than to a single atomic event.Therefore, it becomes desirable that resource-constrained low level devices are equipped with some, possibly lightweight, form of event filtering and processing. In this paper we propose to implement a lightweight complex event processing using the concurrent reactive objects (CRO) model. A core feature of the CRO model is its s ability to react to atomic events.Between the reactions, which basically are function executions, the system remains idle, and thus does not occupy the CPU and is energy-efficient. Additionally, CRO models can be executed in an efficient and predictable manner onto resource constrained platforms and offers low-overhead real-time scheduling through exploiting underlying interrupt hardware according to given time constraints.

show abstract

Section: Etc)mentioning

confidence: 99%

Towards a lightweight CEP engine for embedded systems

Pietrzak

Lindgren

Mäkitaavola

2012

IECON 2012 - 38th Annual Conference on IEEE Industrial Electronics Society

View full text Add to dashboard Cite

show abstract

“…In [15], Kero and Aittamaa presents a schedulability analysis, called garbage collection demand analysis, for a concurrent copying garbage collector in a reactive real-time system. Their garbage collector is restricted to run only during idle time, which enables them to rely on regular schedulability analysis of the task set to ensure (1).…”

Section: Conclusion and Further Workmentioning

confidence: 99%

Live Heap Space Bounds for Real-Time Systems

Kero

Pietrzak

Nordlander

2010

Programming Languages and Systems

Self Cite

View full text Add to dashboard Cite

Abstract. Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, where fragments of code execute concurrently and in orders determined by periodic and sporadic events. Schedulability analysis has shown that the programming model of real-time systems is not fundamentally in conflict with static predictability, but in contrast to accumulative properties like time, live heap space usage exhibits a very state-dependent behavior that renders direct application of schedulability analysis techniques unsuitable. In this paper we propose an analysis of live heap space upper bounds for real-time systems based on an accurate prediction of task execution orders. The key component of our analysis is the construction of a nondeterministic finite state machine capturing all task executions that are legal under given timing assumptions. By adding heap usage information inferred for each sequential task, our analysis finds an upper bound on the inter-task heap demands as the solution to an integer linear programming problem. Values so obtained are suitable inputs to other analyses depending on the size of a system's persistent state, such as running time prediction for a concurrent tracing garbage collector.

show abstract

“…Concurrency is becoming prevalent in more widely used Real-time embedded systems because of the multicores and larger heaps created by inexpensive RAM [15] [17] . Real-time ability in concurrent garbage collection [18] [19] [20] is one of the enhancements for using advanced languages in many of the time critical systems.…”

Section: Introductionmentioning

confidence: 99%

Development of Real-Time Capability in Application Virtual Machine using Concurrent Automatic Memory Management Algorithm

Charan¹,

Manjunath²

2016

IJITCS

View full text Add to dashboard Cite

Superior garbage collection algorithms are needed for deterministic runtime system in complex embedded systems to explore the benefits of contemporary and conquered application programming language. Android embedded operating system is greatly used world wide as a mobile platform without denying this fact it also attracted researchers and engineers to integrate in other embedded real-time systems. It exploits Java language for embedded application development and it can also enhance a certain real time capability with the adoption of real-time support at Dalvik Virtual Machine (DVM). Need for Real-time garbage collection algorithms in embedded systems is identified by achieving new insights into the existing garbage collection algorithms through finding blemishes in it. The space based technique is used in proposed new Real-time GC algorithm for execution runtime system and Real time Garbage Collection (GC) schedulability issue is also addressed. The intuitive performance analysis result demonstrates reduction in the response time and also describes the determinism characteristic of the real time applications using proposed solution.

show abstract

Scheduling garbage collection in real-time systems

Cited by 4 publications

References 22 publications

Towards a lightweight CEP engine for embedded systems

Towards a lightweight CEP engine for embedded systems

Live Heap Space Bounds for Real-Time Systems

Development of Real-Time Capability in Application Virtual Machine using Concurrent Automatic Memory Management Algorithm

Contact Info

Product

Resources

About