|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| D. Ghosal, L.N. Bhuyan, "Performance Evaluation of a Dataflow Architecture," IEEE Transactions on Computers, vol. 39, no. 5, pp. 615-627, May, 1990. | |||
| BibTex | x | ||
| @article{ 10.1109/12.53575, author = {D. Ghosal and L.N. Bhuyan}, title = {Performance Evaluation of a Dataflow Architecture}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {5}, issn = {0018-9340}, year = {1990}, pages = {615-627}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.53575}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Performance Evaluation of a Dataflow Architecture IS - 5 SN - 0018-9340 SP615 EP627 EPD - 615-627 A1 - D. Ghosal, A1 - L.N. Bhuyan, PY - 1990 KW - dataflow architecture; formulation; validation; performance evaluation; Manchester dataflow computer; closed queuing network models; average parallelism; closed network; prototype machine; parallel architectures; performance evaluation; queueing theory. VL - 39 JA - IEEE Transactions on Computers ER - | |||
The formulation and validation of an analytical approach for the performance evaluation of the Manchester dataflow computer is discussed. The analytical approach is based on closed queuing network models. The average parallelism of the dataflow graph being executed on the dataflow architecture is shown to be related to the population of the closed network. The model of the dataflow computer is validated by comparing the analytical results to those obtained from the prototype Manchester dataflow computer and from simulation. The bottleneck centers in the prototype machine have been identified through the model, and various architectural modifications have been investigated from performance considerations.
[1] S. C. Agrawal,Metamodeling: A Study of Approximation in Queueing Models. Cambridge, MA: Computer System Series, MIT Press, 1985.
[2] Arvind and V. Kathail, "A multiple processor data flow machine that supports generalized procedures," inProc. 8th Int. Symp. Comput. Architecture, May 1981.
[3] Arvind and K. P. Gostelow, "TheU-interpreter,"IEEE Comput. Mag., vol. 15, no. 2, pp. 42-49, Feb. 1982.
[4] Arvind and D. E. Culler, "Dataflow architectures," MIT/LCS/TM- 294, Lab. For Comput. Sci., MIT, Feb. 1986.
[5] J. Backus, "Can programming be liberated from the von Neumann style? A functional style and its algebra of programs,"Commun. ACM, vol. 21, no. 8, pp. 613-641, Aug. 1978.
[6] P. M. C. C. Barahona and J. R. Gurd, "Processor allocation in a multi-ring dataflow machine,"J. Parallel Distributed Comput., vol. 3, pp. 67-85, 1986.
[7] F. J. Berkowski, "A multiuser dataflow architecture," inProc. 8th Annu. Symp. Comput. Architecture, May 1981, pp. 327-340.
[8] W. W. Carlson and K. Hwang, "Algorithmic performance of dataflow multiprocessor,"IEEE Comput. Mag., vol. 18, no. 12, pp. 30-40, Dec. 1985.
[9] D. Comte, N. Hifdi, and J. C. Syre, "The data driven LAU multiprocessor system: Results and perspectives," inProc. IFIP Congress, 1980, pp. 175-180.
[10] A. L. Davis and R. M. Keller, "Dataflow program graphs,"IEEE Comput. Mag., vol. 15, no. 2, pp. 26-41, Feb. 1982.
[11] J.B. Dennis and D.P. Misunas, "A Preliminary Architecture for a Basic Data-Flow Processor,"Proc. Second Int'l Symp. Computer Architecture, IEEE CS Press, Los Alamitos, Calif., Order No. M-096 (microfiche), 1975, pp. 126-132.
[12] J. B. Dennis, "Dataflow supercomputers,"IEEE Comput. Mag., vol. 13, no. 11, pp. 362-376, Nov. 1980.
[13] D. L. Eager, J. Zahorjan, and E. D. Lazowska, "Speedup versus efficiency in parallel systems," TR-86-08-01, Dep, Comput. Sci., Univ. of Washington, Seattle, 1986.
[14] D. Ghosal and L. N. Bhuyan, "Analytical modeling and architectural modifications of a dataflow computer," inProc. 14th Annu. Symp. Comput. Architecture, June 1987, pp. 81-89.
[15] K. P. Gostelow and R. E. Thomas, "Performance of simulated dataflow computer,"IEEE Trans. Comput., vol. C-29, no. 10, pp. 905-919, Oct. 1980.
[16] J. R. Gurd and I. Watson, "A practical dataflow computer,"IEEE Comput. Mag., vol. 15, no. 2, pp. 51-58, Feb. 1982.
[17] J. R. Gurd, C. C. Kirkham, and I. Watson, "The Manchester prototype dataflow computer,"Commun. ACM, vol. 28, no. 1, pp. 34-52, Jan. 1985.
[18] P. Heidelberger and K. S. Trivedi, "Analytical queueing models for programs with internal concurrency,"IEEE Trans. Comput., vol. C-30, no. 1, pp. 73-82, Jan. 1983.
[19] K. Hwang and F. A. Briggs,Parallel Processing and Computer Architecture. New York: McGraw-Hill, Apr. 1984.
[20] R. M. Keller, G. Lindstrom, and S. Patil, "A loosely coupled applicative multiprocessing system," inIFIPS Conf. Proc., vol. 48, June 1979, pp. 613-622.
[21] E. D. Lazawskaet al., Quantitative System Performance--Computer System Analysis Using Queueing Network Models. Englewood Cliffs, NJ: Prentice-Hall, 1984.
[22] J. Ortega and W. Rheinboldt,Iterative Solution of Nonlinear Equations in Several Variables. New York: Academic, 1970.
[23] L. M. Patnaik, R. Govindarajan, and N. S. Ramdoss, "Design and performance evaluation of EXMAN: An extended Manchester dataflow computer,"IEEE Trans. Comput., vol. C-35, no. 3, pp. 229-243, Mar. 1986.
[24] J. E. Rambaugh, "A dataflow multiprocessor,"IEEE Trans. Comput., vol. C-26, pp. 138-146, Feb. 1977.
[25] M. Reiser, "A queueing network analysis of computer communication networks with window flow control,"IEEE Trans. Commun., vol. COM- 27, Aug. 1979.
[26] C. H. Sauer and K. M. Chandy,Computer Systems Performance Modeling. Englewood Cliffs, NJ: Prentice-Hall, 1981.
[27] J. G. D. da Silva and I. Watson, "Pseudo-associative store with hard-ware hashing,"IEE Proc., vol. 130, pt. 3, no. 1, pp. 19-24, Jan 1983.
[28] P. C. Treleaven, D. R. Brownbridge, and R. P. Hopkins, "Data-driven and demand-driven computer architecture,"ACM Comput. Surveys, vol. 14, pp. 93-143, Mar. 1982.
[29] K. S. Trivedi,Probability and Statistics with Reliability, Queueing and Computer Science Applications. Englewood Cliffs, NJ: Prentice-Hall, 1982.