article

Free access

Models of machines and computation for mapping in multicomputers

Authors:

Michael G. Norman,

Peter ThanischAuthors Info & Claims

ACM Computing Surveys (CSUR), Volume 25, Issue 3

Pages 263 - 302

https://doi.org/10.1145/158439.158908

Published: 01 September 1993 Publication History

PDF eReader

References

[1]

ADAM, T, CHANDY, K., AND DICKSON,J 1974. A comparison of list schedulers for parallel processmg systems. Commun ACM 17, 12, 685 690.

Crossref

Google Scholar

[2]

AGRAWAL, R., AND JAGADISH, H. 1988. Partitioning techniques for large gram parallehsln. IEEE Trans. Comput. C-37, 12, 1627-1634.

Crossref

Google Scholar

[3]

AL-MOUHAMMED, M 1990. Lower bound on the number of processors and time for scheduling precedence graphs with communication costs. IEEE Trans. Softw Eng. SE-16, 12, 1390 1301.

Crossref

Google Scholar

[4]

ANTONELLI, S., BAIARDI, F.,PELAGATTI, S., AND VANNESCHI, M. 1991. Modeling concurrent programs for statm mapping. In Proceedings of PARALLEL COMPUTING '91 (London, UK) Elsevier, New York.

Google Scholar

[5]

BACCELLL F., AND LIU, Z. 1990. On the execution of parallel programs on multiprocessor systems --a queueing theory approach. J. ACM 37, 2, 373-414.

Crossref

Google Scholar

[6]

BAL, H., STEN{ER, J., AND TANENBAUM, A. 1989 Programming languages for distributed computing systems. Coraput. Surv 21, 3, 261-322

Crossref

Google Scholar

[7]

BAXTER, J., AND PATEL, J. 1989. The LAST algorithm: A heuristic based static task allocation algorithm. In Proceedzngs of the International Conference on Parallel Processing Vol 2. IEEE Computer Society, Washington, D.C., 217 222.

Google Scholar

[8]

BENKNER, S., CHAPMAN, B. M., ANt) ZIMA, H. P. 1992. Vienna Fortran-90 In Proceedings of the Scalable High-Performance Computzng Confererzce, (Williamsburg, Va., Apr. 26 29). IEEE Computer Society Press, Los A}amitos, Calif., 51-59

Google Scholar

[9]

BERGER, M, AND BOKHARI, S. 1987. A partitioning strategy for nonuniform problems on multiprocessors. IEEE Trans. Conzput C-36, 5, 570 581.

Crossref

Google Scholar

[10]

BERMAN, F., AND SNYDER, L. 1987. On mapping parallel algorithms into parallel architectures. J. Parall. Dlstrtb. Compat 4, 5, 439-458.

Crossref

Google Scholar

[11]

BERMAN, F., ann STRAMM, B 1989 Prep-p Evolution and overview Tech. Rep CS89-158, Univ. of California, San Diego, Calif

Google Scholar

[12]

