Abstract
Mapping and scheduling in multiprogrammed environment has recently attracted more attention of the researchers. Most of the past algorithms use the First Come First Serve (FCFS) strategy, using time-sharing, space-sharing or the combination of both. However, there are limitations when FCFS is implemented in a real system. In order to overcome those drawbacks, we propose a new scheme, called First Input First Output–Best Fit (FIFO-BF), which is used in a mapping policy, Adaptive Multiprogrammed Mapping (AMM). Taking heterogeneity into account, another mapping policy, Heterogeneous Multiprogrammed Mapping (HMM), is presented. Due to its complex nature, little work has been done in this area.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Connection Machine CM5 Technical Summary. Thinking Machnes Corp., Cambridge (1992)
Hanh, P.H., Simonenko, V.: Objective-oriented algorithm for job scheduling in parallel heterogeneous systems. In: Job Scheduling Strategies for Parallel Processing, April 1997. LNCS, pp. 193–213 (1997)
Kessler, R., Schwarzmeier, J.: CRAY T3D: A new dimension for cray research. In: Proc. COMPCON, pp. 176–182 (1993)
Mccann, C., Vaswani, R., Zahorjan, J.: A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors. ACM Trans. on Computer systems 11(2) (May 1993)
Naik, V.K., Setia, S.K., Squillante, M.S.: Processor Allocation in Multiprogrammed Distributed Memory Parallel Computer Systems. J. of Parallel and distributed computing 46, 28–47 (1997)
Wang, F., Franke, H., Papaefthymiou, M., Pattnaik, P., Rudoph, L., Squillante, M.S.: A gang scheduling design for multiprogrammed parallel computing envionments. In: Job Scheduling Strategies for Parallel Processing, April 1996. LNCS, pp. 111–125 (1996)
Yang, W., Maheshwari, P.: Mapping precedence tasks onto a heterogeneous distributed system. In: Int’l Conf. on Parallel and Distributed Computing and Networks, December 1998, pp. 596–600 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maheshwari, P. (2004). A Job Scheduling Strategy for Heterogeneous Multiprogrammed Systems. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_118
Download citation
DOI: https://doi.org/10.1007/978-3-540-24669-5_118
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21946-0
Online ISBN: 978-3-540-24669-5
eBook Packages: Springer Book Archive