The Method Of Parallel Recognition And Parallel Optimization Based On Data Dependence With Sparse Matrix
Journal: International Journal of Scientific & Technology Research (Vol.3, No. 7)Publication Date: 2014-07-15
Authors : Navid Bazrkar; Payam Porkar;
Page : 255-258
Keywords : Index Terms sparse matrix; medium grain parallel; parallel recognition; Parallel Optimization; Data Dependence;
Abstract
Abstract for application programs in scientific and technological fields have grown increasingly large and complex it is becoming more difficult to parallelize these programs by hand using message-passing libraries. To reduce this difficulty we are researching the compilation technology for serial program automatic parallelization. In this paper the author puts forward a kind of parallel recognition algorithm in parallelization compiler with sparse matrix to reduce memory consumption and time complexity. In the algorithm the author adopts the idea of the medium grain parallel.
Other Latest Articles
- Sorption And Kinetics Study Of Potassium Chloride In Polyvinyl Alcohol-Borate Hydrogel
- Optimal Placement 26 Sizing Of Distributed Generation DG To Minimize Active Power Loss Using Particle Swarm Optimization PSO
- Kinetic Approach To The Mechanism Of P-BisDimethylamino-Phenothiazin-5-Ium Chloride Sulphate Ion In Acidic Medium
- Processing And Evaluation Of Chemically Treated Kenaf Bast Hibiscus Cannabinus
- Ecological And Morpho-Physiological Characteristics Of Corn Zea Mays L. Associated With Compost Curing
Last modified: 2015-06-28 03:58:51