getCITED   
  Home     Search     Add Content     Reports     Help  
Edit Publication | Edit Contributors | Delete Publication | Edit References | Edit Citations
Add to Bookstack | Show Bookstack | Change Bookstack

Automatic Selection of Loop Scheduling Algorithms Using Reinforcement Learning

Post a Comment
CONTRIBUTORS:
  Author Dhandayuthapani, Sumitra
  Author Banicescu, Ioana
  Author Cariño, Ricolindo L.
  Author Hansen, Eric
  Author Pabico, Jaderick P. (University of the Philippines Los Banos)
  Author Rashid, Mahbubur
PROCEEDINGS TITLE:
  Proceedings of the International Workshop on Challenges of Large Applications in Distributed Environments (HPDC-CLADE 2005),
YEAR: 2005
PUB TYPE: Conference Paper in Proceedings
PAGES: 87 - 94
SUBJECT(S): None
DISCIPLINE: Computer Science
HTTP: http://dx.doi.org/10.1109/CLADE.2005.1520907
LANGUAGE: English
PUB ID: 103-444-147 (Last edited on 2008/07/23 00:43:38 GMT-6)
SPONSOR(S):
 
ABSTRACT:
This paper presents the design and implementation of a reinforcement learning agent that automatically selects appropriate loop scheduling algorithms for parallel loops embedded in time-stepping scientific applications executing on clusters. There may be a number of such loops in an application, and the loops may have different load balancing requirements. Further, loop characteristics may also change as the application progresses. Following a model-free learning approach, the learning agent assigned to a loop selects from a library the best scheduling algorithm for the loop during the lifetime of the application. The utility of the learning agent is demonstrated by its successful integration into the simulation of wave packets - an application arising from quantum mechanics. Results of statistical analysis using pairwise comparison of means on the running time of the simulation with and without the learning agent validate the effectiveness of the agent in improving the parallel performance of the simulation.
STATISTICS
Click on # to view
 Citations  
 References  
 Comments  
 Quality      0/0.00 
 Interest      0/0.00 
 View(er)s   2/79 
Quality
  N/A
High
  7
  6
  5
  4
  3
  2
  1
Low
Interest
  N/A
High
  7
  6
  5
  4
  3
  2
  1
Low
Prev | Next

    ABOUT getCITED   |    CONTACT US   |    USER INFO   |    PREFERENCES   |    PRIVACY   |    LOG IN   
Comments? Suggestions? Send them to feedback@getCITED.org.

Copyright © 2000-2006 getCITED Inc. All Rights Reserved.