메뉴 건너뛰기




Volumn 50, Issue 2, 2014, Pages 270-314

Real-time scheduling with resource sharing on heterogeneous multiprocessors

Author keywords

Heterogeneous multiprocessors; Real time scheduling; Resource sharing

Indexed keywords

ALGORITHMS; MULTIPROCESSING SYSTEMS;

EID: 84896400926     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11241-013-9195-z     Document Type: Article
Times cited : (17)

References (56)
  • 4
    • 78049530086 scopus 로고    scopus 로고
    • Provably good multiprocessor scheduling with resource sharing
    • 10.1007/s11241-010-9105-6 1205.68100
    • Andersson B, Easwaran A (2010) Provably good multiprocessor scheduling with resource sharing. Real-Time Syst 46(2):153-159
    • (2010) Real-Time Syst , vol.46 , Issue.2 , pp. 153-159
    • Andersson, B.1    Easwaran, A.2
  • 8
    • 21644431756 scopus 로고    scopus 로고
    • Feasibility analysis of preemptive real-time systems upon heterogeneous multiprocessor platforms
    • 10.1109/REAL.2004.20
    • Baruah S (2004a) Feasibility analysis of preemptive real-time systems upon heterogeneous multiprocessor platforms. In: Proceedings of the 25th IEEE international real-time systems symposium, pp 37-46
    • (2004) Proceedings of the 25th IEEE International Real-time Systems Symposium , pp. 37-46
    • Baruah, S.1
  • 11
    • 84884586755 scopus 로고    scopus 로고
    • Partitioned EDF scheduling: A closer look
    • 10.1007/s11241-013-9186-0
    • Baruah S (2013) Partitioned EDF scheduling: a closer look. Real-Time Syst 49(6):715-729
    • (2013) Real-Time Syst , vol.49 , Issue.6 , pp. 715-729
    • Baruah, S.1
  • 12
    • 34249914236 scopus 로고    scopus 로고
    • The partitioned dynamic-priority scheduling of sporadic task systems
    • 10.1007/s11241-007-9022-5 1118.68378
    • Baruah S, Fisher N (2007) The partitioned dynamic-priority scheduling of sporadic task systems. Real-Time Syst 36(3):199-226
    • (2007) Real-Time Syst , vol.36 , Issue.3 , pp. 199-226
    • Baruah, S.1    Fisher, N.2
  • 14
    • 0019342681 scopus 로고
    • Scheduling subject to resource constraints: Classification and complexity
    • 10.1016/0166-218X(83)90012-4 0516.68037 678815
    • Blazewicz J, Lenstra J, Kan A (1983) Scheduling subject to resource constraints: classification and complexity. Discrete Appl Math 5(1):11-24
    • (1983) Discrete Appl Math , vol.5 , Issue.1 , pp. 11-24
    • Blazewicz, J.1    Lenstra, J.2    Kan, A.3
  • 18
    • 84861415304 scopus 로고    scopus 로고
    • The power of preemption on unrelated machines and applications to scheduling orders
    • 10.1287/moor.1110.0520 1238.90062 2931287
    • Correa J, Skutella M, Verschae J (2012) The power of preemption on unrelated machines and applications to scheduling orders. Math Oper Res 37(2):379-398
    • (2012) Math Oper Res , vol.37 , Issue.2 , pp. 379-398
    • Correa, J.1    Skutella, M.2    Verschae, J.3
  • 22
    • 70349675648 scopus 로고    scopus 로고
    • Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
    • Davis R, RothvoßT, Baruah S, Burns A (2009) Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling. Real-Time Syst 43(3)
    • (2009) Real-Time Syst , vol.43 , Issue.3
    • Davis R, R.1
  • 25
  • 27
    • 84976669902 scopus 로고
    • Efficient algorithms for graph manipulation
    • 10.1145/362248.362272
    • Hopcroft J, Tarjan R (1973) Efficient algorithms for graph manipulation. Commun ACM 16(6):372-378
    • (1973) Commun ACM , vol.16 , Issue.6 , pp. 372-378
    • Hopcroft, J.1    Tarjan, R.2
  • 28
    • 0016943203 scopus 로고
    • Exact and approximate algorithms for scheduling nonidentical processors
    • 10.1145/321941.321951 0329.68041 395801
    • Horowitz E, Sahni S (1976) Exact and approximate algorithms for scheduling nonidentical processors. J ACM 23:317-327
    • (1976) J ACM , vol.23 , pp. 317-327
    • Horowitz, E.1    Sahni, S.2
  • 29
    • 78651276390 scopus 로고    scopus 로고
    • IBM
    • IBM (2012). IBM ILOG CPLEX Optimizer. http://www-01.ibm.com/software/ integration/optimization/cplex-optimizer/
    • (2012) IBM ILOG CPLEX Optimizer
  • 32
    • 84896391749 scopus 로고    scopus 로고
    • Intel Corporation
    • Intel Corporation (2013) The 4th Generation Intel® Core™ i7 Processo. http://www.intel.com/content/www/us/en/processors/core/core-i7- processor.html
    • (2013) The 4th Generation Intel® Core™ i7 Processo
  • 34
    • 84896404528 scopus 로고    scopus 로고
    • NVIDIA Brings Kepler, World's Most Advanced Graphics Architecture
    • Alben J (2013) NVIDIA Brings Kepler, World's Most Advanced Graphics Architecture, to Mobile Devices. http://blogs.nvidia.com/blog/2013/07/24/kepler- to-mobile/
    • (2013) To Mobile Devices
    • Alben, J.1
  • 37
    • 0000438412 scopus 로고
    • Approximation algorithms for scheduling unrelated parallel machines
    • 10.1007/BF01585745 0715.90063 1054138
    • Lenstra J, Shmoys D, Tardos É (1990) Approximation algorithms for scheduling unrelated parallel machines. Math Program 46:259-271
    • (1990) Math Program , vol.46 , pp. 259-271
    • Lenstra, J.1    Shmoys, D.2    Tardos, É.3
  • 39
    • 84974687699 scopus 로고
    • Scheduling algorithms for multiprogramming in a hard real-time environment
    • 10.1145/321738.321743 0265.68013 343898
    • Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a hard real-time environment. J ACM 20:46-61
    • (1973) J ACM , vol.20 , pp. 46-61
    • Liu, C.L.1    Layland, J.W.2
  • 40
    • 79951799430 scopus 로고    scopus 로고
    • Combining abstract interpretation with model checking for timing analysis of multicore software
    • Lv M, Yi W, Guan N, Yu G (2010) Combining abstract interpretation with model checking for timing analysis of multicore software. In: Proceedings of the 31st IEEE real-time systems symposium, pp 339-349
    • (2010) Proceedings of the 31st IEEE Real-time Systems Symposium , pp. 339-349
    • Lv, M.1    Yi, W.2    Guan, N.3    Yu, G.4
  • 44
    • 0020709337 scopus 로고
    • Analysis of a linear programming heuristic for scheduling unrelated parallel machines
    • 10.1016/0166-218X(85)90009-5 0571.90035 777209
    • Potts CN (1985) Analysis of a linear programming heuristic for scheduling unrelated parallel machines. Discrete Appl Math 10:155-164
    • (1985) Discrete Appl Math , vol.10 , pp. 155-164
    • Potts, C.N.1
  • 45
    • 84896389222 scopus 로고    scopus 로고
    • Qualcomm Inc
    • Qualcomm Inc (2012) Snapdragon Processors. http://www.qualcomm.com/ chipsets/snapdragon
    • (2012) Snapdragon Processors
  • 47
    • 84875826762 scopus 로고    scopus 로고
    • Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors
    • 10.1007/s11241-012-9161-1
    • Raravi G, Andersson B, Bletsas K (2013) Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors. Real-Time Syst 49(1):29-72
    • (2013) Real-Time Syst , vol.49 , Issue.1 , pp. 29-72
    • Raravi, G.1    Andersson, B.2    Bletsas, K.3
  • 51
    • 84896402347 scopus 로고    scopus 로고
    • Samsung Inc
    • Samsung Inc (2012) Samsung Exynos processor. www.samsung.com/exynos/
    • (2012) Samsung Exynos Processor
  • 55
    • 84866636792 scopus 로고    scopus 로고
    • Texas Instruments
    • Texas Instruments (2012) OMAP mobile processors. http://www.ti.com/omap
    • (2012) OMAP Mobile Processors
  • 56
    • 84876287164 scopus 로고    scopus 로고
    • Partitioned EDF scheduling on a few types of unrelated multiprocessors
    • 10.1007/s11241-012-9164-y
    • Wiese A, Bonifaci V, Baruah S (2013) Partitioned EDF scheduling on a few types of unrelated multiprocessors. Real-Time Syst 49(2):219-238
    • (2013) Real-Time Syst , vol.49 , Issue.2 , pp. 219-238
    • Wiese, A.1    Bonifaci, V.2    Baruah, S.3


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