Award Abstract # 0746643
CAREER: Behavior-Based Coordination for Open Distributed Real-Time and Embedded Computing

NSF Org: CNS
Division Of Computer and Network Systems
Recipient: ILLINOIS INSTITUTE OF TECHNOLOGY
Initial Amendment Date: January 22, 2008
Latest Amendment Date: May 31, 2013
Award Number: 0746643
Award Instrument: Continuing Grant
Program Manager: Marilyn McClure
mmcclure@nsf.gov
 (703)292-5197
CNS
 Division Of Computer and Network Systems
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: September 1, 2008
End Date: August 31, 2015 (Estimated)
Total Intended Award Amount: $320,000.00
Total Awarded Amount to Date: $422,900.00
Funds Obligated to Date: FY 2008 = $160,000.00
FY 2010 = $94,900.00

FY 2011 = $80,000.00

FY 2012 = $80,000.00

FY 2013 = $8,000.00
History of Investigator:
  • Shangping Ren (Principal Investigator)
    sren@sdsu.edu
Recipient Sponsored Research Office: Illinois Institute of Technology
10 W 35TH ST
CHICAGO
IL  US  60616-3717
(312)567-3035
Sponsor Congressional District: 01
Primary Place of Performance: Illinois Institute of Technology
10 W 35TH ST
CHICAGO
IL  US  60616-3717
Primary Place of Performance
Congressional District:
01
Unique Entity Identifier (UEI): E2NDENMDUEG8
Parent UEI:
NSF Program(s): Special Projects - CNS,
ADVANCED NET INFRA & RSCH,
CSR-Computer Systems Research
Primary Program Source: 01001011DB NSF RESEARCH & RELATED ACTIVIT
0100999999 NSF RESEARCH & RELATED ACTIVIT

01001112DB NSF RESEARCH & RELATED ACTIVIT

01001314DB NSF RESEARCH & RELATED ACTIVIT

01000809DB NSF RESEARCH & RELATED ACTIVIT

01001213DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 1187, 9251, 9178, HPCC, 7354, 1045, 9216, 9218, 9102
Program Element Code(s): 171400, 409000, 735400
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

The proliferation of embedded devices and significant advances of wireless network technologies have led to the emergence of Open Distributed Real-time and Embedded (ODRE) systems and applications which further the expansion of our society's digital backbone. These applications involve an increasingly large number of small dynamic concurrent objects that must together satisfy multiple types of QoS requirements. As such, the need for a new paradigm to reduce the complexity and ease the development of these systems is growing.

Viewing ODRE systems as compositions of coordination and concurrent computation decouples the two concerns and allows higher levels of abstractions. However, these advantages can only be fully realized if the following fundamental requirements are met. First, it is essential to have a coordination model that focuses on coordination under QoS constraints, and is decentralized, exogenous, scalable and stable.
Second, in order to reason about QoS constraints, a formal model that uniformly represents these different types of constraints must be provided. Third, tools that support coordination abstractions must be available to facilitate the development of ODRE applications. This project is devoted to meeting these requirements.