LAZEWICZ, J., DRABOWSK{, M., AND WEGLARZ, J. 1986. Scheduling multiprocessor tasks to minimize schedule length. IEEE Trans Cornput. C-35, 5, 389 393.

Crossref

Google Scholar

[13]

BLAZEWICZ, J., DROR, M., AND WEGLARZ, J 1991. Mathematical programming formulations for machine scheduling: A survey. Ear J. Oper. Res. 51, 3, 283-300

Google Scholar

[14]

BOKHARI, S. 1990a A Network flow model for load balancing in circuit-switched multmomputers. Tech. Rep. 90-38, ICASE, NASA, Langley Research Center, Va.

Google Scholar

[15]

BOKHARI, S 1990b Communication overhead on the Intel iPSC-860 hypercube Tech Rep. 10, ICASE, NASA, Langley Research Center, Va

Google Scholar

[16]

BOKHAIti, S. 1988. Partitioning problems in parallel, pipelined and distributed computing IEEE Trans. Comput C-37, 1, 48 57.

Crossref

Google Scholar

[17]

BOKHARI, S. 1981a. On the mapping problem. IEEE Trans Comput C-30, 3, 207 214

Google Scholar

[18]

BOKHARI, S. 1981b A shortest tree algorithm for optimal assignments across space and time in a distributed computer system. IEEE Trans. Softw. Eng SE-7, 6, 583-589.

Google Scholar

[19]

BOMANS, L., AND ROOSE, D. 1989. Benchmarking the lPSC/2 hypercube multlprocessor. Concur. Prac. Exp. 1, 1, 13-18.

Google Scholar

[20]

BRENT, R. 1974. The parallel evaluation of general arithmetic expressions J. ACM 21, 2, 201-206

Crossref

Google Scholar

[21]

BRUNO, J., COFFMAN, E., JR., AND SETHI, R. 1974. Scheduling independent tasks to reduce mean finishing time. Commun. ACM 17, 7, 382 387.

Crossref

Google Scholar

[22]

CALLAHAN, D., AND KENNEDY, K. 1988. Analysis of interprocedural side effects in a parallel programmmg environment J. Parall. Dlstrtb. Comput. 5, 15, 517 550.

Crossref

Google Scholar

[23]

CARRIERO, X., AND GELERNTER, D 1990. How to Write Parallel Prog'rams MIT Press, Cambridge Mass

Crossref

Google Scholar

[24]

CASAVAN% T., AND KUHL, J 1988. A taxonomy of scheduling in general purpose distributed cornputing systems. IEEE Trans. So/tw. Eng SE- 14, 2, 141 154.

Crossref

Google Scholar

[25]

CHEN, G.-I., AND LAI, T.-H., 1988. Scheduling independent jobs on hypercubes. In Proceedings of the Conference on the Theoretical Aspects of Computer Science. Springer-Verlag, Berlin, 273-280.

Crossref

Google Scholar

[26]

CHEN, M.-S., AND SHIN, K. 1987. Processor allocation in a n-cube multiprocessor using gray codes. IEEE Trans. Comput. C-36, 12, 1396-1407.

Crossref

Google Scholar

[27]

CHEN, N., AND LIU, C. 1975. On a class of scheduling algorithms for multiprocessor computing systems. In Lecture Notes ~n Computer Science. Springer, New York.

Crossref

Google Scholar

[28]

CHITTOR, S., AND ENBODY, R. 1992. Minimising contention: A new mapping objective for second generation multicomputers. Tech. Rep., Michigan State Univ., East Lansing, Mich. Submitted to IEEE Trans. Parall. Distr~b. Syst.

Google Scholar

[29]

CHo, Y., AND SA~NI, S. 1980 Bounds for list schedules on uniform processors. SIAM J. Comput. 9, 1, 91-103.

Google Scholar

[30]

CHR~TIENNE, P. 1989. A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints. Ear. J. Oper. Res. 43, 3, 225-230

Google Scholar

[31]

CHRETIENNE, P., AND PICOULEAU, C. 1992. The basic scheduling problem with interprocessor communication delays. In Proceedings of the Summer School on Scheduhng Theory and Its Applicatmn. INRIA, Sophia Antipolis, France.

Google Scholar

[32]

CHU, W., ANn LAN, M.-T. 1987 Task allocation and precedence relations for distributed realtime systems. IEEE Trans. Comput. C-36, 6, 667-679.

Crossref

Google Scholar

[33]

CHU, W., LAN, M.-T., AND HELLERSTEIN, J. 1984. Estimation of intermodule communication (IMC) and its applications in distributed processing systems. IEEE Trans. Comput. C-33, 8, 691 699.

Google Scholar

[34]

CHU, W., HOLLOWAY, L., LAN, M.-T., AND EFE, K. 1980. Task allocation in distributed data processing. Computer 13, 11.

Google Scholar

[35]

COFFMAN, E., JR., El). 1976. Computer and Job Shop Scheduhng Theory. John Wiley, New York.

Google Scholar

[36]

COFFMAN, E, J~., ^ND GRAHAM, R. 1972. Optimal scheduling for two processor systems Acta Informatica 1, 3, 200-213.

Google Scholar

[37]

COFFMAN, E., JR., FLATTO, L., AND LEUKER, G. 1984a. Expected makespans ibr largest-first inultiprocessor scheduling In Performance '84. Elsevier Science Publishers B.V. (North Holland), Amsterdam, 491 506

Crossref

Google Scholar

[38]

COF~'MAN, g., Jm, GAREY, M, AND JOHNSTON, D. 1984b. Approxmmtion algorithms for binpacking an updated survey. In Algorithm Des~gn for Computer System Deszgn. Springer- Verlag, Berlin.

Google Scholar

[39]

COEFMAN, E., JR., GAREY, M., AND JOHNSTON, D. 1978. An application of bin-packing to multiprocessor scheduling. SIAM J. Cornput. 7, 1, i 17.

Google Scholar

[40]

COLE, R., AND VISHKIN, U. 1988. Approximate parallel scheduling, part 1: The basic technique with applications to optimal parallel list ranking in logarithmic time. SIAM J. Comput. 17, 1, 128 142.

Crossref

Google Scholar

[41]

CONWAY, R., MAXWELL, W., AND MILLER, L. 1967. Theory of Scheduling. Addison-Wesley, Reading, Mass.

Google Scholar

[42]

CVETANOVIC, Z. 1987. The effects of problem partitioning, allocation and granularity on the perormance of multiple-processor systems. IEEE Trans. Comput. C-36, 4, 421-432.

Crossref

Google Scholar

[43]

CYTRON, R. 1986. Doacross: Beyond vectorisation for multiprocessors (extended abstract). In Proceedmgs of the Internatmnal Conference on Parallel Processing. IEEE Computer Society, Washington, D.C, 836 844.

