|
A Grand Challenge Problem is a general category of unsolved problems. The definition of a Grand Challenge problem has a certain degree of inherent subjectivity surrounding what is, or is not, a Grand Challenge. A Grand Challenge problem exhibits at least the following characteristics: This is a list of lists of unsolved problems in various subjects: Unsolved problems in mathematics Unsolved problems in physics Unsolved problems in chemistry Unsolved problems in biology Unsolved problems in economics Unsolved problems in governance Unsolved problems in cognitive science Unsolved problems in neuroscience Unsolved problems in computer science...
This article is in need of attention. ...
- The problem is demonstrably hard to solve, requiring several orders-of-magnitude improvement in the capability required to solve it.
- The problem cannot be unsolvable. If it probably can't be solved, then it can't be a Grand Challenge. Ideally, quantifiable measures that indicate progress toward a solution are also definable.
- The solution to a Grand Challenge problem must have a significant economic and/or social impact.
Another, more simple definition is: An order of magnitude is the class of scale or magnitude of any amount, where each class contains values of a fixed ratio to the class preceding it. ...
Measurement is the estimation of the magnitude of some attribute of an object, such as its length or weight, relative to a unit of measurement. ...
Face-to-face trading interactions on the New York Stock Exchange trading floor. ...
Social refers to human society or its organization. ...
- A grand challenge problem is one that cannot be solved in a reasonable amount of time with today's computers.
Fundamental scientific problems currently being explored generate increasingly complex data, require more realistic simulations of the processes under study, and demand greater and more intricate visualizations of the results. These problems often require numerous large-scale calculations and collaborations between people with multiple disciplines and locations. This article is about the general term. ...
Process (lat. ...
Visualization can refer to: Graphic Visualization as in any technique for creating images, diagrams, or animations to communicate any message. ...
For the card game, see Calculation (game). ...
For wartime collaboration, see Collaborationism. ...
// An academic discipline, or field of study, is a branch of knowledge which is taught or researched at the college or university level. ...
The following are some examples of Grand Challenge problems: Grand Challenges were policy terms set as goals in the late 1980s for funding high-performance computing and communications research in part in response to the Japanese 5th Generation (or Next Generation) 10-year project. ...
-
--68. ...
Spatial scale provides a shorthand form for discussing relative lengths, areas, distances and sizes. ...
This article is about the natural environment. ...
An abstract model (or conceptual model) is a theoretical construct that represents something, with a set of variables and a set of logical and quantitative relationships between them. ...
A coral reef near the Hawaiian islands is an example of a complex marine ecosystem. ...
This article is about the general term. ...
Medical imaging designates the ensemble of techniques and processes used to create images of the human body (or parts thereof) for clinical purposes (medical procedures seeking to reveal, diagnose or examine disease) or medical science (including the study of normal anatomy and function). ...
For other uses, see Biomechanical. ...
Molecular biology is the study of biology at a molecular level. ...
This article needs to be cleaned up to conform to a higher standard of quality. ...
In mathematics, the term optimization, or mathematical programming, refers to the study of problems in which one seeks to minimize or maximize a real function by systematically choosing the values of real or integer variables from within an allowed set. ...
Look up Cognition in Wiktionary, the free dictionary. ...
Computation can be defined as finding a solution to a problem from given inputs by means of an algorithm. ...
Core of a small nuclear reactor used for research. ...
The mushroom cloud of the atomic bombing of Nagasaki, Japan, 1945, rose some 18 kilometers (11 mi) above the hypocenter A nuclear weapon derives its destructive force from nuclear reactions of fusion or fission. ...
In the philosophy of artificial intelligence, strong AI is the claim that some forms of artificial intelligence can truly reason and solve problems; strong AI states that it is possible for machines to becomes sapient, or self-aware, but may or may not exhibit human-like thought processes. ...
See also Parallel computing is the simultaneous execution of the same task (split up and specially adapted) on multiple processors in order to obtain results faster. ...
Grand Challenges were policy terms set as goals in the late 1980s for funding high-performance computing and communications research in part in response to the Japanese 5th Generation (or Next Generation) 10-year project. ...
Darpa Grand Challenge The DARPA Grand Challenge is a prize competition for driverless cars, sponsored by the Defense Advanced Research Projects Agency (DARPA), the central research organization of the United States Department of Defense. ...
References - Kranzlmüller, Dieter, "Event Graph Analysis for Debugging Massively Parallel Programs - 2.1.1 Grand Challenge Problems", GUP Linz, Joh. Kepler University Linz, Austria (September 2000).
- NASA ESS (Earth and Space Sciences) project, "Grand Challenges", NASA High Performance Computing and Communications (HPCC) Program, JPL's High Performance Computing Group, (1998).
- San Diego Supercomputer Center (SDSC), "Grand Challenge Equations", University of California, San Diego, (1999).
External links - Grand Challenge Net - contains GraB the Grand Challenge Blog, a proposed Grand Challenge Hardness Scale, and references to known Grand Challenges.
| Parallel computing topics | | | General | High-performance computing Parallel computing is the simultaneous execution of the same task (split up and specially adapted) on multiple processors in order to obtain results faster. ...
It has been suggested that this article or section be merged into Supercomputing. ...
| | | Parallelism | Bit-level parallelism · Instruction level parallelism · Data parallelism · Task parallelism Bit-level parallelism is a form of parallel computing based on increasing processor word size. ...
Instruction-level parallelism (ILP) is a measure of how many of the operations in a computer program can be dealt with at once. ...
Data Parallelism is a form of parallelization of computer code. ...
Task Parallelism is a form of parallelization of computer code. ...
| | | Theory | Speedup · Amdahl's law · Flynn's taxonomy (SISD • SIMD • MISD • MIMD) · Cost efficiency · Gustafson's law · Karp-Flatt metric · Parallel slowdown In parallel computing, speedup refers to how much a parallel algorithm is faster than a corresponding sequential algorithm. ...
The speedup of a program using multiple processors in parallel computing is limited by the sequential fraction of the program. ...
Flynns taxonomy is a classification of computer architectures, proposed by Michael J. Flynn in 1972. ...
SISD is an acronym for Single Instruction stream over a Single Data stream. ...
-1...
Multiple Instruction Single Data (MISD) is a type of parallel computing architecture where many functional units perform different operations on the same data. ...
Multiple Instruction Multiple Data (MIMD) is a type of parallel computing architecture where many functional units perform different operations on different data. ...
There are very few or no other articles that link to this one. ...
Gustafsons Law (also known as Gustafson-Barsis law) is a law in computer engineering which states that any sufficiently large problem can be efficiently parallelized. ...
The Karp-Flatt Metric is a measure of parallelization of code in parallel processor systems. ...
| | | Elements | Process · Thread · Fiber · Parallel Random Access Machine In computing, a process is an instance of a computer program that is being executed. ...
For the form of code consisting entirely of subroutine calls, see Threaded code. ...
A fiber in computer science is a term for a particularly lightweight thread of execution. ...
PRAM stands for Parallel Random Access Machine, which is an abstract machine for designing the algorithms applicable to parallel computers. ...
| | | Coordination | Multiprocessing · Multithreading · Multitasking · Memory coherency · Cache coherency · Barrier · Synchronization · Distributed computing · Grid computing Multiprocessing is traditionally known as the use of multiple concurrent processes in a system as opposed to a single process at any one instant. ...
Multithreading computers have hardware support to efficiently execute multiple threads. ...
In computing, multitasking is a method by which multiple tasks, also known as processes, share common processing resources such as a CPU. In the case of a computer with a single CPU, only one task is said to be running at any point in time, meaning that the CPU is...
Memory coherence (also cache coherence or cache consistency) is the property of the shared memory systems (multiprocessors and distributed shared memory systems) in which any shared piece of memory (cache line or memory page) gives consistent values with accordance to earlier agreed consistency model despite accesses (maybe parallel) from different...
Cache coherence refers to the integrity of data stored in local caches of a shared resource. ...
In parallel computing, a barrier is a type of synchronization method. ...
In computer science, especially parallel computing, synchronization means the coordination of simultaneous threads or processes to complete a task in order to get correct runtime order and avoid unexpected race conditions. ...
Distributed computing is a method of computer processing in which different parts of a program are run simultaneously on two or more computers that are communicating with each other over a network. ...
Grid computing is a phrase in distributed computing which can have several meanings: Multiple independent computing clusters which act like a grid because they are composed of resource nodes not located within a single administrative domain. ...
| | | Programming | Programming model · Implicit parallelism · Explicit parallelism Programming redirects here. ...
A parallel programming model is a set of software technologies to express parallel algorithms and match applications with the underlying parallel systems. ...
In computer science, implicit parallelism is a characteristic of a programming language that allows a compiler to automatically exploit the parallelism inherent to the computations expressed by some of the languages constructs. ...
In computer programming, explicit parallelism is the representation of concurrent computations by means of primitives in the form of special-purpose directives or function calls. ...
| | | Hardware | Computer cluster · Beowulf · Symmetric multiprocessing · Non-Uniform Memory Access · Cache only memory architecture · Asymmetric multiprocessing · Simultaneous multithreading · Shared memory · Distributed memory · Massively parallel processing · Superscalar processing · Vector processing · Supercomputer · Stream processing · GPGPU Computer hardware is the physical part of a computer, including its digital circuitry, as distinguished from the computer software that executes within the hardware. ...
An example of a Computer cluster A computer cluster is a group of tightly coupled computers that work together closely so that in many respects they can be viewed as though they are a single computer. ...
The Borg, a 52-node Beowulf cluster used by the McGill University pulsar group to search for pulsations from binary pulsars. ...
Symmetric multiprocessing, or SMP, is a multiprocessor computer architecture where two or more identical processors are connected to a single shared main memory. ...
Non-Uniform Memory Access or Non-Uniform Memory Architecture (NUMA) is a computer memory design used in multiprocessors, where the memory access time depends on the memory location relative to a processor. ...
Cache only memory architecture (COMA) is a computer memory organization for use in multiprocessors in which the local memories (typically DRAM) at each node are used as cache. ...
Asymmetric Multiprocessing or ASMP is a style of multiprocessing supported in DECs VMS V.3 as well as a number of older systems including TOPS-10 and OS-360. ...
Simultaneous multithreading, often abbreviated as SMT, is a technique for improving the overall efficiency of superscalar CPUs. ...
// Diagram of a typical Shared memory system. ...
Distributed memory is a concept used in parallel computing. ...
Massive parallelism is a term used in computer architecture and application-specific integrated circuit (ASIC) design. ...
Simple superscalar pipeline. ...
Processor board of a CRAY YMP vector computer A vector processor, or array processor, is a CPU design that is able to run mathematical operations on multiple data elements simultaneously. ...
For other uses, see Supercomputer (disambiguation). ...
For other uses, see Event Stream Processing. ...
General-purpose computing on graphics processing units (GPGPU, also referred to as GPGP and to a lesser extent GP²) is a recent trend focused on using GPUs to perform computations rather than the CPU. The addition of programmable stages and higher precision arithmetic to the rendering pipelines allowed software developers...
| | | Software | Distributed shared memory · Application checkpointing · Warewulf Computer software (or simply software) refers to one or more computer programs and data held in the storage of a computer for some purpose. ...
Distributed Shared Memory (DSM), in computer science, refers to a wide class of software and hardware implementations, in which each node of a cluster has access to a large shared memory in addition to each nodes limited non-shared private memory. ...
To quote Matt Dillon (of DragonFly BSD), Checkpointing allows you to freeze a copy of an application so that, in theory, you can restore the program to that running state at a later point in time. ...
This article needs to be cleaned up to conform to a higher standard of quality. ...
| | | APIs | POSIX Threads · OpenMP · Message Passing Interface (MPI) · Intel Threading Building Blocks API redirects here. ...
POSIX Threads is a POSIX standard for threads. ...
OpenMP logo The OpenMP (Open Multi-Processing) is an application programming interface (API) that supports multi-platform shared memory multiprocessing programming in C/C++ and Fortran on many architectures, including Unix and Microsoft Windows platforms. ...
Message Passing Interface (MPI) is both a computer specification and is an implementation that allows many computers to communicate with one another. ...
Intel Threading Building Blocks (also known as TBB) is the name of a C++ template library developed by Intel for writing software programs that take advantage of multi-core processors. ...
| | | Problems | Embarrassingly parallel · Grand Challenge · Software lockout In the jargon of parallel computing, an embarrassingly parallel workload (or embarrassingly parallel problem) is one for which no particular effort is needed to segment the problem into a very large number of parallel tasks, and there is no essential dependency (or communication) between those parallel tasks. ...
In multiprocessor computer systems, software lockout is the issue of performance degradation due to the idle wait times spent by the CPUs in kernel-level critical sections. ...
| | |