Award Abstract # 1439021
XPS: FULL:CCA: Extracting Scalable Parallelism by Relaxing the Contracts across the System Stack

NSF Org: CCF
Division of Computing and Communication Foundations
Recipient: THE PENNSYLVANIA STATE UNIVERSITY
Initial Amendment Date: August 6, 2014
Latest Amendment Date: August 6, 2014
Award Number: 1439021
Award Instrument: Standard Grant
Program Manager: Yuanyuan Yang
CCF
 Division of Computing and Communication Foundations
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: August 1, 2014
End Date: July 31, 2019 (Estimated)
Total Intended Award Amount: $850,000.00
Total Awarded Amount to Date: $850,000.00
Funds Obligated to Date: FY 2014 = $850,000.00
History of Investigator:
  • Mahmut Kandemir (Principal Investigator)
  • Chitaranjan Das (Co-Principal Investigator)
  • Anand Sivasubramaniam (Co-Principal Investigator)
Recipient Sponsored Research Office: Pennsylvania State Univ University Park
201 OLD MAIN
UNIVERSITY PARK
PA  US  16802-1503
(814)865-1372
Sponsor Congressional District: 15
Primary Place of Performance: Pennsylvania State University
354C IST Building
University Park
PA  US  16802-7000
Primary Place of Performance
Congressional District:
Unique Entity Identifier (UEI): NPM2J7MSCF61
Parent UEI:
NSF Program(s): Exploiting Parallel&Scalabilty
Primary Program Source: 01001415DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s):
Program Element Code(s): 828300
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

Technology scaling trends have made parallelism the de-facto standard for enhancing performance across a spectrum of computing environments spanning from high-end computing to embedded platforms. Yet, the software is woefully lagging in its ability to extract usable parallelism offered by the underlying hardware platforms primarily because of the compartmentalized contracts between the different layers of the system stack. Rigid contracts restrict the ability to leverage a rich design space of performance/power/correctness trade-offs within and across layers, that could be achievable by straying slightly from the contract. Although such a relaxed contract, referred to as approximate computing, has received attention recently, much of the work in this area is still compartmentalized and lacks a holistic cross-layer strategy to maximize parallelism, while adhering to power and correctness mandates.

Thus, the motivation of this project is to explore a holistic cross-layer approach to approximate computing spanning application, runtime system, compiler and hardware, thereby breaking the rigidity of the contracts between the layers, while still allowing them to cooperate for extracting the achievable parallelism across a diverse set of applications in both the high-end and mobile computing environments. Specifically, it involves application-level analysis of the scope of approximation for computation, data access and synchronization, designing efficient hardware mechanisms that could facilitate and benefit from approximation, and developing compiler and runtime support for expressing, exploiting and evaluating/validating the approximations in an architecture-aware fashion. This cross-layer approach to approximate computing is expected to play a crucial role towards achieving scalable parallelism for the next decade and beyond, with a potentially high impact to the computing industry. In addition, the tools and models developed from this project are disseminated in the public domain to a broader research community, and the PIs engage in a variety of outreach activities such as recruiting women and minority and involvement of local high school students through Penn State Eberly College's Exploration-U initiatives.

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