Google Scholar

[44]

DALLY, W. 1990a Network and processor architecture for message-driven computers. In VLSI and Parallel Computation. Morgan Kaufmann, Palo Alto, Calif., 140-222.

Crossref

Google Scholar

[45]

DALLY, W. 1990b. Performance analysis of k-any n-cube lnterconnectlon networks. IEEE Trans. Comput. 39, 6, 775 785.

Crossref

Google Scholar

[46]

DALLY, W., AND SEITZ, C. 1987. Deadlock-free message routing in multiprocessor lnterconnectlon networks. IEEE Trans. Comput. C-36, 5.

Crossref

Google Scholar

[47]

DIETZ, H., ZAAFR^NI, A., ANI) O'KE~EFE, M. 1992. Static scheduling for barrier MIMD architectures, d. Supercomput. 5, 4, 263 289.

Crossref

Google Scholar

[48]

DOLEV, D., UPFAL, E., AND WARMUT}~, M. 1986. The parallel complexity of scheduling with precedence constraints. J. Parall. Dlstrib. Comput. 3, 4, 553-576.

Crossref

Google Scholar

[49]

DU, J., AND LEUNG, J.-T. 1989. Complexity of scheduling parallel task systems. SIAM J. Discr. Moth. 2, 4, 473-487.

Crossref

Google Scholar

[50]

DUATO, J. 1992. Impact of locality on the performance of some adaptive routing algorithms for the hypercube. In Parallel Computing: From Theo~:v to Sound Practwe. IOS Press, Amsterdam.

Google Scholar

[51]

EFE, K. 1982. Heuristic models of task assignment scheduling in distributed systems. IEEE Comput. 15, 6 (June), 50 56.

Google Scholar

[52]

EL-REw~Nh H., AND LEWIS, T. 1990. Scheduling parallel program tasks onto arbitrary target machines. J. Parall Dtstrzb. Comput. 9, 2, 138 153.

Crossref

Google Scholar

[53]

FELLOWS, M., AND LANGSTON, M. 1988. Processor utilization in a linearly connected parallel processing system. IEEE Tran.~. Comput. C-37, 5. 594 603.

Crossref

Google Scholar

[54]

FERNfi. NDEZ, E., AND BUSSELL, B. 1973. Bounds on the number of processors and time for multiprocessor optimal schedules. IEEE Trans. Comput. C-22, 8, 745-751.

Google Scholar

[55]

FERNANDEZ-BACA, D. 1989 Allocating modules to processors in a distributed system IEEE Trans. Softw. Eng. SE-15, 11, 1427-143.

Crossref

Google Scholar

[56]

FERRANTE, d., OTTENSTEiN, K., AND WARREN, J. 1987. The program dependence graph and its use m optimization. ACM Trans Program. Lang'. Syst. 9, 3.

Crossref

Google Scholar

[57]

Fox, G 1989. Parallel computing comes of age. Concur Pract. Exp. 1, 1, 63 103.

Google Scholar

[58]

FOX, G., HIRANANDANI, S., KENNEDY, K., KOELBEL, C., KIIF, MER, U., TSENG, C.-W., AND WLJ, M.-Y. 1992. Fortran D Language Spemfieation. Tech. Rep., Center for Research on Parallel Computations, Rice Univ., Houston, Tex.

Google Scholar

[59]

Fox, G., JOHNSON, M., LYZENGA, G, OTTO, S., SALMON, J., AND WALKER, D. 1988. Solvzng Scmnti/ic Problems on Concurrent Processors. Prentice-Hall, Englewood Cliffs, N.J

Crossref

Google Scholar

[60]

GABOW, H. 1988. Scheduling UET systems on two uniform processors and length two pipelines. SIAM J. Comput. 17, 4, 810-811.

Crossref

Google Scholar

[61]

GAREY, M., AND JOHNSON, R. 1982 Approximation algorithms for bin packing problems--A survey In Analysts and Design of Combinatorial Optunzsatlon Springer-Verlag, Vienna, Austria, 147 172.

Google Scholar

[62]

GAREY, M., AND JOHNSON, D. 1979 Computers and Intractabd~ty. W H. Freeman and Co., San Francisco

Google Scholar

[63]

GAREV, M., AND JOHNSON, D 1975. Complexity results for multiprocessor scheduling with resource constraints. SIAM J. Comput. 4, 4, 396-411

Google Scholar

[64]

OARI*}Y, M, GRAHAM, R, AND JOHNSTON, D. 1977. Performance guarantees fbr scheduling algorithms. Oper Res. 26, 1.

Google Scholar

[65]

GAUDU}T, J., PL J., AND CAMPBELL, M 1988 Program graph allocation in distributed multicomputers. Parall. Camput., 7, 227-247.

Google Scholar

[66]

GONZALEZ, M. 1977. Deterministic processor scheduling ACM Comput Surv., 9, 3.

