Relevant bibliographies by topics / Parallel programming (Computer science)

Academic literature on the topic 'Parallel programming (Computer science)'

Author: Grafiati
Published: 4 June 2021
Last updated: 30 July 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Parallel programming (Computer science).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Parallel programming (Computer science)"

1

Shiau, Liejune. "Exploring Quasi-Concurrency in Introductory Computer Science." Journal of Educational Computing Research 15, no. 1 (July 1996): 53–66. http://dx.doi.org/10.2190/7ldf-va2r-vk66-qq8d.

Full text
Abstract:
Most programming courses taught today are focused on managing batch-oriented problems. It is primarily because parallel computers are not commonly available, therefore problems with concurrent nature could not be explored. This consequence, at the same time, causes student's under preparation to meet the challenge of modern multi-process computation technologies. This article demonstrates an easy solution for implementing concurrent programming projects in computer labs. This solution does not require special hardware support or special programming languages. The goal is to facilitate a means to deal with the concept and usefulness of multi-process software systems in the early stage of computer science curriculum. We also include detailed descriptions on a few creative and interesting concurrent examples to illustrate this idea.
APA, Harvard, Vancouver, ISO, and other styles
2

Graham, John R. "Integrating parallel programming techniques into traditional computer science curricula." ACM SIGCSE Bulletin 39, no. 4 (December 2007): 75–78. http://dx.doi.org/10.1145/1345375.1345419.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

MORIARTY, K. J. M., and T. TRAPPENBERG. "PROGRAMMING TOOLS FOR PARALLEL COMPUTERS." International Journal of Modern Physics C 04, no. 06 (December 1993): 1285–94. http://dx.doi.org/10.1142/s0129183193001002.

Full text
Abstract:
Although software tools already have a place on serial and vector computers they are becoming increasingly important for parallel computing. Message passing libraries, parallel operating systems and high level parallel languages are the basic software tools necessary to implement a parallel processing program. These tools up to now have been specific to each parallel computer system and a short survey will be given. The aim of another class of software tools for parallel computers is to help in writing or rewriting application programs. Because automatic parallelization tools are not very successful, an interactive component has to be incorporated. We will concentrate here on the discussion of SPEFY, a parallel program development facility.
APA, Harvard, Vancouver, ISO, and other styles
4

Clark, K. L. "Parallel Logic Programming." Computer Journal 33, no. 6 (June 1, 1990): 482–93. http://dx.doi.org/10.1093/comjnl/33.6.482.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Blelloch, Guy E. "Programming parallel algorithms." Communications of the ACM 39, no. 3 (March 1996): 85–97. http://dx.doi.org/10.1145/227234.227246.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ben Ahmed, M. "Parallel programming." Information and Software Technology 32, no. 6 (July 1990): 445. http://dx.doi.org/10.1016/0950-5849(90)90136-f.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Anthes, Gary. "Researchers simplify parallel programming." Communications of the ACM 57, no. 11 (October 27, 2014): 13–15. http://dx.doi.org/10.1145/2667109.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ben Ahmed, M. "Programming parallel processors." Information and Software Technology 32, no. 9 (November 1990): 638–39. http://dx.doi.org/10.1016/0950-5849(90)90213-b.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

SHEERAN, MARY. "Functional and dynamic programming in the design of parallel prefix networks." Journal of Functional Programming 21, no. 1 (December 6, 2010): 59–114. http://dx.doi.org/10.1017/s0956796810000304.

Full text
Abstract:
AbstractA parallel prefix network of width n takes n inputs, a1, a2, . . ., an, and computes each yi = a1 ○ a2 ○ ⋅ ⋅ ⋅ ○ ai for 1 ≤ i ≤ n, for an associative operator ○. This is one of the fundamental problems in computer science, because it gives insight into how parallel computation can be used to solve an apparently sequential problem. As parallel programming becomes the dominant programming paradigm, parallel prefix or scan is proving to be a very important building block of parallel algorithms and applications. There are many different parallel prefix networks, with different properties such as number of operators, depth and allowed fanout from the operators. In this paper, ideas from functional programming are combined with search to enable a deep exploration of parallel prefix network design. Networks that improve on the best known previous results are generated. It is argued that precise modelling in a functional programming language, together with simple visualization of the networks, gives a new, more experimental, approach to parallel prefix network design, improving on the manual techniques typically employed in the literature. The programming idiom that marries search with higher order functions may well have wider application than the network generation described here.
APA, Harvard, Vancouver, ISO, and other styles
10

