Beschreibung
This book is about a new approach to identify parallel segments from a given application or program. Program segment is represented using Program Dependence Graph, then by applying topological sort and reachability definition algorithm a new approach is suggested to identify segments, which can be executed concurrently. The performance of the suggested approach has been demonstrated and analysed at the end and also few examples are discussed using parallelization.
Autorenporträt
Prof. Shanthi Makka currently working as a Associate Professor and HOD-CSE at Dronacharya Group Of Institutions, Greater Noida and she submitted her Ph.D. thesis recently at BIT, Ranchi on Parallel Computing. She published various research papers in international and national journals and presented multiple papers in conferences.
Herstellerkennzeichnung:
OmniScriptum SRL
Str. Armeneasca 28/1, office 1
2012 Chisinau
MD
E-Mail: info@omniscriptum.com