Crossref

Google Scholar

[67]

GRAHAM, R 1969. Bounds on multlprocesslng timing anomalies. SIAM d App/. Math. 17, 2, 16 429.

Google Scholar

[68]

GRAHAM, R. 1966 Bounds fbr certain nmltiproessing timing anomalies. Bell Sys! Tech J 45, 11, 1563 1581

Google Scholar

[69]

GRAHAM, R., LAWLER, E., LENSTRA, J., AND RINNOOY KAN, A. 1979. Optimmation and approximation m deterministic sequencing' and schedulmR, a survey. Ann. Dlser. Math. 5, 287 236.

Google Scholar

[70]

GUSFIELD, D. 1983 Parametric combinatorial computing and a problem of program module distribution,J. ACM 30, 3, 551 563.

Crossref

Google Scholar

[71]

GYLYS, V., AND EDWARDS, J. 1976. Optimal partitioning of workload for distributed systems. In Proceedings of Compcon Fall 76 IEEE Computer Society, Washington, D C

Google Scholar

[72]

HELLSTROM, B., AND KANAL, L. 1990. Asymmetric mean-field neural networks for multiprocessor scheduling Tech Rap. UMIACS-TR-90-99, niv. of Maryland, Institute for Advanced Computer Studies, College Park, Md.

Crossref

Google Scholar

[73]

HELMBDLD, D., AND MAYR, E. 1987. Two processor scheduling is in NC. SIAM J. Comput. 16, 4, 747-759.

Crossref

Google Scholar

[74]

HOCHBAUM, D, AND SHMOYS, D 1988a A polynomial approximation scheme for scheduling on uniform processors using the dual approximation approach. SIAM J. Cornput. 17, 3, 539 551.

Crossref

Google Scholar

[75]

HOCHBAUM, D., AND SHMOYS, D. 1988b. Using dual approximatmn algorithms for scheduling problems: Theoretmal and practical results d. ACM 34, 1, 144-162.

Crossref

Google Scholar

[76]

Housq~Is, C. 1990. Module allocation of real-time applications to distributed systems. IEEE Trans. So~tw. Eng. SE-16, 7, 699 709

Crossref

Google Scholar

[77]

HOUSTJS, C., AND AEOELAZE, M. 1991. A comparative performance analysis of mapping applications to parallel nmltiprocessor systems: A case study J. Parall. D~strlb. Comput. 13, 1, 17-29.

Crossref

Google Scholar

[78]

Hu, T. 1961. Parallel sequencing and assembly line problems. Oper. Res. 9, 841-848.

Google Scholar

[79]

HWANQ, J.-J., CHOW, Y.-C., ANGER, F., AND LEE, C -Y 1989. Scheduling precedence graphs in systems with interprocessor communication times. SIAM J. Cornput. 18, 2, 244-257.

Crossref

Google Scholar

[80]

IEEE 1991. SCI, scalable coherent interconnect Tech. Rep. P1596/D1.98, IEEE Standards Department, IEEE, New York

Google Scholar

[81]

INDURKHYA, B, AND STONE, H. 1986 Optimal parhtioning of randomly generated parallel programs. IEEE Trans. Softw. Eng., SE-12, 3, 483 495

Crossref

Google Scholar

[82]

JOHNSSON, S 1990. Communication in network architectures. In VLSI and Parallel Computatzon. Morgan Kaufmann, Palo Alto, Cahf, 223 378.

Crossref

Google Scholar

[83]

JUNe, H., Kmousi~, L, AND SPmAKrS, P 1989. Lower bounds and efficient algorithms for multiprocessor scheduling of dags with commuication delays In Proceedmga of the ACM Symposmm on Parallel Algortthms and Archltectare.~. ACM, New York, 254-264.

Crossref

Google Scholar

[84]

KAFURA, D., AND SHEN, V. 1977. Task scheduling on a mult~processor system with independent meniories. SIAM J Compat 6, 1, 167 187

Google Scholar

[85]

KAPELNIKOV, A., MUNTZ, R, AND ERCEt~OW~.C, M. 1989 A modelling- methodology for the analysis of concurrent systems and computations d Parall. D~strzb Compat 6, 3, 568-597

Crossref

Google Scholar

[86]

KAUFMANN, M. 1974. An almost-optimal algorithm for the assembly line scheduhng problem. IEEE Trans Comput C-23, 11, 1169 1174

Google Scholar

[87]

KIM, S, .aND BROWNE, d. 1988 A general approach to mapping of parallel coniputatmns upon multiprocessor architectures. In the Internatmnal Conference on Parallel Proc'esszng 3. Penn State University Press, University Park. Penn, 1- 8.

Google Scholar

[88]

KR~,MER, O., AND MiJHLENBEIN, H. 1989. Mapping strategies in message-based multiprocessor systems. Parall. Comput. 9, 2, 213-225.

Google Scholar

[89]

