Carpet(ID:6227/car004)

parallel language 

parallel language
References:
  • Cannataro, M.; Di Gregorio, S.; Rongo, R.; Spataro, W.; Spezzano, G.; Talia, D. "A parallel cellular automata environment on multicomputers for computational science", Parallel Computing, v.21 n.5, p.803-823, May 1995 view details
  • Spezzano, G. and Talia, D. "A high-level cellular programming model for massively parallel processing" view details
          in Workshop on High-level Parallel Programming Models (HIPS'97), . IEEE Computer Science Press, Geneva, Switzerland, April 1997 view details
  • Folino, G.; Pizzuti, C. and Spezzano, G. "Solving the satisfiability problem by a parallel cellular genetic algorithm" Proc. of Euromicro Workshop on Computational Intelligence, IEEE Computer Society Press, 1998 view details
          in Workshop on High-level Parallel Programming Models (HIPS'97), . IEEE Computer Science Press, Geneva, Switzerland, April 1997 view details
  • Skillicorn, David B. and Talia, Domenico "Models and languages for parallel computation" pp123-169 view details Abstract: We survey parallel programming models and languages using six criteria to assess their suitability for realistic portable parallel programming. We argue that an ideal model should by easy to program, should have a software development methodology, should be architecture-independent, should be easy to understand, should guarantee performance, and should provide accurate information about the cost of programs. These criteria reflect our belief that developments in parallelism must be driven by a parallel software industry based on portability and efficiency. We consider programming models in six categories, depending on the level of abstraction they provide. Those that are very abstract conceal even the presence of parallelism at the software level. Such models make software easy to build and port, but efficient and predictable performance is usually hard to achieve. At the other end of the spectrum, low-level models make all of the messy issues of parallel programming explicit (how many threads, how to place them, how to express communication, and how to schedule communication), so that software is hard to build and not very portable, but is usually efficient. Most recent models are near the center of this spectrum, exploring the best tradeoffs between expressiveness and performance. A few models have achieved both abstractness and efficiency. Both kinds of models raise the possibility of parallelism as part of the mainstream of computing. DOI
          in [ACM] ACM Computing Surveys (CSUR) 30(2) June 1998 view details
  • Spezzano, Giandomenico and Talia, Domenico "The carpet programming environment for solving scientific problems on parallel computers" in Virtual shared memory for distributed architectures Nova Science Publishers, Inc. Commack, NY, USA 2001 pp51-68 view details
          in [ACM] ACM Computing Surveys (CSUR) 30(2) June 1998 view details