Nowicki, Marek, Magdalena Ryczkowska, Łukasz Gorski, Michał Szynkiewicz, and Piotr Bała. "PCJ - a Java Library for Heterogenous Parallel Computing." WSEAS TRANSACTIONS ON COMPUTERS 21 (March 23, 2022): 81–87. http://dx.doi.org/10.37394/23205.2022.21.12.

Full text
Abstract:
Marek Nowicki, MagdaWith the wide adoption of the multicore and multiprocessor systems the parallel programming became a very important element of the computer science. The programming of the multicore systems is still complicated and far to be easy. The difficulties are caused, amongst others, by the parallel tools, libraries and programming models which are not easy especially for a nonexperienced programmer. In this paper, we present PCJ - a Java library for parallel programming of heterogeneous multicore systems. The PCJ is adopting Partitioned Global Address Space paradigm which makes programming easy. We present basic functionality pf the PCJ library and its usage for parallelization of selected applications. The scalability of the genetic algorithm implementation is presented. The parallelization of the N-body algorithm implementation with PCJ is also described.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Parallel programming (Computer science)"

1

Gamble, James Graham. "Explicit parallel programming." Thesis, This resource online, 1990. http://scholar.lib.vt.edu/theses/available/etd-06082009-171019/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Roe, Paul. "Parallel programming using functional languages." Thesis, Connect to e-thesis, 1991. http://theses.gla.ac.uk/1052.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Handler, Caroline. "Parallel process placement." Thesis, Rhodes University, 1989. http://hdl.handle.net/10962/d1002033.

Full text
Abstract:
This thesis investigates methods of automatic allocation of processes to available processors in a given network configuration. The research described covers the investigation of various algorithms for optimal process allocation. Among those researched were an algorithm which used a branch and bound technique, an algorithm based on graph theory, and an heuristic algorithm involving cluster analysis. These have been implemented and tested in conjunction with the gathering of performance statistics during program execution, for use in improving subsequent allocations. The system has been implemented on a network of loosely-coupled microcomputers using multi-port serial communication links to simulate a transputer network. The concurrent programming language occam has been implemented, replacing the explicit process allocation constructs with an automatic placement algorithm. This enables the source code to be completely separated from hardware considerations
APA, Harvard, Vancouver, ISO, and other styles
4

Bergstrom, Lars. "Parallel functional programming with mutable state." Thesis, The University of Chicago, 2013. http://pqdtopen.proquest.com/#viewpdf?dispub=3568360.

Full text
Abstract:

Immutability greatly simplifies the implementation of parallel languages. In the absence of mutable state the language implementation is free to perform parallel operations with fewer locks and fewer restrictions on scheduling and data replication. In the Manticore project, we have achieved nearly perfect speedups across both Intel and AMD manycore machines on a variety of benchmarks using this approach.

There are parallel stateful algorithms, however, that exhibit significantly better performance than the corresponding parallel algorithm without mutable state. For example, in many search problems, the same problem configuration can be reached through multiple execution paths. Parallel stateful algorithms share the results of evaluating the same configuration across threads, but parallel mutation-free algorithms are required to either duplicate work or thread their state through a sequential store. Additionally, in algorithms where each parallel task mutates an independent portion of the data, non-conflicting mutations can be performed in parallel. The parallel state-free algorithm will have to merge each of those changes individually, which is a sequential operation at each step.

In this dissertation, we extend Manticore with two techniques that address these problems while preserving its current scalability. Memoization , also known as function caching, is a technique that stores previously returned values from functions, making them available to parallel threads of executions that call that same function with those same values. We have taken this deterministic technique and combined it with a high-performance implementation of a dynamically sized, parallel hash table to provide scalable performance. We have also added mutable state along with two execution models — one of which is deterministic — that allow the user to share arbitrary results across parallel threads under several execution models, all of which preserve the ability to reason locally about the behavior of code.

