Algorithms and Architectures for Parallel Processing

Algorithms and Architectures for Parallel Processing

EnglishEbook
Springer International Publishing
EAN: 9783319271613
Available online
CZK 2,755
Common price CZK 3,061
Discount 10%
pc

Detailed information

This book constitutes the refereed proceedings of theWorkshops and Symposiums of the 15th International Conference on Algorithms andArchitectures for Parallel Processing, ICA3PP 2015, held in Zhangjiajie, China,in November 2015.The program of this year consists of 6symposiums/workshops that cover a wide range of research topics on parallelprocessing technology: the Sixth International Workshop on Trust, Security andPrivacy for Big Data, TrustData 2015; the Fifth International Symposium onTrust, Security and Privacy for Emerging Applications, TSP 2015; the ThirdInternational Workshop on Network Optimization and Performance Evaluation, NOPE2015; the Second International Symposium on Sensor-Cloud Systems, SCS 2015; theSecond International Workshop on Security and Privacy Protection in Computerand Network Systems, SPPCN 2015; and the First International Symposium onDependability in Sensor, Cloud, and Big Data Systems and Applications,DependSys 2015.The aim of these symposiums/workshops is to provide aforum to bring together practitioners and researchers from academia andindustry for discussion and presentations on the current research and futuredirections related to parallel processing technology. The themes and topics ofthese symposiums/workshops are a valuable complement to the overall scope ofICA3PP 2015 and give additional values and interests.
EAN 9783319271613
ISBN 331927161X
Binding Ebook
Publisher Springer International Publishing
Publication date November 18, 2015
Language English
Country Uruguay
Editors Li, Kenli; Martinez, Gregorio; Wang, Guojin; Zomaya, Albert
Series Lecture Notes in Computer Science
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.