KRISHNAMURTHY, S. 1990. A brief survey of papers on scheduling for pipelined processors. Sigplan Not. 25, 7, 97 106.

Crossref

Google Scholar

[90]

KRUATRACHUE, B., AND LEWIS, T. 1988. Grain size determination for parallel programming. IEEE Softw. 5, 1, 23-32.

Crossref

Google Scholar

[91]

LAM, S., AND SETm, R. 1977. Worst case analysis of two scheduling algorithms. SIAM J Comput. 6, 3,518 536.

Google Scholar

[92]

LAWLER, E. 1982. Preemptive scheduling of precedence constrained jobs on parallel machines. In Deterministic and Stochastic Scheduhng. D. Reidel Publishing Co, Dordrecht, Germany.

Google Scholar

[93]

LEE, C.-Y., HWANG, J.-J., CHOW, Y.-C., AND ANGER, F. 1988. Multiprocessor scheduling with interprocessor communication delays. Oper Res. Lett. 7, 3, 141-145.

Google Scholar

[94]

LEE, S., AND AOGARWAL, J. 1987. A mapping strategy for parallel computing. IEEE Trans. Comput. C-36, 4, 433 442.

Crossref

Google Scholar

[95]

LEICHTON, F. 1992. Introduction to Parallel Algorithms and Architectures. Morgan Kaufmann, San Mateo, Calif.

Crossref

Google Scholar

[96]

Lo, V. 1992. Temporal communication graphs: Lamport's process-time graphs augmented for the purpose of mapping and scheduling. Tech. Rep. CIS-TR-92-05, Univ. of Oregon, Eugene, O reg. To appear in J. Parall. Dzstrib. Comput.

Google Scholar

[97]

Lo, V. 1988. Heuristic algorithms for task assignment in distributed systems. IEEE Trans. Comput. 37, 11, 1384 1397.

Crossref

Google Scholar

[98]

MA, P.-Y., LEE, E., AND TSUCHIYA, M. 1982. A task allocation model for distributed computing systems. IEEE Trans. Compat. C-31, 1, 246-252.

Google Scholar

[99]

MAK, V., AND LUNDSTROM, S. 1990. Predicting performance of parallel computations. IEEE Trans. Parall. Distrib. Comput. 1, 3, 257-270.

Crossref

Google Scholar

[100]

MARTEL, C. 1988. A parallel algorithm for preemptive scheduling of uniform machines. J. Parall. Distrib. Comput. 5, 6, 700-715.

Crossref

Google Scholar

[101]

MARTIN, D., AND ESTRIN, G. 1967a. Experiments on models of computation and systems. IEEE Trans. Elect. Comput. EC-16, 1, 59 69.

Google Scholar

[102]

MARTIN, D., AND ESTRIN, G. 1967b. Models of computational systems--cyclic to acyclic graph transformations. IEEE Trans. Electr. Comput. EC-16, 1.

Google Scholar

[103]

McDOWELL, C., AND APPELBE, W. 1986. Processor scheduling for linearly connected parallel processors. IEEE Trans. Comput. C-35, 7,632-638.

Crossref

Google Scholar

[104]

MCGREARY, C., AND GILL, H. 1989. Automatic determination of grain size for efficient parallel programming. Commun. ACM 32, 9.

Crossref

Google Scholar

[105]

MCNAUGHTON, R. 1959. Scheduling with deadlines and loss functions. Manage. Sci. 6, 1, 1-12.

Google Scholar

[106]

MUNTZ,. R., AND COFFMAN, E., JR., 1969 Optimal preemptive scheduling on two-processor systems. IEEE Trans. Comput. C-18, 11, 1014 1020.

Google Scholar

[107]

NlCOL, D. 1989. Optimal partitioning of random programs across two processors. IEEE Trans. Softw. Eng. SE-15, 2, 134 141.

Crossref

Google Scholar

[108]

NICOL, D., AND SALTZ, J. 1990. An analysis of scatter decomposition. IEEE Trans. Comput C-39, 11, 1337 1345

Crossref

Google Scholar

[109]

NICOL, D., SIMHA, R., CHOUDHURY, A., AND NARAHARI, B. 1992. Optimal processor assignment for pipeline computations. Tech. Rep. 91-79, ICASE, NASA, Langley Research Center, Va.

Google Scholar

[110]

NORMAN, M., BOERES, C., AND THANISCH, P. 1990. Minimising message path lengths in multicomputers. Tech. Rep. EPCC-TR-90-17, Edinburgh Parallel Computing Centre, Univ. of Edmburgh, Scotland. Submitted to J. Parall. Dlstrtb. Comput.

Google Scholar

[111]

NORMAN, M., PELAGA'IWI, S., AND THANISCH, P. 1991. On the complexity of scheduling with communication delay and contention. Tech. Note EPCC-TN-91-15, Edinburgh Parallel Computing Centre, Univ. of Edinburgh, Scotland.

