Stephen A. Edwards
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Stephen A. Edwards has a total of 76 co-authors. Here are the top co-authors by number of shared publications:
Martha A. Kim
Columbia University
4 shared publicationsNalini Vasudevan
Columbia University, New York, NY, USA
4 shared publications- Nalini Vasudevan
Department of Computer Science, Columbia University, New York, USA
4 shared publications Jia Zeng
Department of Computer Science, Columbia University, New York, NY 10027, USA
3 shared publications- John Hui
Columbia University, New York, USA
3 shared publications - Abelardo Pardo
University of South Australia
2 shared publications
Latest Publications
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1802-1814
Fast Flow-Sensitive C Program Partitioning via Iterative Value-Flow Refinement
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1802-1814
Open AccessFast Flow-Sensitive C Program Partitioning via Iterative Value-Flow Refinement
- Open Access
- 28 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 86-90
Automated Power Domain Insertion and Control in Dataflow Circuits
- 28 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 86-90
Open AccessAutomated Power Domain Insertion and Control in Dataflow Circuits
- Open Access
- 14 August 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 23 (5) , 1-30
The Sparse Synchronous Model on Real Hardware
We present the Sparse Synchronous model (SSM) of computation, which allows a programmer to specify software timing more precisely than the traditional “heartbeat” of mainstream operating systems or the synchronous languages. SSM is a mix of semantics inspired by discrete event simulators and the synchronous languages designed to operate in resource-constrained environments such as microcontrollers. SSM provides precise timing prescriptions, concurrency, and determinism. We implement SSM in SSML, a toy language along with a runtime system that includes a scheduler, memory manager, and an interface that works with a real-time operating system to keep the model synchronized with the real world. Experimentally, we find our implementation is able to perform jitter-free I/O in the 10s of kHz on a microcontroller.
- 14 August 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 23 (5) , 1-30
Open AccessThe Sparse Synchronous Model on Real Hardware
We present the Sparse Synchronous model (SSM) of computation, which allows a programmer to specify software timing more precisely than the traditional “heartbeat” of mainstream operating systems or the synchronous languages. SSM is a mix of semantics inspired by discrete event simulators and the synchronous languages designed to operate in resource-constrained environments such as microcontrollers. SSM provides precise timing prescriptions, concurrency, and determinism. We implement SSM in SSML, a toy language along with a runtime system that includes a scheduler, memory manager, and an interface that works with a real-time operating system to keep the model synchronized with the real world. Experimentally, we find our implementation is able to perform jitter-free I/O in the 10s of kHz on a microcontroller.
- Open Access
- 21 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 137-147
Timestamp Peripherals for Precise Real-Time Programming
On microcontrollers, timer devices provide high-precision timing, but that precision is lost when using high-level languages without suitable abstractions for temporal behavior. So, for timing-sensitive applications, programmers resort to low-level languages like C which lack expressiveness and safety guarantees. Other programmers use specialized precision-timing hardware which is expensive and difficult to obtain. In this work, we achieve sub-microsecond precision from a high-level real-time programming language on the RP2040, a cheap, widely available microcontroller. Our work takes advantage of the RP2040's Programmable I/O (PIO) devices, which are cycle-accurate coprocessors designed for implementing hardware protocols over the RP2040's GPIO pins. We use the PIO devices to implement timestamp peripherals, which are input capture and output compare devices. We use times-tamp peripherals to mediate I/O from programs written in Sslang, a real-time programming language with deterministic concurrency. We show that timestamp peripherals help Sslang programs achieve the precise timing behavior prescribed by Sslang's Sparse Synchronous Programming model.
- 21 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 137-147
Open AccessTimestamp Peripherals for Precise Real-Time Programming
On microcontrollers, timer devices provide high-precision timing, but that precision is lost when using high-level languages without suitable abstractions for temporal behavior. So, for timing-sensitive applications, programmers resort to low-level languages like C which lack expressiveness and safety guarantees. Other programmers use specialized precision-timing hardware which is expensive and difficult to obtain. In this work, we achieve sub-microsecond precision from a high-level real-time programming language on the RP2040, a cheap, widely available microcontroller. Our work takes advantage of the RP2040's Programmable I/O (PIO) devices, which are cycle-accurate coprocessors designed for implementing hardware protocols over the RP2040's GPIO pins. We use the PIO devices to implement timestamp peripherals, which are input capture and output compare devices. We use times-tamp peripherals to mediate I/O from programs written in Sslang, a real-time programming language with deterministic concurrency. We show that timestamp peripherals help Sslang programs achieve the precise timing behavior prescribed by Sslang's Sparse Synchronous Programming model.
- Open Access
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 361-366
Towards Sparse Synchronous Programming in Lua
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 361-366
Open AccessTowards Sparse Synchronous Programming in Lua
- Open Access
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 313-318
Logical Time for Reactive Software
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 313-318
Open AccessLogical Time for Reactive Software
- Open Access
- 11 February 2022
- Published by Association for Computing Machinery (ACM)
- p. 53
Synthesized Garbage Collection for FPGA Accelerators
Speed and ease of accelerator design is a growing need. High level programming languages have provided significant gains in the software world, but lag in the hardware realm. We present a hardware implementation of a garbage collector, which automates memory management, one of the major conveniences of modern software languages. Our garbage collector is integrated with a Haskell to hardware HLS flow. The collector runs concurrently with the application, using already-idle memory slots to do its work with little to no impact on performance. To achieve this, our collector exploits rapid synchronization that is straightforward in hardware but very difficult in software. With this synchronization, the collector is able to safely pop in and out of very fine pockets of idleness on a cycle by cycle, heap by heap basis. In most cases our collector incurred negligible overhead, and slowed the application only when the heaps were so tiny that the application was unable to proceed with its operation until the collector had freed more space. Our experiments further show that our concurrent collector performs best under an eager collection policy that collects garbage well-before the application exhausts the available memory. Although this eager strategy performs more collection operations than strictly necessary, the application never pauses and the collector operates entirely in the background.
- 11 February 2022
- Published by Association for Computing Machinery (ACM)
- p. 53
Open AccessSynthesized Garbage Collection for FPGA Accelerators
Speed and ease of accelerator design is a growing need. High level programming languages have provided significant gains in the software world, but lag in the hardware realm. We present a hardware implementation of a garbage collector, which automates memory management, one of the major conveniences of modern software languages. Our garbage collector is integrated with a Haskell to hardware HLS flow. The collector runs concurrently with the application, using already-idle memory slots to do its work with little to no impact on performance. To achieve this, our collector exploits rapid synchronization that is straightforward in hardware but very difficult in software. With this synchronization, the collector is able to safely pop in and out of very fine pockets of idleness on a cycle by cycle, heap by heap basis. In most cases our collector incurred negligible overhead, and slowed the application only when the heaps were so tiny that the application was unable to proceed with its operation until the collector had freed more space. Our experiments further show that our concurrent collector performs best under an eager collection policy that collects garbage well-before the application exhausts the available memory. Although this eager strategy performs more collection operations than strictly necessary, the application never pauses and the collector operates entirely in the background.
- 2 July 2019
- Published by Springer Nature
- p. 222-230
Further Experiences Teaching an FPGA-Based Embedded Systems Class
- 2 July 2019
- Published by Springer Nature
- p. 222-230
Further Experiences Teaching an FPGA-Based Embedded Systems Class
- 20 July 2018
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 240-253
On Determinism
- 20 July 2018
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 240-253
On Determinism
- Open Access
- 29 September 2017
- Published by Association for Computing Machinery (ACM)
- p. 175-184
Compositional dataflow circuits
- 29 September 2017
- Published by Association for Computing Machinery (ACM)
- p. 175-184
Open AccessCompositional dataflow circuits