Benchmark Tests on Improved Merge for Big Data Processing

Marszałek, Z; Woźniak, M; Borowik, G; Wazirali, R; Napoli, C; Pappalardo, G; Tramontana, E

Benchmark Tests on Improved Merge for Big Data Processing

Marszałek, Z Woźniak, M Borowik, G Wazirali, R Napoli, C Pappalardo, G Tramontana, E

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings - 2015 Asia-Pacific Conference on Computer-Aided System Engineering, APCASE 2015, 2015, pp. 96 - 101
Issue Date:: 2015-10-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Published versionAdobe PDF (378.12 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Marszałek, Z	en_US
dc.contributor.author	Woźniak, M	en_US
dc.contributor.author	Borowik, G	en_US
dc.contributor.author	Wazirali, R	en_US
dc.contributor.author	Napoli, C	en_US
dc.contributor.author	Pappalardo, G	en_US
dc.contributor.author	Tramontana, E	en_US
dc.date.issued	2015-10-01	en_US
dc.identifier.citation	Proceedings - 2015 Asia-Pacific Conference on Computer-Aided System Engineering, APCASE 2015, 2015, pp. 96 - 101	en_US
dc.identifier.isbn	9781479975884	en_US
dc.identifier.uri	http://hdl.handle.net/10453/43366
dc.description.abstract	© 2015 IEEE. Computer scientists and engineers work with increasing amounts of information. These data are used for knowledge retrieval, data management decision support and so on. Sorting algorithms are important procedures that if efficiently composed and implemented can increase speed of data processing and decision correctness. Many various sorting algorithms and their modifications are applicable in large computer systems. However, as the computer architectures are more efficient with each release and the software is more complex with each version there is need to improve sorting methods applied for big data computation.	en_US
dc.relation.ispartof	Proceedings - 2015 Asia-Pacific Conference on Computer-Aided System Engineering, APCASE 2015	en_US
dc.relation.isbasedon	10.1109/APCASE.2015.24	en_US
dc.title	Benchmark Tests on Improved Merge for Big Data Processing	en_US
dc.type	Conference Proceeding
dc.location.activity	Ecuadur
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	open_access
pubs.publication-status	Published	en_US

Abstract:

© 2015 IEEE. Computer scientists and engineers work with increasing amounts of information. These data are used for knowledge retrieval, data management decision support and so on. Sorting algorithms are important procedures that if efficiently composed and implemented can increase speed of data processing and decision correctness. Many various sorting algorithms and their modifications are applicable in large computer systems. However, as the computer architectures are more efficient with each release and the software is more complex with each version there is need to improve sorting methods applied for big data computation.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/37168