For both of these techniques, we present a detailed description of their implementations, examine a set of relevant benchmarks, and specify their semantics.

APA, Harvard, Vancouver, ISO, and other styles
5

Lee, I.-Ting Angelina. "Memory abstractions for parallel programming." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/75636.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 156-163).
A memory abstraction is an abstraction layer between the program execution and the memory that provides a different "view" of a memory location depending on the execution context in which the memory access is made. Properly designed memory abstractions help ease the task of parallel programming by mitigating the complexity of synchronization or admitting more efficient use of resources. This dissertation describes five memory abstractions for parallel programming: (i) cactus stacks that interoperate with linear stacks, (ii) efficient reducers, (iii) reducer arrays, (iv) ownershipaware transactions, and (v) location-based memory fences. To demonstrate the utility of memory abstractions, my collaborators and I developed Cilk-M, a dynamically multithreaded concurrency platform which embodies the first three memory abstractions. Many dynamic multithreaded concurrency platforms incorporate cactus stacks to support multiple stack views for all the active children simultaneously. The use of cactus stacks, albeit essential, forces concurrency platforms to trade off between performance, memory consumption, and interoperability with serial code due to its incompatibility with linear stacks. This dissertation proposes a new strategy to build a cactus stack using thread-local memory mapping (or TLMM), which enables Cilk-M to satisfy all three criteria simultaneously. A reducer hyperobject allows different branches of a dynamic multithreaded program to maintain coordinated local views of the same nonlocal variable. With reducers, one can use nonlocal variables in a parallel computation without restructuring the code or introducing races. This dissertation introduces memory-mapped reducers, which admits a much more efficient access compared to existing implementations. When used in large quantity, reducers incur unnecessarily high overhead in execution time and space consumption. This dissertation describes support for reducer arrays, which offers the same functionality as an array of reducers with significantly less overhead. Transactional memory is a high-level synchronization mechanism, designed to be easier to use and more composable than fine-grain locking. This dissertation presents ownership-aware transactions, the first transactional memory design that provides provable safety guarantees for "opennested" transactions. On architectures that implement memory models weaker than sequential consistency, programs communicating via shared memory must employ memory-fences to ensure correct execution. This dissertation examines the concept of location-based memoryfences, which unlike traditional memory fences, incurs latency only when synchronization is necessary.
by I-Ting Angelina Lee.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
6

Child, Christopher H. T. "Approximate dynamic programming with parallel stochastic planning operators." Thesis, City University London, 2011. http://openaccess.city.ac.uk/1109/.

Full text
Abstract:
This thesis presents an approximate dynamic programming (ADP) technique for environment modelling agents. The agent learns a set of parallel stochastic planning operators (P-SPOs) by evaluating changes in its environment in response to actions, using an association rule mining approach. An approximate policy is then derived by iteratively improving state value aggregation estimates attached to the operators using the P-SPOs as a model in a Dyna-Q-like architecture. Reinforcement learning and dynamic programming are powerful techniques for automated agent decision making in stochastic environments. Dynamic programming is effective when there is a known environment model, while reinforcement learning is effective when a model is not available. The techniques derive a policy: a mapping from each environment state to an action which optimizes the long term reward the agent receives. The standard methods become less effective as the state space for the environment increases because they require values to be associated with each state, the storage and processing of which is exponential to the number of state variables. Resolving this “curse of dimensionality” is an important topic of research amongst all communities working on this problem. Two key methods are to: (i) derive an estimate of the value (approximate dynamic programming) using function approximation or state aggregation; or (ii) build a model of the environment from experience. This thesis presents a method of combining these approaches by exploiting structure in the state transition and value functions captured in a set of planning operators which are learnt through experience in the environment. Standard planning operators define the deterministic changes that occur in an environment in response to an action. This work presents Parallel Stochastic Planning Operators (P-SPOs), a novel form of planning operator providing a structured model of the state transition function in environments which are both non-deterministic and for which changes can occur outside the influence of actions. Next, an automated method for extracting P-SPOs from observations in an environment is explored using an adaptation of association rule mining. Finally, methods of relating the state transition structure encapsulated in the P-SPOs to state values, using the operators to store state value aggregation estimates, are evaluated. The framework described provides a method by which approximate dynamic programming can be applied by designers of AI agents and AI planning systems for which they have minimal prior knowledge. The framework and P-SPO based implementations are tested against standard techniques in two bench-mark stochastic environments: a “slippery gripper” block painting robot; and a “predator-prey” agent environment. Experimental results show that an agent using a P-SPO-based approach is able to learn an accurate model of its environment if successor state variables exhibit conditional independence, and an approximate model in the non-independent case. Results also demonstrate that the agent’s ability to generalise to previously unseen states using the model allow it to form an improved policy over an agent employing a standard Dyna-Q based technique. Finally, an approximate policy stored in state aggregation estimates attached to operators is shown to be optimal in experiments for which the P-SPO set contains sufficient information for effective aggregations to be formed.
APA, Harvard, Vancouver, ISO, and other styles
7