(Showing: 1 - 10 of 12)
Chun-Yi Liu, Jagadish B. Kotra, Myoungsoo Jung, Mahmut T. Kandemir, Chita R. Das "SOML Read: Rethinking the Read Operation Granularity of 3D NAND SSDs" ASPLOS , 2019
Chun-Yi Liu, Jagadish Kotra, Myoungsoo Jung, Mahmut T. Kandemir "PEN: Design and Evaluation of Partial-Erase for 3D NAND-Based High Density SSDs" FAST , 2018
Kaisheng Ma, Xueqing Li, Mahmut Taylan Kandemir, Jack Sampson, Vijaykrishnan Narayanan, Jinyang Li, Tongda Wu, Zhibo Wang, Yongpan Liu, Yuan Xie "NEOFog: Nonvolatility-Exploiting Optimizations for Fog Computing" ASPLOS , 2018
Myoungsoo Jung, Jie Zhang, Ahmed H. M. O. Abulila, Miryeong Kwon, Narges Shahidi, John Shalf, Nam Sung Kim, Mahmut T. Kandemir "SimpleSSD: Modeling Solid State Drives for Holistic System Simulation" Computer Architecture Letters 17(1): 37-41 , 2018
Myoungsoo Jung, Wonil Choi, Shuwen Gao, Ellis Herbert Wilson III, David Donofrio, John Shalf, Mahmut Taylan Kandemir "NANDFlashSim: High-Fidelity, Microarchitecture-Aware NAND Flash Memory Simulation." ACM TOS , v.12 (2) , 2016
Narayanan, Iyswarya and Ganesan, Aishwarya and Badam, Anirudh and Govindan, Sriram and Sharma, Bikash and Sivasubramaniam, Anand "Getting more performance with polymorphism from emerging memory technologies" 12th ACM International Conference on Systems and Storage , 2019 10.1145/3319647.3325826 Citation Details
Orhan Kislal, Mahmut Kandemir "Data access skipping for recursive partitioning methods" Computer Languages, Systems & Structures , 2018
Sanem Arslan, Haluk Rahmi Topcuoglu, Mahmut Taylan Kandemir, Oguz Tosun "Scheduling opportunities for asymmetrically reliable caches." IEEE TPDS , 2019
Sumitha George, Minli Julie Liao, Huaipan Jiang, Jagadish B. Kotra, Mahmut T. Kandemir, Jack Sampson, Vijaykrishnan Narayanan "MDACache: Caching for Multi-Dimensional-Access Memories" MICRO , 2018
Wonil Choi, Bhuvan Urgaonkar, Mahmut T. Kandemir, Myoungsoo Jung "Fair Resource Allocation in Consolidated Flash Systems" HotStorage , 2019
Wonil Choi, Myoungsoo Jung, Mahmut T. Kandemir, Chita R. Das "Parallelizing garbage collection with I/O to improve flash resource utilization" HPDC , 2018
(Showing: 1 - 10 of 12)

PROJECT OUTCOMES REPORT

Disclaimer

This Project Outcomes Report for the General Public is displayed verbatim as submitted by the Principal Investigator (PI) for this award. Any opinions, findings, and conclusions or recommendations expressed in this Report are those of the PI and do not necessarily reflect the views of the National Science Foundation; NSF has not approved or endorsed its content.

Approximate computing is a new computation paradigm built upon the observation that many application programs from different domains can accept less than full accurate results. Observing that many existing approximate computing approaches have targeted individual layers of the hardware-software stack in isolation, this project undertook a radically different approach, which is based on coordinating approximate computing across the entire hardware-software execution stack. 

In particular, it demonstrated that, integrated language, compiler, runtime and hardware strategies generate much better results than optimization techniques that are restricted to a single layer in the stack. In particular, the research found that a programming language that treats approximation as a first-class citizen and accompanying hardware enhancements are vital in providing  effective communication across different layers in the software stack, to strike the right balance between performance/energy benefits (which can be up to 2x compared to the full accurate execution) and quality (accuracy) of program output. 

Throughout this project, the PIs developed various software packages and have either put them in the public domain or are in the process of doing so. These packages are expected to be useful, not just in the context of research, but also in the context of teaching. In fact, the PIs have already used the select contents from this research material to enhance some of the courses they regularly teach at Penn State.

Apart from these research and teaching outcomes, the project helped 3 PhD and 1 MS students complete their thesis, and also helped with the training of another 3 other PhD students. The project also undertook several outreach activities, including one of the PIs taking part in a summer workshop at Penn State for high school teachers.  This workshop, called ?Computers and the Universe?, included two modules prepared and presented by the PI on computing and storage systems as well as software. The PIs were also involved in a summer workshop for high school girls. 

 


Last Modified: 11/07/2019
Modified by: Mahmut T Kandemir

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page