메뉴 건너뛰기




Volumn 2, Issue 6, 2010, Pages 383-394

ACO approach with learning for preemptive scheduling of real-Time tasks

Author keywords

ACO; Hard real Time; Learning; Multiprocessor systems; Preemptive scheduling

Indexed keywords

BIOMIMETICS; LEARNING SYSTEMS; SCHEDULING;

EID: 79960354983     PISSN: 17580366     EISSN: 17580374     Source Type: Journal    
DOI: 10.1504/IJBIC.2010.037018     Document Type: Article
Times cited : (26)

References (26)
  • 1
    • 0033220904 scopus 로고    scopus 로고
    • Combined task and message scheduling in distributed real-time systems
    • DOI 10.1109/71.809575
    • Abdelzaher, T.F. and Shin, K.G. (1999) 'Combined task and message scheduling in distributed real-Time systems', IEEE Transaction on Parallel and Distributed Systems, November, Vol. 10, No. 11, pp.1179-1191. (Pubitemid 32213399)
    • (1999) IEEE Transactions on Parallel and Distributed Systems , vol.10 , Issue.11 , pp. 1179-1191
    • Abdelzaher, T.F.1    Shin, K.G.2
  • 2
    • 0033446619 scopus 로고    scopus 로고
    • An improved ant system algorithm for the vehicle routing problem
    • Bullnheimer, B., Hartl, R.F. and Strauss, C. (1999) 'An improved ant system algorithm for the vehicle routing problem', Annals of Operations Research, Vol. 89, pp.319-328.
    • (1999) Annals of Operations Research , vol.89 , pp. 319-328
    • Bullnheimer, B.1    Hartl, R.F.2    Strauss, C.3
  • 3
    • 10444267328 scopus 로고    scopus 로고
    • Rate monotonic vs. EDF: Judgment day
    • Buttazzo, G.C. (2005) 'Rate monotonic vs. EDF: judgment day', Real Time Systems, January, Vol. 29, No. 1, pp.5-26.
    • (2005) Real Time Systems, January , vol.29 , Issue.1 , pp. 5-26
    • Buttazzo, G.C.1
  • 4
    • 33745872515 scopus 로고    scopus 로고
    • Applying ant colony optimization to the partitioned scheduling problem for heterogeneous multiprocessors
    • April
    • Chen, H. and Cheng, A.M.K. (2005) 'Applying ant colony optimization to the partitioned scheduling problem for heterogeneous multiprocessors', ACM SIGBED Review, April, Vol. 2, No. 2, pp.11-14.
    • (2005) ACM SIGBED Review , vol.2 , Issue.2 , pp. 11-14
    • Chen, H.1    Cheng, A.M.K.2
  • 7
    • 0029489059 scopus 로고
    • Applicability of simulated annealing methods to real-Time scheduling and jitter control
    • Pisa, Italy, December, ISBN: 0-8186-7337-0
    • Dinatale, M. and Stankovic, J.A. (1995) 'Applicability of simulated annealing methods to real-Time scheduling and jitter control', 16th Proceeding of IEEE Real-Time Systems Symposium, Pisa, Italy, December, pp.190-199, ISBN: 0-8186-7337-0.
    • (1995) 16th Proceeding of IEEE Real-Time Systems Symposium , pp. 190-199
    • Dinatale, M.1    Stankovic, J.A.2
  • 8
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to the traveling salesman problem
    • PII S1089778X97033031
    • Dorigo, M. and Gambardella, L.M. (1997) 'Ant colony system: A cooperative learning approach to the TSP', IEEE Transactions on Evolutionary Computation, April, Vol. 1, No. 1, pp.53-66. (Pubitemid 127771018)
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 15
    • 56449093692 scopus 로고    scopus 로고
    • ACO-based scheduling of parallel batch processing machines with incompatible job families to minimize total weighted tardiness
    • 22-24 September, Springer, Brussels, Belgium, ISBN 978-3-540-8-7526-0
    • Li, L., Qiao, F., Wu, Q. (2008) 'ACO-based scheduling of parallel batch processing machines with incompatible job families to minimize total weighted tardiness', 6th International Conference, ANTS 2008, Lecture Notes in Computer Science, 22-24 September, Vol. 5217, pp.219-226, Springer, Brussels, Belgium, ISBN 978-3-540-8-7526-0.
    • (2008) 6th International Conference, ANTS 2008, Lecture Notes in Computer Science , vol.5217 , pp. 219-226
    • Li, L.1    Qiao, F.2    Wu, Q.3
  • 16
    • 84974687699 scopus 로고
    • Scheduling algorithms for multiprogramming in a hard real-Time environment
    • Liu, C.L. and Layland, J.W. (1973) 'Scheduling algorithms for multiprogramming in a hard real-Time environment', Journal of the ACM, Vol. 20, No. 1, pp.64-61.
    • (1973) Journal of the ACM , vol.20 , Issue.1 , pp. 64-61
    • Liu, C.L.1    Layland, J.W.2
  • 17
    • 0038059304 scopus 로고    scopus 로고
    • Fine tuning the scheduling of tasks through a genetic algorithm: Application to Posix1003.1b compliant systems
    • Navet, N. and Migge, J. (2003) 'Fine tuning the scheduling of tasks through a genetic algorithm: Application to Posix1003.1b compliant systems', IEE Proceeding on Software, February, Vol. 150, No. 1, pp.13-24.
    • (2003) IEE Proceeding on Software, February , vol.150 , Issue.1 , pp. 13-24
    • Navet, N.1    Migge, J.2
  • 20
    • 0026187925 scopus 로고
    • A pre-run-time scheduling algorithm for hard real-time systems
    • DOI 10.1109/32.83903
    • Shepard, T. and Gagne, M. (1991) 'A pre-run-Time scheduling algorithm for hard real-Time systems', IEEE Transaction on Software Engineering, July, Vol. 17, No. 7, pp.669-677. (Pubitemid 21674684)
    • (1991) IEEE Transactions on Software Engineering , vol.17 , Issue.7 , pp. 669-677
    • Shepard Terry1    Gagne J.A.Martin2
  • 21
    • 0026865757 scopus 로고
    • Allocating hard real-time tasks: an NP-Hard problem made easy
    • Tindell, K., Burns, A. and Wellings, A.J. (1992) 'Allocating hardreal-Time tasks (an NP-hard problem made easy)', Journal of Real-Time Systems, June, Vol. 4, No. 2, pp.145-165. (Pubitemid 23566343)
    • (1992) Real-Time Systems , vol.4 , Issue.2 , pp. 145-165
    • Tindell, K.W.1    Burns, A.2    Wellings, A.J.3
  • 23
    • 0027544352 scopus 로고
    • Multiprocessor scheduling of processes with release times, deadlines, precedence, and exclusion relations
    • DOI 10.1109/32.214831
    • Xu, J. (1993) 'Multiprocessor scheduling of processes with release times, deadlines, precedence and exclusion relations', IEEE Transaction on Software Engineering, February, Vol. 19, No. 2, pp.139-154. (Pubitemid 23675581)
    • (1993) IEEE Transactions on Software Engineering , vol.19 , Issue.2 , pp. 139-154
    • Xu Jia1
  • 24
    • 85068172419 scopus 로고
    • Pre-run-Time scheduling of processes with exclusion relations on nested or overlapping critical sections', 11th
    • Scottsdale, USA, April, ISBN 0-7803-0605-8
    • Xu, J. and Parnas, D. (1992) 'Pre-run-Time scheduling of processes with exclusion relations on nested or overlapping critical sections', 11th IEEE International Phoenix Conference on Computers and Communications, Scottsdale, USA, April, pp.774-782, ISBN 0-7803-0605-8.
    • (1992) IEEE International Phoenix Conference on Computers and Communications , pp. 774-782
    • Xu, J.1    Parnas, D.2
  • 25
    • 0027259585 scopus 로고
    • On satisfying timing constraints in hard-real-Time systems
    • Xu, J. and Parnas, D. (1993) 'On satisfying timing constraints in hard-real-Time systems', IEEE Transaction on Software Engineering, December, Vol. 19, No. 1, pp.70-84.
    • (1993) IEEE Transaction on Software Engineering, December , vol.19 , Issue.1 , pp. 70-84
    • Xu, J.1    Parnas, D.2
  • 26
    • 0033640608 scopus 로고    scopus 로고
    • Priority scheduling versus pre-run-time scheduling
    • DOI 10.1023/A:1008198310125
    • Xu, J. and Parnas, D. (2000) 'Priority scheduling versus pre-run-Time scheduling', The International Journal of Time-Critical Computing Systems, January, Vol. 18, No. 1, pp.7-23. (Pubitemid 32131986)
    • (2000) Real-Time Systems , vol.18 , Issue.1 , pp. 7-23
    • Xu, J.1    Parnas, D.L.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.