Lewis, E. Christopher. "Achieving robust performance in parallel programming languages /." Thesis, Connect to this title online; UW restricted, 2001. http://hdl.handle.net/1773/6996.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ding, Weiren. "Selsyn-C : a self-synchronizing parallel programming language." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=22494.

Full text
Abstract:
In thesis thesis we report the design and implementation of a new self-scheduling parallel programming language, SELSYN-C. As parallel processors become more accessible to a broad range of programmers, the development of simple to use and effective programming languages becomes increasingly important. Our approach to the challenge of parallel programming language design and implementation is two-fold: (1) the design of simple extensions to C that are both easy to use for the programmer, and useful for effective compilation, and (2) the design of efficient and effective scheduling strategies that can be automatically supported by a compiler and associated run-time environment.
We outline our approach by presenting: (1) our motivation, (2) an overview of the extensions to C that form the SELSYN-C programming language, and (3) the development of a new scheduling mechanism that can be used to effectively compile SELSYN-C programs for a real parallel processor, the BBN Butterfly GP-1000. Different scheduling strategies for this mechanism were studied via several experimental tests and the results of these experiments are reported.
A source-to-source compiler supporting the SELSYN-C language has been implemented. Included in this thesis is a description of both the compiler and associated run-time environment.
APA, Harvard, Vancouver, ISO, and other styles
9

Vaudin, John. "A unified programming system for a multi-paradigm parallel architecture." Thesis, University of Warwick, 1991. http://wrap.warwick.ac.uk/108849/.

Full text
Abstract:
Real time image understanding and image generation require very large amounts of computing power. A possible way to meet these requirements is to make use of the power available from parallel computing systems. However parallel machines exhibit performance which is highly dependent on the algorithms being executed. Both image understanding and image generation involve the use of a wide variety of algorithms. A parallel machine suited to some of these algorithms may be unsuited to others. This thesis describes a novel heterogeneous parallel architecture optimised for image based applications. It achieves its performance by combining two different forms of parallel architecture, namely fine grain SIMD and course grain MIMD, into a single architecture. In this way it is possible to match the most appropriate computing resource to each algorithm in a given application. As important as the architecture itself is a method for programming it. This thesis describes a novel multi-paradigm programming language based on C++, which allows programs which make use of both control and data parallelism to be expressed in a single coherent framework, based on object oriented programming. To demonstrate the utility of both the architecture and the programming system, two applications, one from the field of image understanding the other image generation are examined. These applications combine some novel algorithms with other novel implementation approaches to provide the most effective mapping onto this architecture.
APA, Harvard, Vancouver, ISO, and other styles
10

Dazzi, Patrizio. "Tools and models for high level parallel and Grid programming." Thesis, IMT Alti Studi Lucca, 2008. http://e-theses.imtlucca.it/12/1/Dazzi_phdthesis.pdf.

