Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Traff, J.L. |
| Copyright Year | 2004 |
| Description | Author affiliation: C&C Res. Lab., NEC Europe Ltd., Sankt Augustin, Germany (Traff, J.L.) |
| Abstract | Summary form only given. We present and implement simple, binomial-tree based algorithms for the gather and scatter operations of MPI (the message passing interface). For small data sets, data are gathered (scattered) in a tree-like fashion. As the size of the data increases, the algorithms gracefully degrade toward the serial algorithm in which the root process gathers (scatters) data from (to) one process after the next. We extend these algorithms to the more difficult irregular gather/scatter operations in which the processes send/receive different amounts of data. The algorithms are furthermore adopted to the hierarchical communication structure of SMP-clusters. We compare the new algorithms to the straightforward, serial implementations of the gather/scatter primitives, and demonstrate substantial improvements both on a 32-node, 2-way SMP cluster, and on a 4-node NEC SX-6 vector supercomputer with 8 processors per node. For the regular gather/scatter operations improvements of a factor of 3 to 7 are achieved for critical data sizes on the SMP-system, and a factor of 3 to 4 on the SX-6. On 256 nodes of the earth simulator the improvement for scattering small data is more than a factor of 60. Comparable improvements are achieved for the irregular operations, despite preprocessing and communication overhead for dynamic tree construction. We discuss issues in modeling and analyzing the performance of the algorithms for the irregular collectives in particular. |
| Sponsorship | IEEE Comput. Soc. Tech. Committee on Parallel Processing |
| File Size | 1480610 |
| File Format | |
| ISBN | 0769521320 |
| DOI | 10.1109/IPDPS.2004.1303019 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 2004-04-26 |
| Publisher Place | USA |
| Access Restriction | Subscribed |
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subject Keyword | Scattering Degradation Clustering algorithms National electric code Message passing Supercomputers Earth Communication systems Laboratories Europe |
| Content Type | Text |
| Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|