Scheduling tasks in multiprocessor systems using evolutionary strategies
暂无分享,去创建一个
[1] Alice C. Parker,et al. The high-level synthesis of digital systems , 1990, Proc. IEEE.
[2] Minh N. Do,et al. Youn-Long Steve Lin , 1992 .
[3] Martin T. Hagan,et al. Mapping Signal Processing Algorithms on Parallel Architectures , 1990, J. Parallel Distributed Comput..
[4] Michael de la Maza,et al. Book review: Genetic Algorithms + Data Structures = Evolution Programs by Zbigniew Michalewicz (Springer-Verlag, 1992) , 1993 .
[5] Gen-Huey Chen,et al. A branch-and-bound-with-underestimates algorithm for the task assignment problem with precedence constraint , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.
[6] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.
[7] Vipin Kumar,et al. Isoefficiency: measuring the scalability of parallel algorithms and architectures , 1993, IEEE Parallel & Distributed Technology: Systems & Applications.
[8] A. Gibbons. Algorithmic Graph Theory , 1985 .
[9] Nirwan Ansari,et al. Efficient multiprocessor scheduling based on genetic algorithms , 1990, [Proceedings] IECON '90: 16th Annual Conference of IEEE Industrial Electronics Society.
[10] P. Markenscoff,et al. Computation of tasks modeled by directed acyclic graphs on distributed computer systems: allocation without subtask replication , 1990, IEEE International Symposium on Circuits and Systems.
[11] Myunghwan Kim,et al. Optimal Task Assignment in Linear Array Networks , 1992, IEEE Trans. Computers.
[12] Ashwini K. Nanda,et al. Scheduling directed task graphs on multiprocessors using simulated annealing , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.