Full text
Abstract:
When algorithmic skeletons were first introduced by Cole in late 1980 (50) the idea had an almost immediate success. The skeletal approach has been proved to be effective when application algorithms can be expressed in terms of skeletons composition. However, despite both their effectiveness and the progress made in skeletal systems design and implementation, algorithmic skeletons remain absent from mainstream practice. Cole and other researchers, respectively in (51) and (19), focused the problem. They recognized the issues affecting skeletal systems and stated a set of principles that have to be tackled in order to make them more effective and to take skeletal programming into the parallel mainstream. In this thesis we propose tools and models for addressing some among the skeletal programming environments issues. We describe three novel approaches aimed at enhancing skeletons based systems from different angles. First, we present a model we conceived that allows algorithmic skeletons customization exploiting the macro data-flow abstraction. Then we present two results about the exploitation of metaprogramming techniques for the run-time generation and optimization of macro data-flow graphs. In particular, we show how to generate and how to optimize macro data-flow graphs accordingly both to programmers provided non-functional requirements and to execution platform features. The last result we present are the Behavioural Skeletons, an approach aimed at addressing the limitations of skeletal programming environments when used for the development of component-based Grid applications. We validated all the approaches conducting several test, performed exploiting a set of tools we developed.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Parallel programming (Computer science)"

1

Baker, Louis. Parallel programming. New York: McGraw-Hill, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bauer, Barr E. Practical parallel programming. San Diego: Academic Press, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Perrott, Ronald H. Parallel programming. Wokingham, England: Addison-Wesley Pub. Co., 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Polychronopoulos, C. D. Parallel Programming and Compilers. Boston, MA: Springer US, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

A, Sanders Beverly, and Massingill Berna, eds. Patterns for parallel programming. Boston: Addison-Wesley, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

G, Babb Robert, ed. Programming parallel processors. Reading, Mass: Addison-Wesley Pub. Co., 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wilson, Greg. Practical parallel programming. Cambridge, Mass: MIT Press, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Brawer, Steven. Introduction to parallel programming. Boston: Academic Press, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

1963-, Wilson Greg, and Lu Paul, eds. Parallel programming using C++. Cambridge, Mass: MIT Press, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Michael, Allen C., ed. Parallel programming: Techniques and applications using networked workstations and parallel computers. Upper Saddle River, N.J: Prentice Hall, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Parallel programming (Computer science)"

1

Takeuchi, Akikazu, and Koichi Furukawa. "Parallel logic programming languages." In Lecture Notes in Computer Science, 242–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/3-540-16492-8_79.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Veldhorst, Marinus. "Parallel dynamic programming algorithms." In Lecture Notes in Computer Science, 393–402. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/3-540-16811-7_194.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Downey, Carlton, and Mengjie Zhang. "Parallel Linear Genetic Programming." In Lecture Notes in Computer Science, 178–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20407-4_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bal, Henri E. "Languages for parallel programming." In Lecture Notes in Computer Science, 1–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54132-2_47.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Frachtenberg, Eitan, Kei Davis, Fabrizio Petrini, Juan Fernandez, and José Carlos Sancho. "Designing Parallel Operating Systems via Parallel Programming." In Lecture Notes in Computer Science, 689–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27866-5_90.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Darlington, J., A. J. Field, P. G. Harrison, P. H. J. Kelly, D. W. N. Sharp, Q. Wu, and R. L. While. "Parallel programming using skeleton functions." In Lecture Notes in Computer Science, 146–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-56891-3_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bo, Cheng, Guo Zhenyu, Bai Zhifeng, and Cao Binggang. "Parallel Chaos Immune Evolutionary Programming." In Lecture Notes in Computer Science, 224–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11941439_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hale, Roger, and Ben Moszkowski. "Parallel programming in Temporal Logic." In Lecture Notes in Computer Science, 277–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-17945-3_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kasim, Henry, Verdi March, Rita Zhang, and Simon See. "Survey on Parallel Programming Model." In Lecture Notes in Computer Science, 266–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-88140-7_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cole, Murray. "Why Structured Parallel Programming Matters." In Lecture Notes in Computer Science, 37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27866-5_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Parallel programming (Computer science)"

1

