This Article 
 Bibliographic References 
 Add to: 
Module Allocation of Real-Time Applications to Distributed Systems
July 1990 (vol. 16 no. 7)
pp. 699-709

An allocation model for mapping a real-time application to certain k-processor multiprocessor systems is developed and analyzed. Its objective is minimizing the total processing time of the application by exploiting the parallelism of the application-architecture pair. The model is formulated in terms of the performance characteristics of the system and the resource requirements of the computation involved. Experience with the model suggests that it can be used effectively for the performance evaluation of application-distributed system pairss.

[1] G. A. Anderson and E. D. Jensen, "Computer interconnection networks: Taxonomy, characteristics and examples,"ACM Comput. Surveys, vol. 7, pp. 197-213, Dec. 1975.
[2] D. P. Batra, "Architectural implications of problem partitioning for distributed processor systems," Ph.D. dissertation. Dep. Comput. Sci., Northwestern Univ.. Evanston, IL. June 1978.
[3] Bokhari. "On the mapping problem,"IEEE Trans. Comput., vol. C- 30. no. 3, pp. 207-211, 1981.
[4] B. P. Buklea and D. M. Hardin, "Partitioning and allocation of logical resources in a distributed computing environment," inTutorial: Distributed System Design. Washington. DC: IEEE Comput. Soc., 1979.
[5] W. W. Chu. L. J. Holloway, M. T. Lan, and K. Efe, "Task allocation in distributed data processing,"Computer, pp. 57-69, Nov. 1980.
[6] W. W. Chu and L. M.-T. Lan, "Task allocation and precedence relations for distributed real-time systems,"IEEE Trans. Comput., vol. C-36, pp. 667-679, June 1987.
[7] K. Efe, "Heuristic models of task assignment scheduling in distributed systems,"Computer. vol. 15, no. 6, pp. 50-56, June 1982.
[8] R. M. Fujimato, "The SIMON simulation and development system," inProc. Summer Computer Simulation Conf., 1985.
[9] V. B. Gylys and J. A: Edwards. "Optimal partitioning of workload for distributed systems," inProc. Compcon, Fall 1976, pp. 353-357.
[10] E. Gelenbeet al., "The asymptotic processing time for model of parallel computation," inProc. Nat. Computer Conf., Las Vegas, NV. Nov. 1988.
[11] E. Gelenbe and Z. Liu. "Performance analysis approximations for parallel processing in multiprocessor systems," inParallel Processing, M. Cosnard, Ed. Amsterdam, The Netherlands: Elsevier Science. 1988.
[12] K. Haessig and C. J. Jenny, "Partitioning and allocation computational objects in distributed computing systems," inProc. IFIP Congr., 1980, pp. 593-598.
[13] C. E. Houstis. "Software partitioning in a distributed environment," College Eng., Univ. South Carolina. Columbia, Tech. Rep., Sept, 1982.
[14] C. E. Houstis, E. N. Houstis. and J. Rice, "Partitioning PDE computation: Methods and performance evaluation," invited paper,J. Parallel Comput., to be published.
[15] C. Houstis, E. Houstis, J. Rice, D. Alexandrakis, and M. Samartzis, "Modeling and evaluation of parallel application/architecture pairs using the algorithm mapper," Dep. Elec. Eng., Purdue Univ., W. Lafayette, IN. Tech. Rep., Aug. 1988.
[16] M. Iqbul, Y. Saltz, and S. Bokhari, "A comparative analysis of static and dynamic load balancing strategies," inProc. Int. Conf. Parallel Processing. 1986, pp. 1040-1045.
[17] C. J. Jenny, "Process partitioning on distributed systems," inDig. Papers. NTC, 1977, pp. 31-1-31-10.
[18] C. J. Jenny, "On the placement of files and processes in a system with distributed intelligence," inProc. Int. Zurich Seminar Digital Communnications. Mar. 1982, pp. B1.1-B1.8.
[19] A. K. Jones and K. Schwan, "TASK forces: Distributed software for solving problems of substantial size." inProc. 4th Int. Conf. Software Engineering, ACM, GI, IEEE, Munich, West Germany, Sept. 14-16, 1979, pp. 315-329.
[20] L. Kleinrock,Queueing Systems. vol. 1. New York: Wiley Interscience. 1974.
[21] H. Li, "The impact of process intercommunication on the global bus architecture," inIEEE Proc. Real-Time Systems, 1981, pp. 29-31.
[22] T. C. Lowe, "Analysis of an Information system model wtth transfer penalties,"IEEE Trans. Comput., vol. C-22, no. 5, pp. 269-280, May 1973.
[23] P. Ma, E. Y. S. Lee, and M. Tsuchiya, "On the design of a task allocation scheme for time-critical applications," inIEEE Proc. Real-Time Systems, 1981, pp. 121-126.
[24] M. A. Marsan, G. Balbo, and G. Conte, "Comparative performance analysis of single bus multiprocessor architectures,"IEEE Trans. Comput., vol. C-31, no. 12, Dec. 1982.
[25] M. A. Marsan and M. Gerla, "Markov models for multiple bus multiprocessor systems,"IEEE Trans. Comput., vol. C-31, no. 3, pp. 239-248, Mar. 1983.
[26] M. A. Marsan, Cl. Balbo, G. Conte, and F. Gregoretti, "Modeling bus contention and memory interference in a multiprocessor system,"IEEE Trans. Comput., vol. C-32, no. 1, pp. 60-72, Jan. 1983.
[27] M. A. Marsan and F. Gregoretti, "Memory interference models for a multimicroprocessor system with a shared bus and a single external common memory,"EUROMICROJ., pp. 124-133, Feb. 1981.
[28] R. M. Stevens. "A Pascal program which partitions programs for a multiprocessor system," Master's thesis, Dep. Elcc. Comput. Eng., Univ. South Carolina. Columbia, May 1982.
[29] H. S. Stone and S. H. Bokhari, "Control of distributed processes,"Comput, vol. 11, no. 7, pp. 97-106, July 1978.
[30] H. S. Stone, "Multiprocessor scheduling with the aid of network Row algorithms,"IEEE Trans. Software Eng., vol. SE-3, no. 1, pp. ES- 93, Jan. 1977.
[31] E. A. Williams, "Assigning processes to processors in distributed systems," inProc. IEEE Conf. Parallel Processing. Bellair. MI. 1983, pp. 404-406.

Index Terms:
module allocation; real-time applications; distributed systems; mapping; k-processor multiprocessor systems; parallelism; application-architecture pair; performance characteristics; performance evaluation; distributed processing; multiprocessing systems; performance evaluation; real-time systems.
C.E. Houstics, "Module Allocation of Real-Time Applications to Distributed Systems," IEEE Transactions on Software Engineering, vol. 16, no. 7, pp. 699-709, July 1990, doi:10.1109/32.56096
Usage of this product signifies your acceptance of the Terms of Use.