Google Scholar

[112]

PADUA, D., AND WOLFE, M. 1986. Advanced compiler ophmlzations for supercomputers. Commun. ACM 29, 12.

Crossref

Google Scholar

[113]

PAPADIMITRIOU, C. H., AND ULLMAN, J.D. 1987. A communication-time tradeoff. SIAM J. Camput. 16, 4, 639-646.

Crossref

Google Scholar

[114]

PAPAmMITRrOU, C. H., AND YANNAKAKIS, M. 1990. Towards an architecture-independent analysis of parallel algorithms. SIAM J. Comput. 19, 2, 322 328.

Crossref

Google Scholar

[115]

PEIR, J.-K., AND CYTRON, R. 1989. Minimum distance: A method for partitioning recurrences for multiprocessors. IEEE Trans. Comput. C- 38, 8.

Crossref

Google Scholar

[116]

PICOULEAU, C. 1992. New complexity results on the UET-UCT scheduling problem. In Proceedings of the Summer School on Scheduling Theory and its Apphcatzons (Chateau de Bonas, France). INRIA, Sophia Antipolis, France.

Google Scholar

[117]

PINTER, S., AND WOLFSTAHL, Y. 1987. On mapping processes to processors in distributed systems. Int. J. Parall. Program. 16, 1, 1-15.

Crossref

Google Scholar

[118]

PIPPENGER, N. 1979. On simultaneous resource bounds (preliminary version). In Proceedings of the 20th IEEE FOCS. IEEE, New York, 307 311.

Google Scholar

[119]

POLYCHRONOPOULOS, C. 1988. Parallel Programruing and Compilers. Kluwer Academic Publishers, Norwell, Mass.

Crossref

Google Scholar

[120]

POUNTAIN, R. 1989. Configuring parallel programs. Part 1. Byte 14, 12 (Dec.), 349-352.

Crossref

Google Scholar

[121]

PRITCHARD, D., ASKEW, C., CARPENTER, D., GLENDINNING, I., HEY, A., AND NICOLE, D. 1987. Practical parallelism using transputer arrays. In Parallel Architectures and Languagcs. Lecture Notes in Computer Science, Springer-Verlag, Berlin, 278.

Crossref

Google Scholar

[122]

RAMAMRITHAM, K., STANKOVIC, J, AND SHiAH, P-F. 1990. Efficient scheduling algorithms for multiprocessor systems. IEEE Trans Parall Dlstrib. Comput., 1, 2, 184-194

Crossref

Google Scholar

[123]

RAO, G., STONE, H., AND HU, T. 1979. Assignment of tasks in a dmtrlbuted processor system with hmited memory. IEEE Trans. Comput. C-28, 4, 291 298

Google Scholar

[124]

RAYWARD-SMITH, V. 1987a. The complexity of preemptive scheduling given interprocessor communication delays. Inf Process Lett. 25, 2, 123-125.

Crossref

Google Scholar

[125]

RAYWARD-SMITN, V. 1987b UET scheduling with umt interprocessor communication delays Dtscr. Appl. Moth 18, 1, 55 71

Crossref

Google Scholar

[126]

REED, D., AND FUJIMOTO, R. 1987. Multicomputer network operating systems. In Multlcomputer Networks: Message-Based Parallel Processing MIT Press, Cambridge Mass, 177-238

Google Scholar

[127]

SAHNI, S. 1976. Algorithms for scheduling independent tasks, d. ACM23, 1, 116-127

Crossref

Google Scholar

[128]

SARKAR, V 1989. Portttzonmg and Scheduhng Parallel Programs for Multzprocessors Pitman, London.

Crossref

Google Scholar

[129]

SCOTT, S., GOODMAN, J, AND VERNON, M. 1992 Performance of the SCI ring In Proceedings of the 19th Internatmnal Symposium on Cornputer Architecture. IEEE Computer Society Press, Los Alamitos, Calif., 403-414

Crossref

Google Scholar

[130]

SEITZ, C. 1990 Concurrent architectures In VLSI and Parallel Computation. Morgan Kaufmann, Palo Alto, Calif., 1-84.

Crossref

Google Scholar

[131]

SETm, R 1976 Algorithms for mimmal length schedules In Computer and Job Shop Scheduling Theory John Wiley, New York.

Google Scholar

[132]

StlEN, C.-C., AND TSAI, W.-H. 1985 A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion. IEEE Trans Comput. C-34, 3, 197-203.

Google Scholar

[133]

SHIRAZI, B., WANG, M., AND PATHAC, O. 1990. nalysis and evaluation of heuristic methods for static task scheduling', J Parall D~strzb Comput. 10, 3, 222-232.

Crossref

Google Scholar

[134]

SINCLAIR, J. 1987. Efficient computation of optimal assignments for distributed tasks J. Parall. D~strzb. Comput. 4, 4, 342 362

Crossref

Google Scholar

[135]

