Find out more about how The Lecture List works.
Coronavirus situation updateOur lecture organisers may or may not have had time to update their events with cancellation notices. Clearly social gatherings are to be avoided and that includes lectures. STAY AT HOME FOLKS, PLEASE. |
Find out what you can do to keep The Lecture List online
 |
|
Algorithms for parallelising loops will be discussed together with an extension to the feedback-guided dynamic loop scheduling algorithm incorporating memory.
Since loops are the dominant source of parallelism for many applications, a variety of algorithms that aim to schedule loop iterations to processors of a shared-memory machine in an almost optimal way (so-called loop scheduling algorithms) have been designed. In this presentation we review existing loop scheduling algorithms and also describe the feedback-guided dynamic loop scheduling (FGDLS) algorithm. The FGDLS algorithm uses a feedback mechanism to schedule a parallel loop within a sequential outer loop. We will consider the
convergence properties of the algorithm and will describe a extension to the algorithm that incorporates some memory.
Speaker(s): |
|
|
|
Date and Time: |
10 November 2004 at 1:30 pm |
Duration: | 1 hour |
|
|
Venue: |
School of Maths, Kingston University |
|
|
Tickets: |
Free. |
Available from: |
|
Additional Information: |
Research seminars are usually held in the Penrhyn Road building of Kingston University. Check the web site for full details and room information. |
Register to tell a friend about this lecture.
If you would like to comment about this lecture, please register here.
©2003-2006 Niminim Limited. Created by 
Any ad revenue is entirely reinvested into the Lecture List's operating fund
