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

Alex Xiang Feng

dblp:10/2106 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 3 · 1 first-author

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 · 100%

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

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › real-time scheduling › hierarchical scheduling
compositional scheduling
0.012001
Towards Compositionality in Real-Time Resource Partitioning Based on Regularity Bounds · RTSS 2001
Embedded and real-time systems
real-time scheduling
0.012001
Towards Compositionality in Real-Time Resource Partitioning Based on Regularity Bounds · RTSS 2001

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

fixed-priority scheduling · 0.0dynamic priority scheduling · 0.0
YearPublicationVenuePosition
2005 Towards real-time enabled Microsoft Windows
abstract
Many computer scientists recognize the adverse relationship between Microsoft Windows, a general purpose operating system, which by design does not support Real Time, a specific purpose feature. However, the boundary between a general-purpose system and a special-purpose feature has begun to blur and Microsoft and its partners have kept working on adding real-time services to Windows. In this paper, we will describe existing real-time solutions for Windows, the on-going projects for the next release of Windows and future trends lead by hardware evolution.
Alex Xiang Feng
EMSOFT1
2002 Real-Time Virtual Resource: A Timely Abstraction for Embedded Systems
Aloysius K. Mok, Alex Xiang Feng
EMSOFT2
2001 Towards Compositionality in Real-Time Resource Partitioning Based on Regularity Bounds
abstract
In real-time resource partitioning, a shared resource is partitioned by a resource-level scheduler such that each partition is accessible only by an individual application task group. Tasks within the same task group are scheduled by an application-task-level scheduler that is specialized to the real-time requirements of the tasks in the group. An ideal goal for resource partitioning in real-time systems is to achieve a complete separation of concerns so that: (1) each task group may be executed as if it had access to its own dedicated resource, and (2) there is minimal interaction between the resource-level scheduler and the application-task-level scheduler. In [15], we introduced the notion of a real-time virtual resource which operates at a fraction of the rate of the shared physical resource and whose rate of operation varies with time but is bounded. In this paper we discuss an approach to bound the variation of the rate of operation of a real-time virtual resource by characterizing the rate variation from both temporal and supply dimensions and by expanding on the concept of regularity that was first introduced in [19]. For the case of regular resource partitioning, we show that the utilization bounds of both fixed-priority scheduling and dynamic-priority scheduling remain unchanged from those for dedicated resources. We determine the utilization bounds for the more general case of irregular partitioning. In particular, both types of partitions can be efficiently constructed by exploiting compositionality, properties vis-a-vis the regularity measure.
Aloysius K. Mok, Alex Xiang Feng
RTSS2