CSC/ECE 506 Fall 2007/wiki1 2 3K8i: Difference between revisions
No edit summary |
No edit summary |
||
| Line 7: | Line 7: | ||
// todo: work on wording below<br> | // todo: work on wording below<br> | ||
Some problems are so complex that to solve them would require a significant increase (in some cases by orders of magnitude) in the current computational capabilities of today's computers. | Some problems are so complex that to solve them would require a significant increase (in some cases by orders of magnitude) in the current computational capabilities of today's computers. These problems are loosely defined as "Grand Challenge Problems." Grand Challenge problems are problems that are solvable, but not in a reasonable period of time on today's computers. Further, a grand challenge problem is a problem of some importance, either socially or economically. | ||
'''Biology''' - Human Genome Project (http://en.wikipedia.org/wiki/Human_genome_project) | |||
Looks like a "divide and conquer" approach. The genome was broken down into smaller pieces, approximately 150,000 base pairs in length, processed separately, then assembled to form chromosones. | |||
Physics | '''Physics''' (nuclear technology) | ||
Game playing | '''Astronomy''' | ||
'''Cognition/Strong AI''' - the idea that computers can become "self aware." (vs. weak AI who's goal is not so grandiose - Turing test) | |||
'''Game playing''' - chess, checkers (Jonathon Schaefer) | |||
Linpack benchmark | Linpack benchmark | ||
| Line 24: | Line 29: | ||
http://en.wikipedia.org/wiki/Grand_Challenge_problem | http://en.wikipedia.org/wiki/Grand_Challenge_problem | ||
http://en.wikipedia.org/wiki/Grand_Challenge | |||
Revision as of 20:26, 1 September 2007
What characterizes present-day applications? How much memory, processor time, etc.? How high is the speedup?
Computational modeling/simulation: why, benefits. in-depth analysis can be performed cheaply on hypothetical designs.
There is a direct correlation between computational performance and the problems that can be studied through simulation.
// todo: work on wording below
Some problems are so complex that to solve them would require a significant increase (in some cases by orders of magnitude) in the current computational capabilities of today's computers. These problems are loosely defined as "Grand Challenge Problems." Grand Challenge problems are problems that are solvable, but not in a reasonable period of time on today's computers. Further, a grand challenge problem is a problem of some importance, either socially or economically.
Biology - Human Genome Project (http://en.wikipedia.org/wiki/Human_genome_project) Looks like a "divide and conquer" approach. The genome was broken down into smaller pieces, approximately 150,000 base pairs in length, processed separately, then assembled to form chromosones.
Physics (nuclear technology)
Astronomy
Cognition/Strong AI - the idea that computers can become "self aware." (vs. weak AI who's goal is not so grandiose - Turing test)
Game playing - chess, checkers (Jonathon Schaefer)
Linpack benchmark
Links:
http://en.wikipedia.org/wiki/High_Performance_Computing