Nalini Vasudevan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Nalini Vasudevan has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Stephen A. Edwards
Columbia University, New York, USA
4 shared publications - Julian Dolby
IBM Research T.J. Watson Research Center Yorktown Heights NY USA
1 shared publication - Olivier Tardieu
IBM Research - Thomas J. Watson Research Center, Yorktown Heights, USA
1 shared publication - Olivier Tardieu
INRIA, Sophia Antipolis, France
1 shared publication
Latest Publications
- 26 June 2010
- Published by Springer Nature
- p. 121-146
Compiling SHIM
- Open Access
- 1 January 2009
- Published by Springer Nature
- p. 48-62
Compile-Time Analysis and Specialization of Clocks in Concurrent Programs
- 1 January 2009
- Published by Springer Nature
- p. 48-62
Open AccessCompile-Time Analysis and Specialization of Clocks in Concurrent Programs
- 1 June 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 49-58
Static Deadlock Detection for the SHIM Concurrent Language
Concurrent programming languages are becoming mandatory with the advent of multi-core processors. Two major concerns in any concurrent program are data races and deadlocks. Each are potentially subtle bugs that can be caused by non-deterministic scheduling choices in most concurrent formalisms. As an alternative, the SHIM concurrent language guarantees the absence of data races by eschewing shared memory, but a SHIM program may still deadlock if a program violates a communication protocol. We present a model-checking-based static deadlock detection technique for the SHIM language. Although SHIM is asynchronous, its semantics allow us to model it synchronously without losing precision, greatly reducing the state space that must be explored. This plus the obvious division between control and data in SHIM programs makes it easy to construct concise abstractions. Experimentally, we find our procedure runs in only a few seconds for modest-sized programs, making it practical to use as part of a compilation chain.
- 1 June 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 49-58
Static Deadlock Detection for the SHIM Concurrent Language
Concurrent programming languages are becoming mandatory with the advent of multi-core processors. Two major concerns in any concurrent program are data races and deadlocks. Each are potentially subtle bugs that can be caused by non-deterministic scheduling choices in most concurrent formalisms. As an alternative, the SHIM concurrent language guarantees the absence of data races by eschewing shared memory, but a SHIM program may still deadlock if a program violates a communication protocol. We present a model-checking-based static deadlock detection technique for the SHIM language. Although SHIM is asynchronous, its semantics allow us to model it synchronously without losing precision, greatly reducing the state space that must be explored. This plus the obvious division between control and data in SHIM programs makes it easy to construct concise abstractions. Experimentally, we find our procedure runs in only a few seconds for modest-sized programs, making it practical to use as part of a compilation chain.
- 1 March 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15301591,p. 1498-1503
Programming Shared Memory Multiprocessors with Deterministic Message-Passing Concurrency: Compiling SHIM to Pthreads
Multicore shared-memory architectures are becoming prevalent and bring many programming challenges. Among the biggest are data races: accesses to shared resources that make a program's behavior depend on scheduling decisions beyond its control. To eliminate such races, the SHIM concurrent programming language adopts deterministic message passing as it sole communication mechanism. We demonstrate such language restrictions are practical by presenting a SHIM to C-plus-Pthreads compiler that can produce efficient code for shared-memory multiprocessors. We present a parallel JPEG decoder and FFT exhibiting 3.05 and 3.3times speedups on a four-core processor.
- 1 March 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15301591,p. 1498-1503
Programming Shared Memory Multiprocessors with Deterministic Message-Passing Concurrency: Compiling SHIM to Pthreads
Multicore shared-memory architectures are becoming prevalent and bring many programming challenges. Among the biggest are data races: accesses to shared resources that make a program's behavior depend on scheduling decisions beyond its control. To eliminate such races, the SHIM concurrent programming language adopts deterministic message passing as it sole communication mechanism. We demonstrate such language restrictions are practical by presenting a SHIM to C-plus-Pthreads compiler that can produce efficient code for shared-memory multiprocessors. We present a parallel JPEG decoder and FFT exhibiting 3.05 and 3.3times speedups on a four-core processor.