CONCURRENCY CONUNDRUMS - An Ontological Solution?

Celina Gibbs, Yvonne Coady

2010

Abstract

The arrival of a new era of programming, where developers must consider the subtitles of concurrency inherent in modern many-core architectures, calls for a revamping ranging from fundamental pedagogical processes to software development tools. The problem here is twofold: (1) corresponding real-world scenarios, commonly leveraged in pedagogical practices, contain implicit relationships that are significantly harder to explicitly anticipate in complex code-bases, and (2) the growing plethora of parallel programming language mechanisms collectively blur and distort the common core entities and relationships involved. As a possible solution, this paper proposes a general ontology for reasoning through concurrency conundrums at both high and low levels. The entities and relationships are originally established based on real-world scenarios presented to a group of grade seven students. The ontology is further developed, and implicit relationships revealed, based on an analysis student observations. The ontology is further developed and implicit relationships revealed. The goal of this work is form a basis for cognitive support that will map equally well to both generalized real-world scenarios and detailed code in different programming languages.

References

  1. Amdahl, G. M. (2000). Validity of the single processor approach to achieving large scale computing capabilities. Readings in computer architecture, pages 79-81.
  2. Appavoo, J., Uhlig, V., and Waterland, A. (2008). Building a Global-Scale Computer. SIGOPS Operating System Review, 42(1):77-84.
  3. Asanovic, K., Bodik, R., Catanzaro, B. C., Gebis, J. J., Husbands, P., Keutzer, K., Patterson, D. A., Plishker, W. L., Shalf, J., Williams, S. W., and Yelick, K. A. (2006). The Landscape of Parallel Computing Research: A View from Berkeley. Technical Report UCB/EECS-2006-183, EECS Department, University of California, Berkeley.
  4. Gunion, K. (2009). FUNdamentals of CS: Designing and Evaluating Computer Science Activities for Kids. Master's thesis, Department of Computer Science, University of Victoria.
  5. Nvidia (2008). The Nvidia Tesla Supercomputer. http://www.nvidia.com/object/personal supercompu ting.html.
  6. Pancake, C. M. and Bergmark, D. (1990). Do parallel languages respond to the needs of scientific programmers? Computer, 23:13-23.
  7. Shah, N., Plishker, W., and Keutzer, K. (2003). NP-Click: A Programming Model for the Intel IXP1200. In 2nd Workshop on Network Processors (NP-2) at the 9th International Symposium on High Performance Computer Architecture (HPCA-9), Anaheim, CA.
  8. Sutter, H. (2005). The Free Lunch Is Over: A Fundamental Turn Toward Concurrency in Software. Dr. Dobb's Journal, 30(3).
Download


Paper Citation


in Harvard Style

Gibbs C. and Coady Y. (2010). CONCURRENCY CONUNDRUMS - An Ontological Solution? . In Proceedings of the International Conference on Knowledge Engineering and Ontology Development - Volume 1: KEOD, (IC3K 2010) ISBN 978-989-8425-29-4, pages 305-310. DOI: 10.5220/0003104203050310


in Bibtex Style

@conference{keod10,
author={Celina Gibbs and Yvonne Coady},
title={CONCURRENCY CONUNDRUMS - An Ontological Solution?},
booktitle={Proceedings of the International Conference on Knowledge Engineering and Ontology Development - Volume 1: KEOD, (IC3K 2010)},
year={2010},
pages={305-310},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003104203050310},
isbn={978-989-8425-29-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Knowledge Engineering and Ontology Development - Volume 1: KEOD, (IC3K 2010)
TI - CONCURRENCY CONUNDRUMS - An Ontological Solution?
SN - 978-989-8425-29-4
AU - Gibbs C.
AU - Coady Y.
PY - 2010
SP - 305
EP - 310
DO - 10.5220/0003104203050310