Conte, Davi Jose, Paulo Sergio Lopes de Souza, Guilherme Martins, and Sarita Mazzini Bruschi. "Teaching Parallel Programming for Beginners in Computer Science." In 2020 IEEE Frontiers in Education Conference (FIE). IEEE, 2020. http://dx.doi.org/10.1109/fie44824.2020.9274155.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ciesko, Jan, David Poliakoff, Daisy S. Hollman, Christian C. Trott, and Damien Lebrun-Grandie. "Towards Generic Parallel Programming in Computer Science Education with Kokkos." In 2020 IEEE/ACM Workshop on Education for High-Performance Computing (EduHPC). IEEE, 2020. http://dx.doi.org/10.1109/eduhpc51895.2020.00010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ciesko, Jan. "Towards Generic Parallel Programming in Computer Science Education with Kokkos." In Proposed for presentation at the EduHPC @ SC20 held November 9-19, 2020. US DOE, 2020. http://dx.doi.org/10.2172/1831033.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yin Qiu, Xiang Ding, and Dong Shao. "Productive parallel programming with Pomelo." In 2011 International Conference on Computer Science and Service System (CSSS). IEEE, 2011. http://dx.doi.org/10.1109/csss.2011.5974814.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Vasconcelos, Leonardo B. A., Felipe A. L. Soares, Pedro Henrique M. M. Penna, Max V. Machado, Luis Fabricio W. Goes, Carlos Augusto P. S. Martins, and Henrique C. Freitas. "Teaching Parallel Programming to Freshmen in an Undergraduate Computer Science Program." In 2019 IEEE Frontiers in Education Conference (FIE). IEEE, 2019. http://dx.doi.org/10.1109/fie43999.2019.9028566.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chen, Yinong, and Gennaro De Luca. "VIPLE: Visual IoT/Robotics Programming Language Environment for Computer Science Education." In 2016 IEEE International Parallel and Distributed Processing Symposium: Workshops (IPDPSW). IEEE, 2016. http://dx.doi.org/10.1109/ipdpsw.2016.55.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hou, Ke, Jing Zhang, and Jun-huai Li. "Review of data-parallel programming model." In 2012 7th International Conference on Computer Science & Education (ICCSE 2012). IEEE, 2012. http://dx.doi.org/10.1109/iccse.2012.6295154.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Luo, Zuomin, Quanfa Zheng, Xinhong Hei, and Nasser Giacaman. "Parallel Programming Based on Microsoft.NET TPL." In 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013). Paris, France: Atlantis Press, 2013. http://dx.doi.org/10.2991/iccsee.2013.129.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zhou, Bei, Lei Wang, and Yong-Zhong Huang. "TSPI: A Tuplespace Based Parallel Programming Library." In 2008 International Conference on Computer Science and Information Technology. IEEE, 2008. http://dx.doi.org/10.1109/iccsit.2008.71.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Goldweber, Mikey. "Session details: Recursion and parallel programming." In ITiCSE '08: 13th Annual Conference on Innovation and Technology in Computer Science Education. New York, NY, USA: ACM, 2008. http://dx.doi.org/10.1145/3255586.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Parallel programming (Computer science)"

1

Markova, Oksana M., Serhiy O. Semerikov, Andrii M. Striuk, Hanna M. Shalatska, Pavlo P. Nechypurenko, and Vitaliy V. Tron. Implementation of cloud service models in training of future information technology specialists. [б. в.], September 2019. http://dx.doi.org/10.31812/123456789/3270.

Full text
Abstract:
Leading research directions are defined on the basis of self-analysis of the study results on the use of cloud technologies in training by employees of joint research laboratory “Сloud technologies in education” of Kryvyi Rih National University and Institute of Information Technology and Learning Aids of the NAES of Ukraine in 2009-2018: cloud learning technologies, cloud technologies of blended learning, cloud-oriented learning environments, cloud-oriented methodological systems of training, the provision of cloud-based educational services. The ways of implementation SaaS, PaaS, IaaS cloud services models which are appropriate to use in the process of studying the academic disciplines of the cycles of mathematical, natural science and professional and practical training of future specialists in information technology are shown, based on the example of software engineering, computer science and computer engineering. The most significant advantages of using cloud technologies in training of future information technology specialists are definite, namely, the possibility of using modern parallel programming tools as the basis of cloud technologies. Conclusions are drawn; the direction of further research is indicated: designing a cloud-oriented learning environment for future specialists in computer engineering, identifying trends in the development of cloud technologies in the professional training and retraining of information technology specialists, developing a methodology for building the research competencies of future software engineering specialists by using cloud technologies.
APA, Harvard, Vancouver, ISO, and other styles
2

