Abstract
The Network of Tasks (NOT) model allows adaptive node programs written in a variety of parallel languages to be connected together in an almost acyclic task graph. The main difference between NOT and other task graphs is that it is designed to make the performance of the graph predictable from knowledge of the performance of the component node programs and the visible structure of the graph. It can therefore be regarded as a coordination language that is transparent about performance. For large-scale computations that are distributed to geographically-distributed compute servers, the NOT model helps programmers to plan, assemble, schedule, and distribute their problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Ahuja, N. Carriero, D. Gelernter, and V. Krishnaswamy, “Matching languages and hardware for parallel computation in the Linda machine.” IEEE Transactions on Computers, 37(8), pp. 921–929, August 1988.
B. Bacci, M. Danelutto, S. Pelagatti, and M. Vanneschi, “SkIE: an heterogeneous HPC environment.” Parallel Computing, 25(13-14), pp. 1827–1852, December 1999.
H. E. Bal and M. Haines, “Approaches for integrating task and data parallelism.” IEEE Concurrency, 6(3), pp. 74–84, July-August 1998.
A. Baratloo, P. Dasgupta, and Z. Kedem, “Calypso: A novel software system for fault-tolerant parallel processing on distributed platforms,” in Proceedings of the 4th IEEE International Symposium on High Performance Distributed Computing, 1995.
R. S. Bird, “Algebraic identities for program calculation.” The Computer Journal, 32(2), pp. 122–126, February 1989.
R. P. Brent, “The parallel evaluation of general arithmetic expressions.” Journal of the ACM, 21(2), pp. 201–206, April 1974.
N. Carriero and D. Gelernter, “Application experience with Linda,” in ACM/SIGPLAN Symposium on Parallel Programming, 23, pp. 173–187, July 1988.
B. Chapman, P. Mehrotra, J. Van Rosendale, and H. Zima, “A software architecture for multidisciplinary applications: Integrating task and data parallelism.” Technical Report 94-18, NASA Institute for Computer Applications ICASE, March 1994.
M. Danelutto, F. Pasqualetti, and S. Pelagatti, “Skeletons for data parallelism in p3l,” in C. Lengauer, M. Griebl, and S. Gorlatch (eds.), Proceedings of Europar '97, Vol. 1300of LNCS, pp. 619–628. Springer-Verlag, August 1997.
P. Dinda, T. Gross, D. O'Hallaron, E. Segall, J. Stichnoth, J. Subholk, J. Webb, and B. Yang, “The CMU task parallel program suite.” Technical Report CMU-CS-94-131, School of Computer Science, Carnegie-Mellon University, March 1994.
S. R. Donaldson, J. M. D. Hill, and D. B. Skillicorn, “BSP clusters: High-performance, reliable, and very low cost.” Technical Report PRG-TR-5-98, Oxford University Computing Laboratory, 1998.
I. Foster and C. Kesselman, “The Globus project: A status report,” in IPPS/SPDP'99 Workshop on Heterogeneous Computing, pp. 4–18, April 1998.
M. Goudreau, K. Lang, S. Rao, T. Suel, and T. Tsantilas, “Towards efficiency and portability: Programming the BSP model,” in Proceedings of the 8th Annual Symposium on Parallel Algorithms and Architectures, pp. 1–12, June 1996.
J. M. D. Hill, P. I. Crumpton, and D. A. Burgess, “The theory, practice, and a tool for BSP performance prediction applied to a CFD application.” Technical Report TR-4-96, Programming Research Group, Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, England. OX1 3QD, February 1996.
J. M. D. Hill, S. R. Donaldson, and D. B. Skillicorn, “Stability of communication performance in practice: from the Cray T3E to networks of workstations.” Technical Report PRG-TR-33-97, Oxford University Computing Laboratory, October 1997.
C. Morgan. Programming from Specifications. Prentice-Hall International, 1990.
S. Orlando and R. Perego, “COLTHPF, a run-time support for the high-level coordination of HPF tasks.” Concurrency: Practice and Experience, 11(8), pp. 407–434, 1999.
C. H. Papadimitriou and M. Yannakakis, “Towards an architecture-independent analysis of parallel algorithms.” SIAM Journal on Computing, 19(2), pp. 322–328, April 1990.
T. Rauber and G. Rünger, “A coordination language for mixed task and data parallel programs,” in Proceedings of ACM Symposium on Applied Computing SAC'99, Feb/Mar 1999.
J. Reed, K. Parrott, and T. Lanfear, “Portability, predictability and performance for parallel computing: BSP in practice.” Concurrency: Practice and Experience, 8(10), pp. 799–812, December 1996.
D. B. Skillicorn, “The Network of Tasks model,” in Proceedings of Parallel and Distributed Computing and Systems 1999, Boston, MA, November to appear. IASTED.
D. B. Skillicorn, M. Danelutto, S. Pelagatti, and A. Zavanella, “Optimising data-parallel programs using the BSP cost model,” in Europar'98, pp. 698–703, September 1998.
D. B. Skillicorn, J. M. D. Hill, and W. F. McColl, “Questions and answers about BSP.” Scientific Programming, 6(3), 249–274, 1997.
D. B. Skillicorn and S. Pelagatti, “Building programs in the network of tasks model,” in Proceedings of the ACM Symposium on Applied Computing, April 2000.
J. Subhlok, D. O'Hallaron, and T. Gross, “Task parallel programming in Fx.” Technical Report CMU-CS-94-112, School of Computer Science, Carnegie-Mellon University, January 1994.
J. Subhlok and B. Yang, “A new model for integrated nested task and data parallel programming,” in Proceedings of the Sixth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), pp. 1–12, Las Vegas, NV, June 1997.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pelagatti, S., Skillicorn, D.B. Coordinating Programs in the Network of Tasks Model. Journal of Systems Integration 10, 107–126 (2001). https://doi.org/10.1023/A:1011228808844
Issue Date:
DOI: https://doi.org/10.1023/A:1011228808844