STONE, $. 1978. Critical load factors in dmtributed systems. IEEE Trans. Softw. Eng SE-4, 254-258.

Google Scholar

[136]

STONE, H. 1977a. Multiprocessor scheduling with the aid of network flow algorithms. IEEE Trans. Softw. Eng. SE-3, 85-93.

Google Scholar

[137]

STONE, H 1977b. Program assignment in three processor systems and tricutset partitioning of graphs. Tech Rep. ECE-CS-77-7, Univ. Massachusetts, Amherst, Mass.

Google Scholar

[138]

STOUT, Q., AND WAGAR, B. 1990. Intensive hypercube communication--prearranged communication in hnk-bound machines d Parall. Dzstrtb Comput. 10, 2, 167-181

Crossref

Google Scholar

[139]

TANENBAUM, A 1989. Computer Networks. Prent~ce-Hall, Englewood Cliffs, N.J.

Crossref

Google Scholar

[140]

THURIMELLA, R., AND YESHA, Y. 1992. A schedul mg principle fbr precedence graphs with communication delay In Proceedings of the International Conference on Parallel Processing CRC Press, III-229 III-236.

Google Scholar

[141]

TOWSLEY, D 1986. Allocating programs containing branches and loops within a multiple processor system. IEEE Trans. Softw Eng. SE-12, 10, 1018-1024.

Crossref

Google Scholar

[142]

UDIAVAR, N, AND STILES, G. 1990. A simple but flexible model for determining optimal task allocatmn and configuration on a network of transputers In Transputer Research and Appl~cahons 1. IOS, Amsterdam, 24-32

Crossref

Google Scholar

[143]

ULLMAN, J. 1975. NP-complete scheduling problems J. Comput. Svst. Scl. 10, 3, 384 393

Google Scholar

[144]

UPFAL, E. 1984 Efficient schemes for parallel communication J ACM 31, 4.

Crossref

Google Scholar

[145]

VALIANT, L. 1982. A scheme for fast parallel communication SIAM J Cornput 11, 2,350 361

Google Scholar

[146]

VALIANT, L., AND BREBNER, G. 1981 Umversa} schemes for parallel communication. In Proceedmgs of the 13th Annual ACM Symposlunz on ~heory of Computing. ACM, New York, 263-267.

Crossref

Google Scholar

[147]