Anderson, Loren James, and Marion Kei Davis. Functional Programming in Computer Science. Office of Scientific and Technical Information (OSTI), January 2016. http://dx.doi.org/10.2172/1237221.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bailey, David, James Demmel, Khaled Ibrahim, Alex Kaiser, Alice Koniges, Kamesh Madduri, John Shalf, Erich Strohmaier, and Samuel Williams. A Testbed of Parallel Kernels for Computer Science Research. Office of Scientific and Technical Information (OSTI), April 2010. http://dx.doi.org/10.2172/983273.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Perumalla, Kalyan, Maximilian Bremer, Kevin Brown, Cy Chan, Stephan Eidenbenz, K. Scott Hemmert, Adolfy Hoisie, et al. Computer Science Research Needs for Parallel Discrete Event Simulation (PDES). Office of Scientific and Technical Information (OSTI), May 2022. http://dx.doi.org/10.2172/1855247.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Perumalla, K., M. Bremer, K. Brown, C. Chan, S. Eidenbenz, K. Hemmert, A. Hoisie, et al. Computer Science Research Needs for Parallel Discrete Event Simulation (PDES). Office of Scientific and Technical Information (OSTI), September 2022. http://dx.doi.org/10.2172/1889525.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Proskura, Svitlana L., and Svitlana H. Lytvynova. The approaches to Web-based education of computer science bachelors in higher education institutions. [б. в.], July 2020. http://dx.doi.org/10.31812/123456789/3892.

Full text
Abstract:
The problem of organizing of Web-based education of bachelors, and the bachelors of computer science in particular, is relevant for higher education institutions. The IT industry puts forward new requirements for future IT professionals training. This, in its turn, requires the educational process modernization: content specification, updating of forms, methods and means of training to meet the demands of socio-economic development of the society in general and bachelors of computer science in particular. The article analyzes and clarifies the notion of Web-based education of bachelors; as well as a line of approaches, such as approaches to the organization of Web-based learning for A La Carte, Station Rotation, Lab Rotation, Individual Rotation, Flipped Learning scenario; the necessity of cloud computing and virtual classroom use as a component of Web-based learning is substantiated. It is established that with the advent of a large number of cloud-based services, augmented and virtual realities, new conditions are created for the development of skills to work with innovative systems. It is noted that the implementation of the approaches to the organization of student Web-based education is carried out on international level, in such projects as Erasmus+ “Curriculum for Blended Learning” and “Blended learning courses for teacher educators between Asia and Europe”. The article features the results of programming students survey on the use of Web-based technologies while learning, namely the results of a new approach to learning organization according to the formula – traditional (30%), distance (50%) and project (20%) training.
APA, Harvard, Vancouver, ISO, and other styles
7

Hlushak, Oksana M., Volodymyr V. Proshkin, and Oksana S. Lytvyn. Using the e-learning course “Analytic Geometry” in the process of training students majoring in Computer Science and Information Technology. [б. в.], September 2019. http://dx.doi.org/10.31812/123456789/3268.

Full text
Abstract:
As a result of literature analysis the expediency of free access of bachelors majoring in Computer Sciences and Information Technologies to modern information educational resources, in particular, e-learning courses in the process of studying mathematical disciplines is substantiated. It was established that the e-learning course is a complex of teaching materials and educational services created for the organization of individual and group training using information and communication technologies. Based on the outlined possibilities of applying the e-learning course, as well as its didactic functions, the structure of the certified e-learning course “Analytic Geometry” based on the Moodle platform was developed and described. Features of application of cloud-oriented resources are considered: Desmos, Geogebra, Wolfram|Alpha, Sage in the study of the discipline “Analytic Geometry”. The results of the pedagogical experiment on the basis of Borys Grinchenko Kyiv University and A. S. Makarenko Sumy State Pedagogical University are presented. The experiment was conducted to verify the effectiveness of the implementation of the e-learning course “Analytic Geometry”. Using the Pearson criterion it is proved that there are significant differences in the level of mathematical preparation of experimental and control group of students. The prospect of further scientific research is outlined through the effectiveness of the use of e-learning courses for the improvement of additional professional competences of students majoring in Computer Sciences and Information Technologies (specialization “Programming”, “Internet of Things”).
APA, Harvard, Vancouver, ISO, and other styles
8

