I2PC Events
I2PC Events
advanced search
view calendar
| week selector | S | M | T | W | T | F | S |
|---|---|---|---|---|---|---|---|
go to week of Apr 28, 2013![]() | 28 | 29 | 30 | 1 | 2 | 3 | 4 |
![]() | 5 | 6 | 7 | 8 | 9 | 10 | 11 |
go to week of May 12, 2013![]() | 12 | 13 | 14 | 15 | 16 | 17 | 18 |
![]() | 19 | 20 | 21 | 22 | 23 | 24 | 25 |
![]() | 26 | 27 | 28 | 29 | 30 | 31 | 1 |
Event Detail Information
Event Detail Information
I2PC Seminar Series - DeNovoND: Efficient Hardware Support for Disciplined Parallelism
Illinois-Intel Parallelism Center (I2PC) Distinguished Speaker Series
http://i2pc.cs.illinois.edu/
Thursday, March 7th, 4-5pm CST, Siebel Center 2405
=======================================================
DeNovoND: Efficient Hardware Support for Disciplined Parallelism
Hyojin Sung
University of Illinois
ABSTRACT: Recent work has shown that disciplined shared-memory
programming models that provide deterministic-by-default semantics can
simplify both parallel software and hardware. Specifically, the DeNovo
hardware system has shown that the software guarantees of such models
(e.g., data-race-freedom and explicit side-effects) can enable
simpler, higher performance, and more energy-efficient hardware than
the current state-of-the-art for deterministic programs. Many
applications, however, contain non-deterministic parts; e.g., using
lock synchronization. For commercial hardware to exploit the benefits
of DeNovo, it is therefore necessary to extend DeNovo to support
non-deterministic applications.
This paper proposes DeNovoND, a system that supports lock-based,
disciplined non-determinism, with the simplicity, performance, and
energy benefits of DeNovo. We use a combination of distributed
queue-based locks and access signatures to implement simple memory
consistency semantics for safe non-determinism, with a coherence
protocol that does not require transient states, invalidation traffic,
or directories, and does not incur false sharing. The resulting system
is simpler, shows comparable or better execution time, and has 33%
less network traffic on average (translating directly into energy
savings) relative to a state-of-the-art invalidation-based protocol
for 8 applications designed for lock synchronization.
BIO: Hyojin Sung is a Ph.D student in Computer Science at University
of Illinois, Urbana-Champaign. Her research interests are in parallel
computer architecture, compilers and programming, especially SW/HW
co-design based on parallel programming patterns. She earned her
undergraduate degrees in Literature and Computer Science at Seoul
National University in South Korea and worked for Samsung Electronics
as a research engineer for two years, before she obtained her M.S. in
Computer Science at UC San Diego in 2008 with her thesis on
parallelizing compilers.
=======================================================
The talk will be streamed live at this link:
* http://media.cs.illinois.edu/live/I2PClive.asx
Questions to the speaker for live response can be directed to our chat
moderator:
* http://i2pc.cs.illinois.edu/chat
A complete list of seminars (with archived copies of past talks) is
available here:
* http://i2pc.cs.illinois.edu/seminars.html







