Relevant bibliographies by topics / Efficient parallel algorithms / Books

Books on the topic 'Efficient parallel algorithms'

To see the other types of publications on this topic, follow the link: Efficient parallel algorithms.
Author: Grafiati
Published: 4 June 2021
Last updated: 28 January 2023

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

Select a source type:

Consult the top 38 books for your research on the topic 'Efficient parallel algorithms.'

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.

Browse books on a wide variety of disciplines and organise your bibliography correctly.

1

Alan, Gibbons. Efficient parallel algorithms. Cambridge [England]: Cambridge University Press, 1988.

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

Designing efficient algorithms for parallel computers. New York: McGraw-Hill, 1987.

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

Hochschild, Peter H. Resource-efficient parallel algorithms. Stanford, CA: Dept. of ComputerScience, Stanford University, 1985.

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

Designing efficient algorithms for parallel computers. Maidenhead: McGraw, 1988.

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

Cantú-Paz, Erick. Efficient and Accurate Parallel Genetic Algorithms. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-1-4615-4369-5.

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

Cantú-Paz, Erick. Efficient and accurate parallel genetic algorithms. Boston, Mass: Kluwer Academic Publishers, 2000.

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

Cantú-Paz, Erick. Efficient and accurate parallel genetic algorithms. New York: Springer Science+Business Media, LLC, 2001.

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

Shen, Hong. Efficient design and implementation of parallel algorithms. Åbo: Åbo Akademis Förlag, 1991.

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

Vajteršic, Marián. Algorithms for elliptic problems: Efficient sequential and parallel solvers. Dordrecht: Kluwer Academic Publishers, 1993.

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

Vajteršic, Marián. Algorithms for Elliptic Problems: Efficient Sequential and Parallel Solvers. Dordrecht: Springer Netherlands, 1993.

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

Meyer auf der Heide, F. 1954-, Monien B, and Rosenberg Arnold L. 1941-, eds. Parallel architectures and their efficient use: First Heinz Nixdorf Symposium, Paderborn, Germany, November 11-13, 1992 : proceedings. Berlin: Springer-Verlag, 1993.

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

Miranker, Daniel P. TREAT: A new and efficient match algorithm for Al production systems. London: Pitman, 1990.

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

Miranker, Daniel P. TREAT: A new and efficient match algorithm for AI production systems. London: Pitman, 1990.

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

Miranker, Daniel. TREAT: A new and efficient match algorithm for Al production systems. London: Pitman, 1990.

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

