| NSF Org: |
CCF Division of Computing and Communication Foundations |
| Recipient: |
|
| Initial Amendment Date: | September 15, 2010 |
| Latest Amendment Date: | December 7, 2010 |
| Award Number: | 1015804 |
| Award Instrument: | Standard Grant |
| Program Manager: |
Tao Li
CCF Division of Computing and Communication Foundations CSE Directorate for Computer and Information Science and Engineering |
| Start Date: | September 15, 2010 |
| End Date: | August 31, 2015 (Estimated) |
| Total Intended Award Amount: | $200,006.00 |
| Total Awarded Amount to Date: | $206,006.00 |
| Funds Obligated to Date: |
FY 2011 = $6,000.00 |
| History of Investigator: |
|
| Recipient Sponsored Research Office: |
1500 SW JEFFERSON AVE CORVALLIS OR US 97331-8655 (541)737-4933 |
| Sponsor Congressional District: |
|
| Primary Place of Performance: |
1500 SW JEFFERSON AVE CORVALLIS OR US 97331-8655 |
| Primary Place of
Performance Congressional District: |
|
| Unique Entity Identifier (UEI): |
|
| Parent UEI: |
|
| NSF Program(s): |
Software & Hardware Foundation, COMPUTER ARCHITECTURE, DES AUTO FOR MICRO & NANO SYST |
| Primary Program Source: |
01001112DB NSF RESEARCH & RELATED ACTIVIT |
| Program Reference Code(s): |
|
| Program Element Code(s): |
|
| Award Agency Code: | 4900 |
| Fund Agency Code: | 4900 |
| Assistance Listing Number(s): | 47.070 |
ABSTRACT
Recent advances in technology have made the design of parallel computers with thousands of processors more feasible. Consequently, the study of different networks for linking processors is an integral part of the design of high-performance computers. This project will study the interconnection topologies of three important families of networks from the point of view of network efficiency. Examples of the type of problems to be considered include: algorithms for efficient communication among processors; effective placement of scarce or otherwise limited resources; and fault-tolerant communication algorithms in the presence of node/link failures. In addition to facilitating graduate training, the project would provide detailed insight for understanding various tradeoffs in designing interconnection networks for large multiprocessor architectures.
PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH
Note:
When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external
site maintained by the publisher. Some full text articles may not yet be available without a
charge during the embargo (administrative interval).
Some links on this page may take you to non-federal websites. Their policies may differ from
this site.
PROJECT OUTCOMES REPORT
Disclaimer
This Project Outcomes Report for the General Public is displayed verbatim as submitted by the Principal Investigator (PI) for this award. Any opinions, findings, and conclusions or recommendations expressed in this Report are those of the PI and do not necessarily reflect the views of the National Science Foundation; NSF has not approved or endorsed its content.
In parallel computing systems , nterconnection networks prescribe how to connect different computers that must communicate with each other. Since quick and efficient communication is desirable and some of these systems are very large, the method used to connect these nodes of the system is very important. This method of connecting these nodes is called the topology of the network.
In this project we investigated two relatively new networks whose design is based on two structures of numbers studied in algebraic number theory called the Gaussian numbers and the Eisenstein-Jacobi numbers. These networks show strong potential for efficient communication. For instance, there is a Gaussian network with about 900 nodes in which every node has four neighbors and every two nodes are within 20 degrees of separation.
Among our results is recognizing a good way to address the nodes, which we then use to design some algorithms for efficient communication between nodes.
During this time we have published seven journal papers and one conference proceedings.
We are both honored to be teachers as well as researchers. Part of the award money was used to support three undergraduate students, two of which are successfully studying in graduate school while the the third student is working at Microsoft. The grant has helped to support a PhD student in computer science whom we co-advise and who is close to graduation . In addition to this student, during this time we both have advised other graduate students in our respective departments.
Last Modified: 10/12/2015
Modified by: Bella Bose
Please report errors in award information by writing to: awardsearch@nsf.gov.
