Yue Yu
Illinois Institute of Technology

Abstract

Open, distributed, real-time, and embedded (ODRE) applications often involve different types of timing constraints and face trade-offs between timeliness and other resource consumptions. These systems' safety depends not only on the correctness of delivered computation but also on the satisfaction of specified timing constraints. That is, any design effort for optimizing sparse resource consumption for embedded applications must not compromise the satisfaction of timing constraints. Therefore, understanding the semantics of a given set of constraints and its satisfaction feasibility is critical in developing robust ODRE systems.

Motivated by previous work in the areas of modeling and monitoring of timing constraints, optimizing quality of service under resource constraints, and coordination models and languages for ODRE systems, our researches extend existing theories on timing constraint modeling and analysis to be applicable to more realistic ODRE systems. We propose metrics to quantify timing constraint satisfactions which are utilized to guide the designs of such systems. We also provide algebraic abstractions of different timing constraint types to facilitate specifications and verifications of ODRE systems.

Bio

Yue Yu received the B.S. degree in computer software from Tsinghua University, Beijing, China, in 2005. He is currently a Ph.D. candidate in the Department of Computer Science at Illinois Institute of Technology. As a Ph.D. student, he visited Computer Science Laboratory at SRI International, and Key Laboratory of Computer System and Architecture at Institute of Computing Technology of Chinese Academy of Sciences in the summer of 2007 and 2009, respectively. His research interests include real-time embedded systems and coordination model for distributed systems.