메뉴 건너뛰기




Volumn 14, Issue 9, 2003, Pages 897-908

The master-slave paradigm with heterogeneous processors

Author keywords

Communication; Complexity; Heterogeneous processors; Master slave tasking; Matching

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; MONTE CARLO METHODS; POLYNOMIALS;

EID: 0142103241     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2003.1233712     Document Type: Article
Times cited : (49)

References (23)
  • 2
    • 0028518217 scopus 로고
    • Closed form solutions for bus and tree networks of processors load sharing a divisible job
    • Oct.
    • S. Bataineh, T.Y. Hsiung, and T.G. Robertazzi, "Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job," IEEE Trans. Computers, vol. 43, no. 10, pp. 1184-1196, Oct. 1994.
    • (1994) IEEE Trans. Computers , vol.43 , Issue.10 , pp. 1184-1196
    • Bataineh, S.1    Hsiung, T.Y.2    Robertazzi, T.G.3
  • 3
    • 0035481895 scopus 로고    scopus 로고
    • A proposal for a heterogeneous cluster scaLAPACK (Dense Linear Solvers)
    • Oct.
    • O. Beaumont, V. Boudet, A. Petitet, F. Rastello, and Y. Robert, "A Proposal for a Heterogeneous Cluster ScaLAPACK (Dense Linear Solvers)," IEEE Trans. Computers, vol. 50, no. 10, pp. 1052-1070, Oct. 2001.
    • (2001) IEEE Trans. Computers , vol.50 , Issue.10 , pp. 1052-1070
    • Beaumont, O.1    Boudet, V.2    Petitet, A.3    Rastello, F.4    Robert, Y.5
  • 7
    • 0004216499 scopus 로고    scopus 로고
    • Complexity results for parallel machine problems with a single server
    • Technical Report Reihe P No. 219, Fachbereich Mathematik Informatik, Univ. Osnabr̈ck
    • P. Brucker, C. Dhaenens-Flipo, S. Knust, S.A. Kravchenko, and F. Werner, "Complexity Results for Parallel Machine Problems with a Single Server," Technical Report Reihe P No. 219, Fachbereich Mathematik Informatik, Univ. Osnabr̈ck, 2000.
    • (2000)
    • Brucker, P.1    Dhaenens-Flipo, C.2    Knust, S.3    Kravchenko, S.A.4    Werner, F.5
  • 8
    • 0034273752 scopus 로고    scopus 로고
    • Optimizing computing costs using divisible load analysis
    • Sept.
    • S. Charcranoon, T.G. Robertazzi, and S. Luryi, "Optimizing Computing Costs Using Divisible Load Analysis," IEEE Trans. Computers, vol. 49, no. 9, pp. 987-991, Sept. 2000.
    • (2000) IEEE Trans. Computers , vol.49 , Issue.9 , pp. 987-991
    • Charcranoon, S.1    Robertazzi, T.G.2    Luryi, S.3
  • 13
    • 0000814936 scopus 로고    scopus 로고
    • Parallel machine scheduling with a common server
    • N. Hall, C.N. Potts, and C. Sriskandarajah, "Parallel Machine Scheduling with a Common Server," Discrete Applied Math., vol. 102, pp. 223-243, 2000.
    • (2000) Discrete Applied Math. , vol.102 , pp. 223-243
    • Hall, N.1    Potts, C.N.2    Sriskandarajah, C.3
  • 14
    • 0142098545 scopus 로고    scopus 로고
    • Open Problems in Combinatorial Optimization, World Wide Web Document; year?
    • S. Hedetniemi, Open Problems in Combinatorial Optimization, World Wide Web Document, http://www.cs.clemson.edu/-hedet/algorithms.html, year?
    • Hedetniemi, S.1
  • 15
    • 0001009871 scopus 로고
    • 5/2 algorithm for maximum matching in bipartite graphs
    • 5/2 Algorithm for Maximum Matching in Bipartite Graphs," SIAM J. Computing, vol. 2, no. 4, pp. 225-231, 1973.
    • (1973) SIAM J. Computing , vol.2 , Issue.4 , pp. 225-231
    • Hopcroft, J.E.1    Karp, R.M.2
  • 16
    • 0031469437 scopus 로고    scopus 로고
    • Parallel machine scheduling problems with a single server
    • S.A. Kravchenko and F. Werner, "Parallel Machine Scheduling Problems with a Single Server," Math. Computational Modelling, vol. 26, pp. 1-11, 1997.
    • (1997) Math. Computational Modelling , vol.26 , pp. 1-11
    • Kravchenko, S.A.1    Werner, F.2
  • 17
    • 0030269395 scopus 로고    scopus 로고
    • A hybrid bounding procedure for the workload allocation problem on parallel unrelated machines with setups
    • H. Lee and M. Guignard, "A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups," J. Operational Research Soc., vol. 47, pp. 1247-1261, 1996.
    • (1996) J. Operational Research Soc. , vol.47 , pp. 1247-1261
    • Lee, H.1    Guignard, M.2
  • 19
    • 0142098546 scopus 로고    scopus 로고
    • FANTOM-(Fast Newton-Raphson Torsion Angle Minimizer), World Wide Web Document
    • K. Soman, R. Fraczkiewicz, C. Mumenthaler, B. von Freyberg, and T. Schaumann and W. Braun, FANTOM-(Fast Newton-Raphson Torsion Angle Minimizer), World Wide Web Document, http://www.scsb.utmb.edu/fantom/fm_home.html, 2003.
    • (2003)
    • Soman, K.1    Fraczkiewicz, R.2    Mumenthaler, C.3    Von Freyberg, B.4    Schaumann, T.5    Braun, W.6
  • 20
    • 0002675486 scopus 로고    scopus 로고
    • Monte Carlo simulation of neuromuscular transmitter release using MCell, a general simulator of cellular physiological processes
    • J.R. Stiles, T.M. Bartol, M.M. Salpeter, and M.M. Salpeter, "Monte Carlo Simulation of Neuromuscular Transmitter Release Using MCell, a General Simulator of Cellular Physiological Processes," Computational Neuroscience, pp. 279-284, 1998.
    • (1998) Computational Neuroscience , pp. 279-284
    • Stiles, J.R.1    Bartol, T.M.2    Salpeter, M.M.3    Salpeter, M.M.4
  • 23
    • 0142130205 scopus 로고    scopus 로고
    • The two-machine flow shop problem with delays and the one-machine total tardiness problem
    • PhD thesis, Technishe Univ. Eidhoven, June
    • W. Yu, "The Two-Machine Flow Shop Problem with Delays and the One-Machine Total Tardiness Problem," PhD thesis, Technishe Univ. Eidhoven, June 1996.
    • (1996)
    • Yu, W.1


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