VELTMAN, B., LAGI~}WE(~, B., AND LENSTRA, J. 1990 Multiprocessor scheduhng with communication delays. Parall. Comput. 16, 2 3, 173 182

Google Scholar

[148]

WAGNER, A., CHANSON, S., GOLDSTEIN, N., JIANG, J, LARSEN, H., AND SREEKANTASWAiVlY, H. 1991 TIPS: Transputer-based interactive parallehsing system. In Transputmg 1991. lOS, Amsterdam, 212 229.

Crossref

Google Scholar

[149]

WANG, Q, AND CHENG, K. 1992. A heuristic of scheduling parallel tasks and its analysis. SIAM J. Compal. 21, 2, 281-294.

Crossref

Google Scholar

[150]

WmMAMS, E. 1983. Assigning processes to processors in distributed systems. In Proceedings of the IEEE Con/krence on Parallel Processing. IEEE, New York, 404-406

Google Scholar

[151]

Wu, M.-Y., AND GAJSKL D 1988. A programming aid for hypercube architectures. J Supercomput. 2, 349-372.

Google Scholar

[152]

YANC'~, T., AND C-E RASOULI,% A 1902a DSC Scheduling parallel tasks on an unbounded number of processors. Tech. Rep., Dept. of Computer Science, Rutgers Umv.

Google Scholar

[153]

YANG, T., ANO GERASOUHS, A. 1992b. A parallel programming tool for scheduling on distributed memory multiprocessors In Proceedtngs of the Scalable Htgh Performance Computing Conference. IEEE Computer Society Press, Los Alamitos, Calif, 350 357.

Google Scholar

[154]

ZIMA, n., AND CHAPMAN, B. 1990. Superconzp,lers for Parallel and Vector Computers. ACM, New York.

Crossref

Google Scholar

Cited By

View all

Chauhdry M(2023)A framework using nested partitions algorithm for convergence analysis of population distribution-based methodsEURO Journal on Computational Optimization10.1016/j.ejco.2023.10006711(100067)Online publication date: 2023
https://doi.org/10.1016/j.ejco.2023.100067
Rbihou SJoudar NEn-Naimani ZHaddouch K(2023)Using Crank-Nicolson Scheme for Continuous Hopfield Network EquilibriumArtificial Intelligence and Industrial Applications10.1007/978-3-031-43520-1_17(201-210)Online publication date: 15-Sep-2023
https://doi.org/10.1007/978-3-031-43520-1_17
Roig CRipoll ALuque E(2016)Modeling Clustered Task Graphs for Scheduling Large Parallel Programs in Distributed SystemsSIMULATION10.1177/003754970404544480:4-5(243-254)Online publication date: 17-Aug-2016
https://doi.org/10.1177/0037549704045444
Show More Cited By

Index Terms

Models of machines and computation for mapping in multicomputers
1. Computer systems organization
  1. Architectures
    1. Parallel architectures
      1. Multiple instruction, multiple data

Recommendations

Models of computation for NoC mapping

A complex application implemented as a System-on-Chip (SoC) demands extensive system level modeling. Its implementation encompasses a large number of cores and an advanced interconnection scheme such as a Network-on-Chip (NoC). This type of application ...
Partitioning and mapping on NoC-Based MPSoC: an energy consumption saving approach
NoCArc '11: Proceedings of the 4th International Workshop on Network on Chip Architectures

Software complexity has increased considerably over recent years, needing special target architectures as MPSoCs to fulfill the heavy memory, communication and computation requirements. Nevertheless, the use of MPSoCs has brought attention to the need ...
Pre-mapping Algorithm for Heterogeneous MPSoCs
VLSID '14: Proceedings of the 2014 27th International Conference on VLSI Design and 2014 13th International Conference on Embedded Systems

A Multiprocessor System-on-Chip (MPSoC) composed of different types of processors is known as heterogeneous MPSoC. This kind of MPSoC based on Network-on-Chip (NoC) is a promising target architecture to fulfill requirements of high processing and ...

Comments

Information & Contributors

Information

Published In

ACM Computing Surveys Volume 25, Issue 3

Sept. 1993

145 pages

ISSN:0360-0300

EISSN:1557-7341

DOI:10.1145/158439

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1993

Published in CSUR Volume 25, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

128
Total Citations
View Citations
1,223
Total Downloads

Downloads (Last 12 months)46
Downloads (Last 6 weeks)5

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chauhdry M(2023)A framework using nested partitions algorithm for convergence analysis of population distribution-based methodsEURO Journal on Computational Optimization10.1016/j.ejco.2023.10006711(100067)Online publication date: 2023
https://doi.org/10.1016/j.ejco.2023.100067
Rbihou SJoudar NEn-Naimani ZHaddouch K(2023)Using Crank-Nicolson Scheme for Continuous Hopfield Network EquilibriumArtificial Intelligence and Industrial Applications10.1007/978-3-031-43520-1_17(201-210)Online publication date: 15-Sep-2023
https://doi.org/10.1007/978-3-031-43520-1_17
Roig CRipoll ALuque E(2016)Modeling Clustered Task Graphs for Scheduling Large Parallel Programs in Distributed SystemsSIMULATION10.1177/003754970404544480:4-5(243-254)Online publication date: 17-Aug-2016
https://doi.org/10.1177/0037549704045444
Herrmann JBosilca GHérault TMarchal LRobert YDongarra J(2016)Assessing the cost of redistribution followed by a computational kernelParallel Computing10.1016/j.parco.2015.09.00552:C(22-41)Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1016/j.parco.2015.09.005
Tianxue DXiaojun ZChunhua YWeihua G(2015)A discrete state transition algorithm for the task assignment problem2015 34th Chinese Control Conference (CCC)10.1109/ChiCC.2015.7260049(2692-2697)Online publication date: Jul-2015
https://doi.org/10.1109/ChiCC.2015.7260049
Herault THerrmann JMarchal LRobert Y(2014)Determining the Optimal Redistribution for a Given Data PartitionProceedings of the 2014 IEEE 13th International Symposium on Parallel and Distributed Computing10.1109/ISPDC.2014.16(95-102)Online publication date: 24-Jun-2014
https://dl.acm.org/doi/10.1109/ISPDC.2014.16
Ben Dhaou MFayard D(2014)The Task Allocation ProblemApplications of Combinatorial Optimization10.1002/9781119005384.ch2(23-47)Online publication date: 8-Aug-2014
https://doi.org/10.1002/9781119005384.ch2
(2014)General BibliographyApplications of Combinatorial Optimization10.1002/9781119005384.biblio(365-399)Online publication date: 8-Aug-2014
https://doi.org/10.1002/9781119005384.biblio
Ben Dhaou MFayard D(2013)The Task Allocation ProblemApplications of Combinatorial Optimization10.1002/9781118600283.ch2(23-47)Online publication date: 13-Feb-2013
https://doi.org/10.1002/9781118600283.ch2
López MCastro LCabrero DDe Schreye DJanssens GKing A(2012)Declarative distributed advertisement system for iDTVProceedings of the 14th symposium on Principles and practice of declarative programming10.1145/2370776.2370800(185-194)Online publication date: 19-Sep-2012
https://dl.acm.org/doi/10.1145/2370776.2370800
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Models of computation for NoC mapping

Partitioning and mapping on NoC-Based MPSoC: an energy consumption saving approach

Pre-mapping Algorithm for Heterogeneous MPSoCs

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations