An O(p + log p) Algorithm of Discrete FGDLS

Tatiana Tabirca; Sabin Tabirca; Len Freeman; Laurence Tianruo Yang

doi:10.1109/ICPPW.2003.1240367

2003 International Conference on Parallel Processing Workshops, 2003. Proceedings.

An O(p + log p) Algorithm of Discrete FGDLS

Year: 2003, Pages: 164

DOI Bookmark: 10.1109/ICPPW.2003.1240367

Authors

Tatiana Tabirca, University College Cork, Ireland
Sabin Tabirca, University College Cork, Ireland
Len Freeman, University of Manchester, UK
Laurence Tianruo Yang, St. Francis Xavier University, Canada

Abstract

Feedback Guided Dynamic Loop Scheduling(FGDLS) is a recent dynamic method [1] that aims to schedule a parallel loop within a sequential outer loop. The method uses the feedback from the execution times of the current parallel loop to guide the scheduling of the next parallel loop. In this paper we propose an O(p + log p) algorithm for the FGDLS method in the discrete case. This approach applies the balanced workload scheduling [12] to the piecewise constant workloads to obtain the iteration bounds.

Like what you’re reading?

Already a member?

Get this article FREE with a new membership!

An efficient and scalable parallel algorithm for discrete-event simulation
1991 Winter Simulation Conference Proceedings.
Feedback Guided Dynamic Loop Scheduling; A Theoretical Approach
Proceedings International Conference on Parallel Processing Workshops
Merging Multiple Lists in O(log n) Time
1993 International Conference on Parallel Processing - ICPP'93
An O(log N log log N) time RMESH algorithm for the simple polygon visibility problem
Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)
Solving the Discrete Logarithm Problem Using P Systems
Networks Security, Wireless Communications and Trusted Computing, International Conference on
An O(Log Log m)-Competitive Algorithm for Online Machine Minimization
2017 IEEE Real-Time Systems Symposium (RTSS)
A Flexible Resource Management Architecture for the Blue Gene/P Supercomputer
2007 IEEE International Parallel and Distributed Processing Symposium
Optimal parallel hull construction for simple polygons in O(log log n) time
Proceedings., 33rd Annual Symposium on Foundations of Computer Science
An O(logp) Algorithm for the Discrete Feedback Guided Dynamic Loop
20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)
Accelerating I/O Forwarding in IBM Blue Gene/P Systems
SC Conference

An O(p + log p) Algorithm of Discrete FGDLS

Authors

Abstract

Related Articles