Tkachuk, Viktoriia V., Vadym P. Shchokin, and Vitaliy V. Tron. The Model of Use of Mobile Information and Communication Technologies in Learning Computer Sciences to Future Professionals in Engineering Pedagogy. [б. в.], November 2018. http://dx.doi.org/10.31812/123456789/2668.

Full text
Abstract:
Research goal: the research is aimed at developing a model of use of mobile ICT in learning Computer Sciences to future professionals in Engineering Pedagogy. Object of research is the model of use of mobile ICT in learning Computer Sciences to future professionals in Engineering Pedagogy. Results of the research: the developed model of use of mobile ICT as tools of learning Computer Sciences to future professionals in Engineering Pedagogy is based on the competency-based, person-centered and systemic approaches considering principles of vocational education, general didactic principles, principles of Computer Science learning, and principles of mobile learning. It also takes into account current conditions and trends of mobile ICT development. The model comprises four blocks: the purpose-oriented block, the content-technological block, the diagnostic block and the result-oriented block. According to the model, the learning content of Computer Sciences consists of 5 main units: 1) Fundamentals of Computer Science; 2) Architecture of Modern Computers; 3) Fundamentals of Algorithmization and Programming; 4) Software of Computing Systems; 5) Computer Technologies in the Professional Activity of Engineer-pedagogues.
APA, Harvard, Vancouver, ISO, and other styles
9

Modlo, Yevhenii O., Serhiy O. Semerikov, Pavlo P. Nechypurenko, Stanislav L. Bondarevskyi, Olena M. Bondarevska, and Stanislav T. Tolmachev. The use of mobile Internet devices in the formation of ICT component of bachelors in electromechanics competency in modeling of technical objects. [б. в.], September 2019. http://dx.doi.org/10.31812/123456789/3264.

Full text
Abstract:
Computer simulation of technical objects and processes is one of the components of the system of professional training of a modern electromechanics engineer. It has been established that despite the fact that mobile Internet devices (MID) are actively used by electrical engineers, the methods of using them in the process of bachelor in electromechanics training is considered only in some domestic scientific studies. The article highlights the components of the methods of using MID in the formation of the ICT component of the competence of the bachelor in electromechanics in modeling of technical objects, providing for students to acquire basic knowledge in the field of Computer Science and modern ICT and skills to use programming systems, math packages, subroutine libraries, and the like. For processing tabular data, it is proposed to use various freely distributed tools that do not significantly differ in functionality, such as Google Sheets, Microsoft Excel, for processing text data – QuickEdit Text Editor, Google Docs, Microsoft Word. For 3D-modeling and viewing the design and technological documentation, the proposed comprehensive use of Autodesk tools in the training process.
APA, Harvard, Vancouver, ISO, and other styles
10

Balyk, Nadiia, Svitlana Leshchuk, and Dariia Yatsenyak. Developing a Mini Smart House model. [б. в.], February 2020. http://dx.doi.org/10.31812/123456789/3741.

Full text
Abstract:
The work is devoted to designing a smart home educational model. The authors analyzed the literature in the field of the Internet of Things and identified the basic requirements for the training model. It contains the following levels: command, communication, management. The authors identify the main subsystems of the training model: communication, signaling, control of lighting, temperature, filling of the garbage container, monitoring of sensor data. The proposed smart home educational model takes into account the economic indicators of resource utilization, which gives the opportunity to save on payment for their consumption. The hardware components for the implementation of the Mini Smart House were selected in the article. It uses a variety of technologies to conveniently manage it and use renewable energy to power it. The model was produced independently by students involved in the STEM project. Research includes sketching, making construction parts, sensor assembly and Arduino boards, programming in the Arduino IDE environment, testing the functioning of the system. Research includes sketching, making some parts, assembly sensor and Arduino boards, programming in the Arduino IDE environment, testing the functioning of the system. Approbation Mini Smart House researches were conducted within activity the STEM-center of Physics and Mathematics Faculty of Ternopil Volodymyr Hnatiuk National Pedagogical University, in particular during the educational process and during numerous trainings and seminars for pupils and teachers of computer science.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Parallel programming (Computer science)' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography