DESIGN OF ALGORITHMS FOR PARALLELIZING NESTED LOOPS

Ref.No: 65139600
Start date: 01.06.2004
End date: 31.12.2005
Approval date: 15.09.2004
Department: ELECTRICAL & COMPUTER ENGINEERING
Sector: COMPUTER SCIENCE
Financier: ΒΑΣΙΚΗ ΕΡΕΥΝΑ, E.M.P. EID.LOG.EREUNAS PD 432/
Budget: 10.000,00 €
Scientific Responsible: Prof. PANAGIOTIS TSANAKAS
Email: panag@cs.ntua.gr
Description: THE FOCUS OF THIS WORK WILL BE THE OPTIMAL PARALLELIZATION OF NESTED FOR LOOPS WITH UNIFORM DEPENDENCIES USING EFFICIENT ALGORITHMS WITH POLYNOMIALTIME COMPLEXITY. OPTIMAL PARALLELIZATION GENERALLY REFERS TO A SCHEDULING THAT ACHIEVES THE LOWEST....
Go to Top