Ziad M. Kaakani
Honeywell
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Ziad M. Kaakani.
international symposium on object/component/service-oriented real-time distributed computing | 2006
Okehee Goh; Yann Hang Lee; Ziad M. Kaakani; Elliott H. Rachlin
We present a schedulable garbage collection for realtime applications in virtual machine environments. The design objective is to make the pause time caused by garbage collection operations controllable, and the invocation of garbage collection predictable. Thus, real-time applications can be schedulable along with garbage collection. We develop a prototype for a schedulable garbage collection in MONO CLI execution environment. A cost model of garbage collection is established based on measured WCET to predict the execution time and overhead of garbage collection operations. A scheduling algorithm of garbage collection and application tasks is presented to illustrate how the time and memory constraints of real-time systems can be met. The experiment result of the scheduling algorithm for a periodic task set on the prototype is included in the paper
embedded software | 2006
Okehee Goh; Yann Hang Lee; Ziad M. Kaakani
Persistence in applications saves a computation state that can be used to facilitate system recovery upon failures. As we begin to adopt virtual execution environments (VMs) for mission-critical real-time embedded applications, persistence service will become an essential part of VM to ensure high availability of the systems.In this paper, we focus in a schedulable persistence system in VMs and show a prototype persistence system constructed on CLI s open source platform, MONO. By employing object serialization, the system enables concurrent and preemptible persistence operation, i.e., the task in charge of persistence service runs concurrently with application tasks and is a target of real-time scheduling. Thus, the execution of application tasks can be interleaved with the operations of persistence service, and the task timeliness can be guaranteed as the pause time caused by persistence service is bounded. The experiment output on the prototyped system illustrates that persistence service is appropriate for realtime applications because of its controllable pause time and its optimized overhead.
Archive | 2005
Ziad M. Kaakani; Elliott H. Rachlin
Archive | 2005
Piyush Garyali; Ziad M. Kaakani; Keijo Manninen; Pratap Parashuram; Elliott H. Rachlin; Jethro F. Steinman; Vivek B. Varma
Archive | 1999
Ellen B. Hawkinson; Ziad M. Kaakani; Christian R. Thomas; James A. Weeldreyer
Archive | 2006
Ziad M. Kaakani; Vivek B. Varma
Archive | 2005
Ziad M. Kaakani; Pratap Parashuram; Elliott H. Rachlin; Jethro F. Steinman
Archive | 2001
Thomas A. Clarke; Ellen B. Hawkinson; Ziad M. Kaakani; Christian R. Thomas
Archive | 2006
Plyush Garyali; Ziad M. Kaakani; Vivek B. Varma
Virtual Machine Research and Technology Symposium | 2004
Okehee Goh; Yann-Hang Lee; Ziad M. Kaakani; Elliott H. Rachlin