References
[1]. Andersson, B. (2003). Static-priority Scheduling on
Multiprocessors (Doctoral dissertation, Chalmers
University of Technology).
[2]. Braun, T. D., Siegel, H. J., Beck, N., Bölöni, L. L.,
Maheswaran, M., Reuther, A. I., ... & Freund, R. F. (2001). A
comparison of eleven static heuristics for mapping a class
of independent tasks onto heterogeneous distributed
computing systems. Journal of Parallel and Distributed
Computing, 61(6), 810-837.
[3]. Chapin, S. J., & Weissman, J. B. (2002). Distributed
and Multiprocessor Scheduling. Electrical Engineering
and Computer Science. Retrieved from https://surface.
syr.edu/eecs/40
[4]. Devi, U. C., & Anderson, J. H. (2006). Soft real-time
scheduling on multiprocessors. (Doctoral dissertation University of North Carolina at Chapel Hill).
[5]. Funk, S. H. (2004). EDF scheduling on heterogeneous
multiprocessors. (Doctoral dissertation University of North
Carolina at Chapel Hill).
[6]. Garshasbi, M. S., & Effatparvar, M. (2013). Tasks
scheduling on parallel heterogeneous multi-processor
systems using genetic algorithm. International Journal of
Computer Applications, 61(9). 23-27.
[7]. Hagras, T., & Jane?ek, J. (2003). Static vs. Dynamic
List-Scheduling Per formance Comparison. Acta
Polytechnica, 43(6), 16-21.
[8]. Ilavarasan, E., & Thambidurai, P. (2007). Low
complexity performance effective task scheduling
algorithm for heterogeneous computing environments.
Journal of Computer Sciences, 3(2), 94-103.
[9]. Kumar, S. (2007, December). Mathematical
modelling and simulation of a buffered Fault Tolerant
Double Tree Network. In Advanced Computing and
Communications, 2007. ADCOM 2007. International
Conference on (pp. 422-433). IEEE.
[10]. Lee, Y. C., & Zomaya, A. Y. (2011). Energy conscious
scheduling for distributed computing systems under
different operating conditions. IEEE Transactions on
Parallel and Distributed Systems, 22(8), 1374-1381.
[11]. Maheswaran, M., Ali, S., Siegel, H. J., Hensgen, D., &Freund, R. F. (1999). Dynamic mapping of a class of
independent tasks onto heterogeneous computing
systems. Journal of Parallel and Distributed Computing,
59(2), 107-131.
[12]. Park, G. L., Shirazi, B., Marquis, J., & Choo, H. (1997,
August). Decisive path scheduling: a new list scheduling
method. In Parallel Processing, 1997, Proceedings of the
1997 International Conference on (pp. 472-480). IEEE.
[13]. Pathan, R. M. (2012). Three Aspects of Real-Time
Multiprocessor Scheduling: Timeliness, Fault Tolerance,
Mixed Criticality (Doctoral dissertation, Chalmers
University of Technology).
[14]. Rusanova, O., & Korochkin, A. (1999, September).
Scheduling problems for parallel and distributed systems.
In ACM SIGAda Ada Letters (Vol. 19 No. 3, pp. 195-201).
ACM.
[15]. Singh, K., Alam, M., & Sharma, S. K. (2015). A survey
of static scheduling algorithm for distributed computing
system. International Journal of Computer Applications,
129(2), 25-30.
[16]. Yang, J., Xu, H., Pan, L., Jia, P., Long, F., & Jie, M.
(2011). Task scheduling using Bayesian optimization
algorithm for heterogeneous computing environments.
Applied Soft Computing, 11(4), 3297-3310.
