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.

Hung-Yang Chang

dblp:10/524 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
1since 2021 · last 2023
0000-0001-9231-5613ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 3 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 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
3 papers
Distributed systems · 55% Embedded and real-time systems · 45%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
distributed scheduling
0.021986
Distributed Scheduling under Deadline Constraints: A Comparison of Sender-Initiated and Receiver-Initiated Approaches · RTSS 1986
Priority in Distributed Systems · RTSS 1985
Operating systems › distributed systems
distributed operating system
0.011989
Experience with Charlotte: Simplicity and Function in a Distributed Operating System · IEEE Trans. Software Eng. 1989
Embedded and real-time systems › real-time scheduling
deadline-aware scheduling
0.011986
Distributed Scheduling under Deadline Constraints: A Comparison of Sender-Initiated and Receiver-Initiated Approaches · RTSS 1986
Embedded and real-time systems › real-time scheduling › priority scheduling
priority assignment
0.011985
Priority in Distributed Systems · RTSS 1985
Distributed systems › distributed programming
distributed programming languages
0.011989
Experience with Charlotte: Simplicity and Function in a Distributed Operating System · IEEE Trans. Software Eng. 1989

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

multitask kernel · 0.0finite state machine · 0.0
YearPublicationVenuePosition
2023 High-Throughput Edge Inference for BERT Models via Neural Architecture Search and Pipeline
abstract
There has been growing interest in improving the BERT inference throughput on resource-constrained edge devices for a satisfactory user experience. One methodology is to employ heterogeneous computing, which utilizes multiple processing elements to accelerate inference. Another methodology is to deploy Neural Architecture Search (NAS) to find optimal solutions in accuracy-throughput design space. In this paper, for the first time, we incorporate NAS with pipelining for BERT models. We show that performing NAS with pipelining achieves on average 53% higher throughput, compared to NAS with a homogeneous system.
Hung-Yang Chang, Seyyed Hasan Mozafari, James J. Clark, Brett H. Meyer, Warren J. Gross
ACM Great Lakes Symposium on VLSI1
2017 StressHacker: Towards Practical Stress Monitoring in the Wild with Smartwatches
Tian Hao, Kimberly N. Walter, Marion J. Ball, Hung-Yang Chang, Si Sun
AMIA4
1989 Experience with Charlotte: Simplicity and Function in a Distributed Operating System
abstract
A retrospective view is presented of the Charlotte distributed operating system, a testbed for developing techniques and tools to solve computation-intensive problems with large-grain parallelism. The final version of Charlotte runs on the Crystal multicomputer, a collection of VAX-11/750 computers connected by a local area network. The kernel/process interface is unique in its support for symmetric, bidirectional communication paths (called links), and synchronous nonblocking communications. Several lessons were learned in implementing Charlotte. Links have proven to be a useful abstraction, but the primitives do not seem to be at quite the right level of abstraction. The implementation uses finite-state machines and a multitask kernel, both of which work well. It also maintains absolute distributed information which is more expensive that using hints. The development of high-level tools, particularly the Lynx distributed programming language, has simplified the use of kernal primitives and helps to manage concurrency at the process level.>
Raphael A. Finkel, Michael L. Scott, Yeshayahu Artsy, Hung-Yang Chang
IEEE Trans. Software Eng.4
1986 Distributed Scheduling under Deadline Constraints: A Comparison of Sender-Initiated and Receiver-Initiated Approaches
Hung-Yang Chang, Miron Livny
RTSS1
1985 Priority in Distributed Systems
Hung-Yang Chang, Miron Livny
RTSS1