Open Access. Powered by Scholars. Published by Universities.®
Computer and Systems Architecture Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Computer and Systems Architecture
Power-Efficient And Highly Scalable Parallel Graph Sampling Using Fpgas, Usman Tariq, Umer Cheema, Fahad Saeed
Power-Efficient And Highly Scalable Parallel Graph Sampling Using Fpgas, Usman Tariq, Umer Cheema, Fahad Saeed
Parallel Computing and Data Science Lab Technical Reports
Energy efficiency is a crucial problem in data centers where big data is generally represented by directed or undirected graphs. Analysis of this big data graph is challenging due to volume and velocity of the data as well as irregular memory access patterns. Graph sampling is one of the most effective ways to reduce the size of graph while maintaining crucial characteristics. In this paper we present design and implementation of an FPGA based graph sampling method which is both time- and energy-efficient. This is in contrast to existing parallel approaches which include memory-distributed clusters, multicore and GPUs. Our …
Gpu-Arraysort: A Parallel, In-Place Algorithm For Sorting Large Number Of Arrays, Muaaz Awan, Fahad Saeed
Gpu-Arraysort: A Parallel, In-Place Algorithm For Sorting Large Number Of Arrays, Muaaz Awan, Fahad Saeed
Parallel Computing and Data Science Lab Technical Reports
Modern day analytics deals with big datasets from diverse fields. For many application the data is in the form of an array which consists of large number of smaller arrays. Existing techniques focus on sorting a single large array and cannot be used for sorting large number of smaller arrays in an efficient manner. Currently no such algorithm is available which can sort such large number of arrays utilizing the massively parallel architecture of GPU devices. In this paper we present a highly scalable parallel algorithm, called GPU-ArraySort, for sorting large number of arrays using a GPU. Our algorithm performs …