Collaborating with industry and laboratories and progressively evaluating research results in real-world application settings are two additional key facets of this project. This ensures that the results are relevant and usable in improving the robustness of critical software. In addition, the collaboration and role models from industry enrich the students? learning environment and provide them the support needed for successful careers in real-time embedded computing.

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 27)
Shuo Liu, Gang Quan, and Shangping Ren "On-Line Real-Time Service Allocation and Scheduling for Distributed Data Centers" Proceedings of the 8th IEEE International Conference on Services Computing, SCC 2011 , 2011
Kevin Marth and Shangping Ren "Actor-eUML for Concurrent Programming" Proceedings of the Seventh International Workshop on Foundations and Practices of UML, FP-UML, 2011 , 2011
Kevin Marth and Shangping Ren "Model-Driven Development with eUML-ARC" Proceedings of the 27th ACM Symposium On Applied Computing, SAC 2012 , 2012
Ke Yue, Soumia Ghalim, Zheng Li, Frank Lockom, Shangping Ren, Lei Zhangy, and Xiaowei Li "A Greedy Approach to Tolerate Defect Cores for Multimedia Applications" Proceedings of the 9th IEEE Symposium on Embedded Systems for Real-Time Multimedia, ESTIMedia 2011 , 2011
Li Wang, Shangping Ren, Kevin Kwiat, "Optimal Resource Allocation for Protecting System Availability against Random Cyber Attacks," Proceedings of the 3rd IEEE International Conference on Computer Research and Development, ICCRD 2011 , 2011
Li Wang, Shangping Ren, Ke Yue, and Kevin Kwiat "Optimal Resource Allocation to Improve Distributed System Dependability" Proceedings of the 4th Workshop on Secure Knowledge Management, SKM 2010 (Best student paper award runner-up) , 2011
Li Wang, Yair Leiferman, Shangping Ren, Kevin Kwiat, and Xiaowei Li "Improving Complex Distributed Software System Availability Through Information Hiding" Proceedings of the 25th Symposium On Applied Computing, Dependable and Adaptive Distributed Systems Track , 2010
Li Wang, Zheng Li, Shangping Ren, and Kevin Kwiat "Optimal Voting Strategy Against Rational Attacks" Proceedings of the Sixth International Conference on Risks and Security of Internet and Systems, CRiSIS 2011 , 2011
Nianen Chen and Shangping Ren "Adaptive Optimal Checkpoint Interval and Its Impact on Systemâ??s Overall Quality in Soft Real-time Applications" Proceedings of the 24th Annual ACM Symposium on Applied Computing , 2009
Nianen Chen, Yue Yu, and Shangping Ren "Checkpoint Interval and Systemâ??s Overall Quality for Message Logging-based Rollback and Recovery in Distributed and Embedded Computing" Proceedings of the 6th IEEE International Conference on Embedded Software and Systems , 2009
Shuhui Li, Shangping Ren, Yue Yu, Xing Wang, Gang Quan "Profit and Penalty Aware Scheduling for Real-Time On-line Services" IEEE Transactions on Industrial Informatics , v.8 , 2012
(Showing: 1 - 10 of 27)

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.

As modern computer system advances, more and more distributed applications with multiple QoS requirements are emerging, such as waste water and natural water monitoring and control. It has become an urgent need to develop techniques that guarantee applications' QoS constraints and decrease the complexity of implementing such systems. Through this project, we have developed a new paradigm that utilizes the separation of concern design principle to simplify the design and development of distributed real-time applications. In particular, the developed design and implementation paradigm separates coordination among distributed objects from the functionalities of the objects themselves. We have also developed a set of effective methods and techniques to maintain deployed real-time application's QoS requirements.


We have addressed the challenge of developing and implementing distributed real-time applications in open environment from both system implementation simplification and multi-QoS guarantee perspectives. For system implementation simplification, we have developed a hierarchical Actor-Role-Coordinator (ARC) programming model to simplify the system design and implementation. We have also developed a concept lattice based event model for high level semantic reasoning and a eUML-ARC model for concurrency programming to further reduce the system implementation complexity and improve development efficiency. For multi-dimensional QoS guarantees, we have developed a similarity based measurement to quantify the satisfaction of multi-dimensional QoS requirements. We have also developed information hiding and voting algorithms to guarantee system's availability, reliability in open distributed environment.  In addition,  a profit-penalty aware scheduling algorithm to maximize system profit while guaranteeing application's QoS requirements, a minimal slack time and minimal distance scheduling algorithm to minimize the cost for guaranteeing real-time application's timing constraint in cloud environment have been developed. 


In addition to system level implementation simplification and scheduling algorithm development, we have also addressed the QoS guaranteeing problem from considering resource performance change perspective.  Traditionally, system resources are considered as constant and they do not change over their life time.  Such assumptions are not valid for real-time applications which often operate for long time.  In fact, resource performance degrades overtime, which is evidenced by all computer users' own experiences --- our computers get slower if they have been running for long time without a reboot.  Software aging is identified as one of the main causes of resource performance degradation, software rejuvenation is a commonly used effective technique to combat performance degradations.  We have developed a novel resource model, i.e., the $P^2$ resource model, that takes into consideration of performance-degradation and periodic-rejuvenation.  The $P^2$ resource model generalizes traditional resource models existed in the literature. Based on the $P^2$ resource model, we have developed a set of theory and scheduling algorithm to ensure real-time guarantees for real-time applications. 


We have also studied large amount of virtual machine launch data obtained through collaboration with Fermilab on FermiCloud.  The analysis of these data indicates that there are large variations when launching a virtual machine both  on a private and a public cloud.  Based on over  three months  data collected on both private and public clouds, we have developed a cloud resource performance variation model that allows us to predict the resource startup overhead.  The reference model is a small but an important step forward to pave the road for deploying real-time app...

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

Print this page

Back to Top of page