Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jia Zou 0002

dblp:08/4537-2 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2012
0000-0001-9849-0711ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 88% Parallel and multicore computing · 12%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Embedded and real-time systems
cyber-physical systems
0.112012
Distributed Real-Time Software for Cyber-Physical Systems · Proc. IEEE 2012
Embedded and real-time systems
real-time scheduling
0.112012
Distributed Real-Time Software for Cyber-Physical Systems · Proc. IEEE 2012
Parallel and multicore computing › parallel programming models › concurrent programming languages
coordination language
0.012012
Distributed Real-Time Software for Cyber-Physical Systems · Proc. IEEE 2012
Embedded and real-time systems
model-based design
0.012012
Distributed Real-Time Software for Cyber-Physical Systems · Proc. IEEE 2012

Methods — techniques the papers use, named apart from their topics

discrete-event modeling · 0.1
YearPublicationVenuePosition
2012 PtidyOS: A Lightweight Microkernel for Ptides Real-Time Systems
abstract
Ptides, a programming model for distributed real-time embedded systems, was proposed previously. In this work, we focus on a work flow that applies Ptides in a single-CPU environment using model-based design techniques. Our work flow starts with a programming environment where a real-time application is expressed as a Ptides model. The model captures both the functionality of the system and the desired timing of interactions with the environment. The Ptides simulator supports simulation of both of these aspects. Once the designer is satisfied with the design, a code generator can be used to glue together the application code with a real-time operating system called PtidyOS. To ensure the responsiveness of the real-time program, PtidyOS's scheduler combines Ptides semantics with the earliest-deadline-first policy. To minimize scheduling overhead associated with context switching, PtidyOS uses a single stack for event scheduling and execution, while still enabling event preemptions. We demonstrate the Ptides work flow through a motion control application. The automatically generated code running on PtidyOS is compared with a manual C implementation running on bare silicon. We discuss the trade offs in functionality and performance between these two implementations.
Jia Zou 0002, Slobodan Matic, Edward A. Lee
IEEE Real-Time and Embedded Technology and Applications Symposium1
2012 Distributed Real-Time Software for Cyber-Physical Systems
abstract
Real-time embedded software today is commonly built using programming abstractions with little or no temporal semantics. This paper addresses this problem by presenting a programming model called programming temporally integrated distributed embedded systems (PTIDES) that serves as a coordination language for model-based design of distributed real-time embedded systems. Specifically, the paper describes the principles of PTIDES, which leverages network time synchronization to provide a determinate distributed real-time semantics. We show how PTIDES can function as a coordination language, orchestrating components that may be designed and specified using different formalisms. We show the use of this environment in the design of interesting and practical cyber-physical systems, such as a power plant control system.
John C. Eidson, Edward A. Lee, Slobodan Matic, Sanjit A. Seshia, Jia Zou 0002
Proc. IEEE5
2009 PTIDES on flexible task graph: real-time embedded systembuilding from theory to practice
abstract
The Flexotask system claims to enable implementation of both real-time applications and real-time schedulers in a Java Virtual Machine using an actors-like model. The PTIDES model is an actors-like model that claims to deliver precise control over end-to-end latencies in a complex real-time system. The present work jointly investigates both claims by (1) implementing several PTIDES-based schedulers as Flexotask scheduler plugins, and (2) using the resulting system to implement a new reactive control program for a simulation of the JAviator. We present results from the realistic JAviator control application and also from synthetic benchmarks designed to shed light on the differences between the several PTIDES schedulers we implemented.
Jia Zou 0002, Joshua S. Auerbach, David F. Bacon, Edward A. Lee
LCTES1
2009 Execution Strategies for PTIDES, a Programming Model for Distributed Embedded Systems
abstract
We define a family of execution policies for a programming model called PTIDES (programming temporally integrated distributed embedded systems). A PTIDES application (factory automation, for example) is given as a discrete-event (DE) model of a distributed real-time system that includes sensors and actuators. The time stamps of DE events are bound to physical time at the sensors and actuators, turning the DE model into an executable specification of the system with explicit real-time constraints. This paper first defines a general execution strategy that conforms to the DE semantics, and then specializes this strategy to give practical, implementable and distributed policies. Our policies leverage network time synchronization to eliminate the need for null messages, allow independent events to be processed out of time stamp order, thus increasing concurrency and making more models feasible (w.r.t. real-time constraints), and improve fault isolation in distributed systems. The policies are given in terms of a safe to process predicate on events that depends on the time stamp of the events and the local notion of physical time. In a simple case we show how to statically check whether program execution satisfies timing constraints.
Jia Zou 0002, Slobodan Matic, Edward A. Lee, Thomas Huining Feng, Patricia Derler
IEEE Real-Time and Embedded Technology and Applications Symposium1