Sun, Xian-He. Efficient parallel kernel solvers for computational fluid dynamics applications: Final report, NASA contract no. NAG1-1672 (Jan. 1995-Aug. 97). [Washington, DC: National Aeronautics and Space Administration, 1997.

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

B, Gatski T., and Langley Research Center, eds. Efficient parallel algorithm for direct numerical simulation of turbulent flows. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1997.

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

Erlebacher, Gordon. An efficient parallel algorithm for the simulation of three-dimensional compressible transition on a 20 processor Flex/32 multicomputer. Hampton, Va: ICASE, 1987.

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

Gibbons, Alan, and Wojciech Rytter. Efficient Parallel Algorithms. Cambridge University Press, 1989.

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

Efficient and Accurate Parallel Genetic Algorithms. Springer, 2011.

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

Guan, Xiaojun. Resource-efficient algorithms for shared-memory parallel architectures. 1990.

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

Center, Langley Research, ed. Efficient algorithms for dilated mappings of binary trees. [Hampton, Va.]: National Aeronautics and Space Administration, Langley Research Center, 1990.

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

Vajtersic, Marián. Algorithms for Elliptic Problems, Efficient Sequential and Parallel Solvers. Springer, 1993.

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

1948-, Apostolico Alberto, and Research Institute for Advanced Computer Science (U.S.), eds. Efficient parallel algorithms for string editing and related problems. [Moffett Field, Calif.?]: Research Institute for Advanced Computer Science, NASA Ames Research Center, 1988.

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

Cantu-Paz, Erick. Efficient and Accurate Parallel Genetic Algorithms (Genetic Algorithms and Evolutionary Computation 1) (Genetic Algorithms and Evolutionary Computation). Springer, 2000.

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

H, Bohkari Shahid, and Langley Research Center, eds. Efficient algorithms for a class of partitioning problems. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1990.

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

Chukkapalli, Giridhar. Weather and climate numerical algorithms: An efficient, parallel solution scheme for the shallow water equations. 2003.

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

Miranker, Daniel P. Treat: A New and Efficient Match Algorithm for AI Production System. Elsevier Science & Technology Books, 2014.

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

Monien, B., and F. Meyer Auf Der Heide. Parallel Architectures and Their Efficient Use: First Heinz Nixdorf Symposium Paderborn, Germany, November 11-13, 1992 Proceedings (Lecture Notes in Computer Science). Springer, 1993.

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

Friedhelm Meyer auf der Heide (Editor), Burkhard Monien (Editor), and Arnold L. Rosenberg (Editor), eds. Parallel Architectures and Their Efficient Use: First Heinz Nixdorf Symposium, Paderborn, Germany, November 11-13, 1992. Proceedings (Lecture Notes in Computer Science). Springer, 1993.

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

Lakshmivarahan, S., and Sudarshan K. Dhall. Parallel Computing Using the Prefix Problem. Oxford University Press, 1994. http://dx.doi.org/10.1093/oso/9780195088496.001.0001.

Full text
Abstract:
The prefix operation on a set of data is one of the simplest and most useful building blocks in parallel algorithms. This introduction to those aspects of parallel programming and parallel algorithms that relate to the prefix problem emphasizes its use in a broad range of familiar and important problems. The book illustrates how the prefix operation approach to parallel computing leads to fast and efficient solutions to many different kinds of problems. Students, teachers, programmers, and computer scientists will want to read this clear exposition of an important approach.
APA, Harvard, Vancouver, ISO, and other styles
31

Efficient parallel kernel solvers for computational fluid dynamics applications: Final report, NASA contract no. NAG1-1672 (Jan. 1995-Aug. 97). [Washington, DC: National Aeronautics and Space Administration, 1997.

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

Miranker, Daniel P. Treat: A New and Efficient Match Algorithm for Ai Production Systems (Research Notes in Artificial Intelligence). Pitman Publishing, 1990.

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

Allen, Michael P., and Dominic J. Tildesley. Monte Carlo methods. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198803195.003.0004.

Full text
Abstract:
The estimation of integrals by Monte Carlo sampling is introduced through a simple example. The chapter then explains importance sampling, and the use of the Metropolis and Barker forms of the transition matrix defined in terms of the underlying matrix of the Markov chain. The creation of an appropriately weighted set of states in the canonical ensemble is described in detail and the method is extended to the isothermal–isobaric, grand canonical and semi-grand ensembles. The Monte Carlo simulation of molecular fluids and fluids containing flexible molecules using a reptation algorithm is discussed. The parallel tempering or replica exchange method for more efficient exploration of the phase space is introduced, and recent advances including solute tempering and convective replica exchange algorithms are described.
APA, Harvard, Vancouver, ISO, and other styles
34

Center, Langley Research, ed. On the parallel efficiency of the Frederickson-McBryan multigrid. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1990.

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

United States. National Aeronautics and Space Administration., ed. Parallelization of the implicit RPLUS algorithm: Final report, NASA grant NAG 3-1472. [Washington, DC: National Aeronautics and Space Administration, 1997.

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

United States. National Aeronautics and Space Administration., ed. Parallelization of the implicit RPLUS algorithm: Final report, NASA grant NAG 3-1472. [Washington, DC: National Aeronautics and Space Administration, 1994.

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

Mitchinson, Ben. Attention and orienting. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780199674923.003.0027.

Full text
Abstract:
This chapter describes the close relationship between the mental faculty of attention and the physical faculty of orienting, and the importance of this relationship to the construction of artificial biomimetic systems. It reviews the importance of physical orienting to natural motor behavior, which places attention management at the core of all behaviors (“orienting is acting”), and the concomitant social role of physical orienting both in expressing and revealing the focus of a mind. The article highlights the efficiency of top-down and bottom-up processing for behavioral control, using map-based saliency processing as a model, and the suitability of map-based algorithms for parallel or bespoke computation. Given this, and the similar nature of the challenges faced by artificial and natural sensorimotor systems, it is argued that attention management may be a, if not the, key component of future artificial motor control systems.
APA, Harvard, Vancouver, ISO, and other styles
38

Hilgurt, S. Ya, and O. A. Chemerys. Reconfigurable signature-based information security tools of computer systems. PH “Akademperiodyka”, 2022. http://dx.doi.org/10.15407/akademperiodyka.458.297.

Full text
Abstract:
The book is devoted to the research and development of methods for combining computational structures for reconfigurable signature-based information protection tools for computer systems and networks in order to increase their efficiency. Network security tools based, among others, on such AI-based approaches as deep neural networking, despite the great progress shown in recent years, still suffer from nonzero recognition error probability. Even a low probability of such an error in a critical infrastructure can be disastrous. Therefore, signature-based recognition methods with their theoretically exact matching feature are still relevant when creating information security systems such as network intrusion detection systems, antivirus, anti-spam, and wormcontainment systems. The real time multi-pattern string matching task has been a major performance bottleneck in such systems. To speed up the recognition process, developers use a reconfigurable hardware platform based on FPGA devices. Such platform provides almost software flexibility and near-ASIC performance. The most important component of a signature-based information security system in terms of efficiency is the recognition module, in which the multipattern matching task is directly solved. It must not only check each byte of input data at speeds of tens and hundreds of gigabits/sec against hundreds of thousand or even millions patterns of signature database, but also change its structure every time a new signature appears or the operating conditions of the protected system change. As a result of the analysis of numerous examples of the development of reconfigurable information security systems, three most promising approaches to the construction of hardware circuits of recognition modules were identified, namely, content-addressable memory based on digital comparators, Bloom filter and Aho–Corasick finite automata. A method for fast quantification of components of recognition module and the entire system was proposed. The method makes it possible to exclude resource-intensive procedures for synthesizing digital circuits on FPGAs when building complex reconfigurable information security systems and their components. To improve the efficiency of the systems under study, structural-level combinational methods are proposed, which allow combining into single recognition device several matching schemes built on different approaches and their modifications, in such a way that their advantages are enhanced and disadvantages are eliminated. In order to achieve the maximum efficiency of combining methods, optimization methods are used. The methods of: parallel combining, sequential cascading and vertical junction have been formulated and investigated. The principle of multi-level combining of combining methods is also considered and researched. Algorithms for the implementation of the proposed combining methods have been developed. Software has been created that allows to conduct experiments with the developed methods and tools. Quantitative estimates are obtained for increasing the efficiency of constructing recognition modules as a result of using combination methods. The issue of optimization of reconfigurable devices presented in hardware description languages is considered. A modification of the method of affine transformations, which allows parallelizing such cycles that cannot be optimized by other methods, was presented. In order to facilitate the practical application of the developed methods and tools, a web service using high-performance computer technologies of grid and cloud computing was considered. The proposed methods to increase efficiency of matching procedure can also be used to solve important problems in other fields of science as data mining, analysis of DNA molecules, etc. Keywords: information security, signature, multi-pattern matching, FPGA, structural combining, efficiency, optimization, hardware description language.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Efficient parallel algorithms' for other source types:
Journal articles Dissertations / Theses
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