Call for Papers: TMSCS Special Issue on Advances in Parallel Graph Processing
"Halappanavar, Mahantesh M" <[email protected]> Sat, 4 Feb 2017 06:58:15 +0000
| Newsgroups | gmane.comp.mathematics.csc |
|---|---|
| Message-ID | <D4BABB85.20D26%[email protected]> |
--===============0420758559685884426== Content-Language: en-US Content-Type: multipart/alternative; boundary="_000_D4BABB8520D26mahanteshhalappanavarpnnlgov_" --_000_D4BABB8520D26mahanteshhalappanavarpnnlgov_ Content-Type: text/plain; charset="Windows-1252" Content-Transfer-Encoding: quoted-printable CALL FOR PAPERS IEEE Transactions on Multi-Scale Computing Systems Special Issue on Advances in Parallel Graph Processing: Algorithms, Archite= ctures and Application Frameworks GUEST EDITORS: Ananth Kalyanaraman, Washington State University, Pullman, WA, USA ananth@e= ecs.wsu.edu<mailto:ananth-B5DvpLVBExT2fBVCVOL8/[email protected]> Mahantesh Halappanavar, Pacific Northwest National Laboratory, Richland, WA= , USA [email protected]<mailto:[email protected]> Synopsis: In the sphere of modern data science and applications, graph algorithms hav= e achieved a pivotal place in advancing the state of scientific discovery a= nd knowledge. Nearly three centuries of ideas have made graph theory and it= s applications a mature area in computational sciences. Yet, today we find = ourselves at crossroads between theory and application. Spurred by the digi= tal revolution, data from over a diverse range of high throughput channels = and devices, from across internet-scale applications, are starting to mark = a new era in data-driven computing and discovery. Building robust graph mod= els and implementing scalable graph application frameworks in the context o= f this new era are proving to be significant challenges. Concomitant to the= digital revolution, we have also experienced an explosion in computing arc= hitectures, with a broad range of multicores, manycores, heterogeneous plat= forms and hardware accelerators (CPUs, GPUs) being actively developed and d= eployed within servers and multinode clusters. Recent advances have started= to show that in more than one way, these two fields - graph theory and arc= hitectures - are capable of benefiting and in fact spurring new research di= rections in one another. This special issue invites original research papers and authoritative posit= ion/survey papers that showcase cutting-edge research at the intersection o= f graph algorithms, graph applications and advanced architectures. Research= topics of particular interest include (but not limited to): - Design of efficient, scalable architectures for graph-theoretic pro= cessing - Models and approaches for accelerated graph construction on chip - Characterization of graph operations based on computational charact= eristics - Hardware and algorithmic techniques to reduce latency and to improv= e data locality - Comparative evaluation of hardware architectures for different grap= h operations - Efficient approaches to utilize heterogeneous architectures for gra= ph computing - Communication-reducing techniques and paradigms for large-scale gra= ph applications - Power and energy efficiency of graph operations on chip - Processing dynamic graphs and graph streams on chip - High-end graph applications using high performance architectures an= d platforms IMPORTANT DATES: Open for submissions in ScholarOne Manuscripts: February 1, 2017 Closed for submissions: March 1, 2017 Results of first round of reviews: May 1, 2017 Submission of revised manuscripts: July 1, 2017 Results of second round of reviews: August 1, 2017 Publication materials due: September 1, 2017 SUBMISSION GUIDELINES: Prospective authors are invited to submit their manuscripts electronically = after the =93open for submissions=94 date, adhering to the IEEE Transaction= s on Multi-Scale Computing Systems guidelines (http://www.computer.org/port= al/web/tmscs/author). Please submit your papers through the online system (= https://mc.manuscriptcentral.com/tmscs-cs) and be sure to select the specia= l issue name. Manuscripts should not be published or currently submitted fo= r publication elsewhere. Please submit only full papers intended for review= , not abstracts, to the ScholarOne portal. If requested, abstracts should b= e sent by e-mail to the Guest Editors directly. --_000_D4BABB8520D26mahanteshhalappanavarpnnlgov_ Content-Type: text/html; charset="Windows-1252" Content-ID: <[email protected]> Content-Transfer-Encoding: quoted-printable <html> <head> <meta http-equiv=3D"Content-Type" content=3D"text/html; charset=3DWindows-1= 252"> </head> <body style=3D"word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-lin= e-break: after-white-space; color: rgb(0, 0, 0); font-size: 14px; font-fami= ly: Calibri, sans-serif;"> <div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">CALL FOR PAPERS<o:p></o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light"><b>IEEE Transactions on Multi-Scale Computing Systems<o:p></o:= p></b></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light"><b>Special Issue on Advances in Parallel Graph Processing: Alg= orithms, Architectures and Application Frameworks</b><o:p></o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light"> </font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">GUEST EDITORS:<o:p></o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">Ananth Kalyanaraman, Washington State University, Pullman, WA,= USA <a href=3D"mailto:ananth-B5DvpLVBExT2fBVCVOL8/[email protected]" style=3D"color: purple;">a= nanth-B5DvpLVBExT2fBVCVOL8/[email protected]</a><o:p></o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">Mahantesh Halappanavar, Pacific Northwest National Laboratory,= Richland, WA, USA <a href=3D"mailto:[email protected]" style=3D"color: pu= rple;">[email protected]</a><o:p></o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light"> </font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">Synopsis:<o:p></o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">In the sphere of modern data science and applications, graph a= lgorithms have achieved a pivotal place in advancing the state of scientifi= c discovery and knowledge. Nearly three centuries of ideas have made graph theory and its applications a mature ar= ea in computational sciences. Yet, today we find ourselves at crossroads be= tween theory and application. Spurred by the digital revolution, data from = over a diverse range of high throughput channels and devices, from across internet-scale applications, are startin= g to mark a new era in data-driven computing and discovery. Building robust= graph models and implementing scalable graph application frameworks in the= context of this new era are proving to be significant challenges. Concomitant to the digital revolution, we ha= ve also experienced an explosion in computing architectures, with a broad r= ange of multicores, manycores, heterogeneous platforms and hardware acceler= ators (CPUs, GPUs) being actively developed and deployed within servers and multinode clusters. Recent advan= ces have started to show that in more than one way, these two fields - grap= h theory and architectures - are capable of benefiting and in fact spurring= new research directions in one another.<o:p></o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light"> </font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">This special issue invites original research papers and author= itative position/survey papers that showcase cutting-edge research at the i= ntersection of graph algorithms, graph applications and advanced architectures. Research topics of particular int= erest include (but not limited to):<o:p></o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light"> </font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">- Design of efficient, sca= lable architectures for graph-theoretic processing<o:p></o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">- Models and approaches fo= r accelerated graph construction on chip<o:p></o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">- Characterization of grap= h operations based on computational characteristics<o:p></o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">- Hardware and algorithmic= techniques to reduce latency and to improve data locality<o:p></o:p></font= ></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">- Comparative evaluation o= f hardware architectures for different graph operations<o:p></o:p></font></= p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">- Efficient approaches to = utilize heterogeneous architectures for graph computing<o:p></o:p></font></= p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">- Communication-reducing t= echniques and paradigms for large-scale graph applications<o:p></o:p></font= ></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">- Power and energy efficie= ncy of graph operations on chip<o:p></o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">- Processing dynamic graph= s and graph streams on chip<o:p></o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">- High-end graph applicati= ons using high performance architectures and platforms<o:p></o:p></font></p= > </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light"> </font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">IMPORTANT DATES:<o:p></o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">Open for submissions in ScholarOne Manuscripts: Feb= ruary 1, 2017<o:p></o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">Closed for submissions: &nb= sp; = <b>March 1, 2017</b><o:p></o:p></= font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">Results of first round of reviews: &nbs= p; May 1, 2017<o:p></= o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">Submission of revised manuscripts: &nbs= p; July 1, 2017<o:p><= /o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">Results of second round of reviews: &nb= sp; August 1, 2017<o:p= ></o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">Publication materials due: = &nb= sp; September 1, 2017<o:p></o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light"> </font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">SUBMISSION GUIDELINES:<o:p></o:p></font></p> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><font face=3D"Ca= libri-Light">Prospective authors are invited to submit their manuscripts el= ectronically after the =93open for submissions=94 date, adhering to the IEE= E Transactions on Multi-Scale Computing Systems guidelines (<a href=3D"http://www.computer.org/portal/web/tmscs/author" st= yle=3D"color: purple;">http://www.computer.org/portal/web/tmscs/author</a>)= . Please submit your papers through the online system (<a href=3D"https://m= c.manuscriptcentral.com/tmscs-cs" style=3D"color: purple;">https://mc.manus= criptcentral.com/tmscs-cs</a>) and be sure to select the special issue name. Manuscripts should not be pu= blished or currently submitted for publication elsewhere. Please submit onl= y full papers intended for review, not abstracts, to the ScholarOne portal.= If requested, abstracts should be sent by e-mail to the Guest Editors directly.<o:p></o:p></font></p> </div> </div> <div> <p class=3D"MsoNormal" style=3D"margin: 0in 0in 0.0001pt;"><br> </p> </div> </body> </html> --_000_D4BABB8520D26mahanteshhalappanavarpnnlgov_-- --===============0420758559685884426== Content-Type: text/plain; charset="us-ascii" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Content-Disposition: inline _______________________________________________ Csc mailing list [email protected] https://lists.purdue.edu/mailman/listinfo/csc --===============0420758559685884426==--