Proceedings of the Computing Frontiers Conference最新文献

HELICoiD: interdisciplinary and collaborative project for real-time brain cancer detection: Invited Paper HELICoiD:实时脑癌检测的跨学科合作项目:特邀论文

Proceedings of the Computing Frontiers Conference Pub Date : 2017-05-15 DOI: 10.1145/3075564.3076262

R. Salvador, S. Ortega, D. Madroñal, H. Fabelo, R. Lazcano, G. Callicó, E. Juárez, R. Sarmiento, C. Sanz

{"title":"HELICoiD: interdisciplinary and collaborative project for real-time brain cancer detection: Invited Paper","authors":"R. Salvador, S. Ortega, D. Madroñal, H. Fabelo, R. Lazcano, G. Callicó, E. Juárez, R. Sarmiento, C. Sanz","doi":"10.1145/3075564.3076262","DOIUrl":"https://doi.org/10.1145/3075564.3076262","url":null,"abstract":"The HELICoiD project is a European FP7 FET Open funded project. It is an interdisciplinary work at the edge of the biomedical domain, bringing together neurosurgeons, computer scientists and electronic engineers. The main target of the project was to provide a working demonstrator of an intraoperative image-guided surgery system for real-time brain cancer detection, in order to assist neurosurgeons during tumour resection procedures. One of the main problems associated to brain tumours is its infiltrative nature, which makes complete tumour resection a highly difficult task. With the combination of Hyperspectral Imaging and Machine Learning techniques, the project aimed at demonstrating that a precise determination of tumour boundaries was possible, helping this way neurosurgeons to minimize the amount of removed healthy tissue. The project partners involved, besides different universities and companies, two hospitals where the demonstrator was tested during surgical procedures. This paper introduces the difficulties around brain tumor resection, stating the main objectives of the project and presenting the materials, methodologies and platforms used to propose a solution. A brief summary of the main results obtained is also included.","PeriodicalId":398898,"journal":{"name":"Proceedings of the Computing Frontiers Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125530182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

Self-Sustainability in Nano Unmanned Aerial Vehicles: A Blimp Case Study 纳米无人机的自我可持续性:一个飞艇案例研究

Proceedings of the Computing Frontiers Conference Pub Date : 2017-05-15 DOI: 10.1145/3075564.3075580

D. Palossi, Andres Gomez, Stefan Draskovic, K. Keller, L. Benini, L. Thiele

{"title":"Self-Sustainability in Nano Unmanned Aerial Vehicles: A Blimp Case Study","authors":"D. Palossi, Andres Gomez, Stefan Draskovic, K. Keller, L. Benini, L. Thiele","doi":"10.1145/3075564.3075580","DOIUrl":"https://doi.org/10.1145/3075564.3075580","url":null,"abstract":"Nowadays nano Unmanned Aerial Vehicles (UAV's), such as quad-copters, have very limited flight times, tens of minutes at most. The main constraints are energy density of the batteries and the engine power required for flight. In this work, we present a nano-sized blimp platform, consisting of a helium balloon and a rotorcraft. Thanks to the lift provided by helium, the blimp requires relatively little energy to remain at a stable altitude. We also introduce the concept of duty-cycling high power actuators, to reduce the energy requirements for hovering even further. With the addition of a solar panel, it is even feasible to sustain tens or hundreds of flight hours in modest lighting conditions (including indoor usage). A functioning 52 gram prototype was thoroughly characterized and its lifetime was measured in different harvesting conditions. Both our system model and the experimental results indicate our proposed platform requires less than 200 mW to hover in a self sustainable fashion. This represents, to the best of our knowledge, the first nano-size UAV for long term hovering with low power requirements.","PeriodicalId":398898,"journal":{"name":"Proceedings of the Computing Frontiers Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129547867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 14

Cloud Workload Prediction by Means of Simulations 基于模拟的云工作负荷预测

Proceedings of the Computing Frontiers Conference Pub Date : 2017-05-15 DOI: 10.1145/3075564.3075589

G. Kecskeméti, A. Kertész, Z. Németh

引用次数: 4

BC-AMAT: Considering Blocked Time in Memory System Measurement BC-AMAT:考虑内存系统测量中的阻塞时间

Proceedings of the Computing Frontiers Conference Pub Date : 2017-05-15 DOI: 10.1145/3075564.3076264

Qi Yu, Libo Huang, Cheng Qian, Zhiying Wang

{"title":"BC-AMAT: Considering Blocked Time in Memory System Measurement","authors":"Qi Yu, Libo Huang, Cheng Qian, Zhiying Wang","doi":"10.1145/3075564.3076264","DOIUrl":"https://doi.org/10.1145/3075564.3076264","url":null,"abstract":"The \"memory wall\" problem requires not only the use of increasingly aggressive techniques designed to reduce the latency of memory system, but also the raise of more accurate memory metrics. C-AMAT, an extension of AMAT that considers both locality and concurrency of memory accesses, can evaluate the performance of modern memory system more accurately. However, C-AMAT only involves those cycles consumed by memory accesses, ignoring the blocked time caused by some techniques like hardware prefetch, which may result in inaccurate evaluation. In this paper, we propose a more comprehensive memory metric called Blocked C-AMAT (BC-AMAT). It extends C-AMAT to take the blocked cycles into consideration. Experimental results show that BC-AMAT correlates much better with IPC than C-AMAT does when a few prefetch strategies are applied both in single-core mode and multi-core mode. In addition, a case study is provided in which BC-AMAT is used to adjust prefetching degree dynamically. The result shows that BC-AMAT achieves higher performance improvement than C-AMAT, demonstrating its usefulness in system optimization. BC-AMAT is more accurate and comprehensive than C-AMAT in evaluating modern memory systems, meanwhile, provides more insight for architecture design.","PeriodicalId":398898,"journal":{"name":"Proceedings of the Computing Frontiers Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124723343","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Extending the comfort zone: DAVIDE 扩大舒适区:大卫

Proceedings of the Computing Frontiers Conference Pub Date : 2017-05-15 DOI: 10.1145/3075564.3095084

F. Magugliani

引用次数: 0

Work Stealing in a Shared Virtual-Memory Heterogeneous Environment: A Case Study with Betweenness Centrality 共享虚拟内存异构环境下的工作窃取:一个具有中间性的案例研究

Proceedings of the Computing Frontiers Conference Pub Date : 2017-05-15 DOI: 10.1145/3075564.3075567

Shuai Che, Marc S. Orr, J. Gallmeier

{"title":"Work Stealing in a Shared Virtual-Memory Heterogeneous Environment: A Case Study with Betweenness Centrality","authors":"Shuai Che, Marc S. Orr, J. Gallmeier","doi":"10.1145/3075564.3075567","DOIUrl":"https://doi.org/10.1145/3075564.3075567","url":null,"abstract":"This paper uses betweenness centrality as a case study to research efficient work stealing in a heterogeneous system environment. Betweenness centrality is an important algorithm in graph processing. It presents multiple-level parallelism and is an interesting problem to exploit various optimizations. We investigate queue-based work stealing to distribute its tasks across GPU compute units (CUs) and across the CPU and the GPU, which has not been done by prior work. In particular, we demonstrate how to leverage the new platform-atomic operations on AMD Accelerated Processing Units (APUs) to operate cross-device queues in a lock-free manner in shared virtual memory. To make the work stealing runtime and the application more efficient, we apply new architectural features, including atomic operations with different memory scopes and or-derings for different synchronization scenarios. We implement our solution using heterogeneous system architecture (HSA). Our results show that betweenness centrality with CPU-GPU work stealing achieves an average of 15% (up to 30%) performance improvement over GPU-only execution for diverse graph inputs. Our work stealing solution can be applied widely to other applications too. Finally, we analyze important parameters critical for queuing and stealing.","PeriodicalId":398898,"journal":{"name":"Proceedings of the Computing Frontiers Conference","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131968975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Big Data Analytics on Large-Scale Scientific Datasets in the INDIGO-DataCloud Project INDIGO-DataCloud项目中大型科学数据集的大数据分析

Proceedings of the Computing Frontiers Conference Pub Date : 2017-05-15 DOI: 10.1145/3075564.3078884

S. Fiore, Cosimo Palazzo, Alessandro D'Anca, D. Elia, E. Londero, C. Knapic, S. Monna, N. Marcucci, F. Aguilar, M. Plóciennik, J. M. D. Lucas, G. Aloisio

引用次数: 9

An Empirical Comparison of Stream Clustering Algorithms 流聚类算法的经验比较

Proceedings of the Computing Frontiers Conference Pub Date : 2017-05-15 DOI: 10.1145/3075564.3078887

Matthias Carnein, Dennis Assenmacher, H. Trautmann

引用次数: 35

High Performance Coordinate Descent Matrix Factorization for Recommender Systems 推荐系统的高性能坐标下降矩阵分解

Proceedings of the Computing Frontiers Conference Pub Date : 2017-05-15 DOI: 10.1145/3075564.3077625

Xi Yang, Jianbin Fang, Jing Chen, Chengkun Wu, T. Tang, Kai Lu

{"title":"High Performance Coordinate Descent Matrix Factorization for Recommender Systems","authors":"Xi Yang, Jianbin Fang, Jing Chen, Chengkun Wu, T. Tang, Kai Lu","doi":"10.1145/3075564.3077625","DOIUrl":"https://doi.org/10.1145/3075564.3077625","url":null,"abstract":"Coordinate descent (CD) has been proved to be an effective technique for matrix factorization (MF) in recommender systems. To speed up factorizing performance, various methods of implementing parallel CDMF have been proposed to leverage modern multi-core CPUs and many-core GPUs. Existing implementations are limited in either speed or portability (constrained to certain platforms). In this paper, we present an efficient and portable CDMF solver for recommender systems. On the one hand, we diagnose the baseline implementation and observe that it lacks the awareness of the hierarchical thread organization on modern hardware and the data variance of the rating matrix. Thus, we apply the thread batching technique and the load balancing technique to achieve high performance. On the other hand, we implement the CDMF solver in OpenCL so that it can run on various platforms. Based on the architectural specifics, we customize code variants to efficiently map them to the underlying hardware. The experimental results show that our implementation performs 2x faster on dual-socket Intel Xeon CPUs and 22x faster on an NVIDIA K20c GPU than the baseline implementations. When taking the CDMF solver as a benchmark, we observe that it runs 2.4x faster on the GPU than on the CPUs, whereas it achieves competitive performance on Intel MIC against the CPUs.","PeriodicalId":398898,"journal":{"name":"Proceedings of the Computing Frontiers Conference","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126167773","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Using Personality Metrics to Improve Cache Interference Management in Multicore Processors 利用个性指标改进多核处理器缓存干扰管理

Proceedings of the Computing Frontiers Conference Pub Date : 2017-05-15 DOI: 10.1145/3075564.3075591

Mwaffaq Otoom, A. Jaleel, P. Trancoso

引用次数: 1