Fast paths in concurrent programs

Wen Xu, Sanjeev Kumar, Kai Li

Research output: Contribution to journalConference articlepeer-review

3 Scopus citations


Compiling concurrent programs to run on a sequential processor presents a difficult tradeoff between execution time and size of generated code. On one hand, the process-based approach to compilation generates reasonable sized code but incurs significant execution overhead due to concurrency. On the other hand, the automata-based approach incurs a much smaller execution overhead but can result in code that is several orders of magnitude larger. This paper proposes a way of combining the two approaches so that the performance of the automata-based approach can be achieved without suffering the code size increase due to it. The key insight is that the best of the two approaches can be achieved by using symbolic execution (similar to the automata-based approach) to generate code for the commonly executed paths (referred to as fast paths) and using the process-based approach to generate code for the rest of the program. We demonstrate the effectiveness of this approach by implementing our techniques in the ESP compiler and applying them to a set of filter programs and to VMMC network firmware.

Original languageEnglish (US)
Pages (from-to)189-200
Number of pages12
JournalParallel Architectures and Compilation Techniques - Conference Proceedings, PACT
StatePublished - 2004
EventProceedings - 13th International Conference on Parallel Architectures and Compilation Techniques (PACT 2004) - Antibes Juan-les-Pins, France
Duration: Sep 29 2004Oct 3 2004

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture


Dive into the research topics of 'Fast paths in concurrent programs'. Together they form a unique fingerprint.

Cite this