Updated on December 10, 2014
Day 1: Tuesday, December 9, 2014
Opening Remarks and Announcements (9:00-9:20am)
Keynote Talk (9:20-10:20am)
- Efficiency of Resource Abundant Clouds (Albert Y. Zomaya)
Coffee Break (10:20-10:40am)
Session 1 (10:40am-12:20pm) [Chair: Frank Feinbube]
- A Novel Density based Clustering Algorithm and Its Parallelization (Xiaokang Li, Binbin Yu, Yinghua Zhou, Guangzhong Sun)
- A Segmentation Pattern based Approach to Automated Protocol Identification (Yafei Sang, Yongzheng Zhang, Yipeng Wang, Yu Zhou, Xu Tao)
- Access-efficient QoS-aware data replication to maximize user satisfaction in cloud computing environments (Mohammad Shorfuzzaman)
- Bandwidth Modeling in Large Distributed Systems for Big Data Applications (Bahman Javadi, Boyu Zhang, Michela Taufer)
Lunch (12:20-2pm) – Dim Sum @ Victoria Harbour Restaurant
Session 2 (2-3:40pm) [Chair: TBA]
- Benchmarking and Analysis of Variations of Work Stealing Scheduler on Clustered System (Saurav Kumar, Aryabartta Sahu)
- Conflict-Free Code Block Scheduling to Hide SpMT Inter-Core Register Sync Delay (John Ye, Jason Chen, Tianzhou Chen, Qingsong Shi)
- Dealing with Skewed Data in Structured Overlays using Variable Hash Functions (Maeva Antoine, Fabrice Huet)
- Distributive Interoperable Executive Library (DIEL) for Systems of Multiphysics Simulation (Kwai Wong, Logan Brown, Jason Coan, David White)
Coffee Break (3:40-4pm)
Session 3 (4-5:40pm) [Chair: Kwai Wong]
- On the Shallow-Light Steiner Tree Problem (Longkun Guo, Kewen Liao, Hong Shen)
- Energy-Aware Scheduling for Sensor Node Platforms (Sungwoo Tak, Hangeul Kim, Donglyul Kim, Yougyung Kim)
- FastICA on Modern GPU Architectures (Max Plauth, Frank Feinbube, Peter Tröger, Andreas Polze)
- Fault-Tolerant Routing based on Improved Safety Levels in Pancake Graphs (Yo Nishiyama, Yuki Hirai, Keiichi Kaneko)
Welcome Reception (Dinner) (6:15pm) – Buffet (dinner) @ Senior Common Room, HKU
Day 2: Wednesday, December 10, 2014
Invited Talk (9:20-10:20am)
- Future Distributed Applications Based on Mobile Cloud Computing and Software-Defined Networks (Sergei Gorlatch)
Coffee Break (10:20-10:40am)
Session 4 (10:40am-12:20pm) [Chair: Keiichi Kaneko]
- Improve LLC Bypassing Performance by Memory Controller Improvements in Heterogeneous Multicore System (Jianliang Ma, Jinglei Meng, Tianzhou Chen, Qingsong Shi, Minghui Wu, Li Liu)
- Comparison of Binding Approaches of Scheduled Multiphase Application onto Linear Multicore Architecture (Sahil Kumar, Nitesh Singal, Aryabartta Sahu)
- Joint Convergecast and Power Allocation in Wireless Sensor Networks (Yaoxin Duan, Wendi Nie, Kai Liu, Qingfeng Zhuge, Edwin H.M. Sha, Victor C.S. Lee)
- Using rCUDA to Reduce GPU Resource-assignment Fragmentation caused by Job Scheduler (Pak Markthub, Akihiro Nomura, Satoshi Matsuoka)
Lunch (12:20-2pm) – Buffet @ Café Malacca, Hotel Jen
Session 5 (2-3:40pm) [Chair: Luwei Cheng]
- Fault-tolerant Routing in (n, k)-Star Graphs (Takara Ito, Manabu Myojin, Yuki Hirai, Keiichi Kaneko)
- Practical Anonymization for Protecting Privacy in Combinatorial Maps (Dandan Chu, Yidong Li, Tao Wang, Lei Zhang, Hong Shen)
- Prediction of Spatial and Temporal Data: A Web Tool based on Georeferenced Resources (Carlos Roberto Valêncio, Carlos Henrique El Hetti Laurenti, Luiz Carlos Baida, Fernando Ferrari, Thatiane Kawabata, Angelo Cesar Colombini)
- PUF-based RFID Ownership Transfer Protocol in an Open Environment (Qing-Shan Li, Xiao-Lin Xu, Zhong Chen)
Coffee Break (3:40-4pm)
Session 6 (4-5:40pm) [Chair: TBA]
- Simulating Supercomputer Workload with hpcwld package for R (Alexander Rumyantsev)
- New Replication Strategy based on Maximal Frequent Correlated Pattern Mining for Data Grids (Sarra Slimani, Tarek Hamrouni, Faouzi Ben Charrada)
- Sparse Matrix-Vector Multiplication: A Data Mapping-Based Architecture (Ahmad Mansour, Jürgen Götze, Wei-Chun Hsu, Shanq-Jang Ruan)
- TopicBlock: Mining User Inner Interests for Text and Link Analysis in Social Networks (Wenyu Zang, Chuan Zhou, Xiao Wang, Li Guo)
Conference Dinner (6:15pm) – Hot Pot @ Fu Lam Restaurant
Day 3: Thursday, December 11, 2014
Session 7 (9:20-10:35am) [Chair: Arkadiusz Danilecki]
- Online Scheduling of Applications on 3D Stacked Large Chip Multiprocessor (Bhoopendra Kumar, Aryabartta Sahu)
- TOUGH2-PETSc: A Parallel Solver for TOUGH2 (Daniel Hathorn, Yushu Wu, Zizhong Chen)
- Running Data-Intensive Scientific Workflows in the Cloud (Chiaki Sato, Luke M. Leslie, Young Choon Lee, Albert Y. Zomaya, Rajiv Ranjan)
Coffee Break (10:35-11am)
Session 8 (11am-12:15pm) [Chair: Zizhong Chen]
- Forced Replicable Execution for a Subset of Piecewise Deterministic Applications with Deterministic Message Passing (Arkadiusz D. Danilecki)
- Gravitational Search Algorithm using CUDA (Amirreza Zarrabi, Ettikan K. Karuppiah, Yong Keh Kok, Ngo Chuan Hai, Simon See)
- Towards high-level parallel patterns in OpenCL (Jiri Dokulil, Siegfried Benkner)
Lunch (12:15pm) – Light lunch @ Grove Café, HKU
Optional tour (afternoon) – Details TBA
Prof. Albert Y. Zomaya
Professor and Director, Centre for Distributed & High Performance Computing,
School of Information Technologies, University of Sydney, Australia
Efficiency of Resource Abundant Clouds
The cloud is well known for its elasticity by leveraging abundant resources. Cloud data centres easily host thousands or even millions of multicore servers. Further, these servers are increasingly virtualized for the sake of data centre efficiency. However, the reality is that these resources are often relentlessly exploited particularly to improve applications performance. Although the elasticity facilitates achieving cost efficiency (or the performance to cost ratio), the ultimate efficiency in resource usage (or more broadly data centres) lies in scheduling and resource allocation strategies that explicitly take into account actual resource consumption. The optimization of resource efficiency in clouds is of great practical importance considering its numerous benefits in the economic and environmental sustainability. In this talk, we will discuss resource efficiency in cloud data centres with an example of large-scale distributed processing applications including scientific workflows and MapReduce jobs.
ALBERT Y. ZOMAYA is the Chair Professor of High Performance Computing & Networking and Australian Research Council Professorial Fellow in the School of Information Technologies, Sydney University. He is also the Director of the Centre for Distributed and High Performance Computing which was established in late 2009.
Dr. Zomaya published more than 500 scientific papers and articles and is author, co-author or editor of more than 20 books. He is currently the Editor in Chief of the IEEE Transactions on Computers and Springer’s Scalable Computing and serves as an associate editor for 22 leading journals. Dr. Zomaya is the Founding Editor of the Wiley Book Series on Parallel and Distributed Computing.
Dr. Zomaya was the Chair the IEEE Technical Committee on Parallel Processing (1999–2003) and currently serves on its executive committee. He is the Vice–Chair, IEEE Task Force on Computational Intelligence for Cloud Computing and serves on the advisory board of the IEEE Technical Committee on Scalable Computing and the steering committee of the IEEE Technical Area in Green Computing.
Dr. Zomaya has delivered more than 150 keynote addresses, invited seminars, and media briefings and has been actively involved, in a variety of capacities, in the organization of more than 600 conferences.
Professor Zomaya is the recipient of the IEEE Technical Committee on Parallel Processing Outstanding Service Award (2011), the IEEE Technical Committee on Scalable Computing Medal for Excellence in Scalable Computing (2011), and the IEEE Computer Society Technical Achievement Award (2014). He is a Chartered Engineer, a Fellow of AAAS, IEEE, IET (UK). Professor Zomaya’s research interests are in the areas of parallel and distributed computing and complex systems.
Prof. Dr. Sergei Gorlatch
University of Muenster, Germany
Future Distributed Applications Based on Mobile Cloud Computing and Software-Defined Networks
We consider an emerging class of challenging networked applications called Real-Time Online Interactive Applications (ROIA). ROIA are networked applications connecting a potentially very high number of users who interact with the application and with each other in real time, i.e., a response to a user's action happens virtually immediately. Typical representatives of ROIA are multiplayer online computer games, advanced simulation-based e-learning and serious gaming. All these applications are characterized by high performance and QoS requirements, such as: short response times to user inputs (about 0.1-1.5 s); frequent state updates (up to 100 Hz); large and frequently changing numbers of users in a single application instance (up to tens of thousands simultaneous users).
This talk will address two challenging aspects of future Internet-based ROIA applications: a) using Mobile Cloud Computing for allowing high application performance when a ROIA application is accessed from multiple mobile devices, and b) managing dynamic QoS requirements of ROIA applications by employing the emerging technology of Software-Defined Networking (SDN).
Towards High-Level Programming for Many-Core Systems Sergei Gorlatch, University of Muenster, Germany Application development for modern high-performance systems with many cores, i.e., comprising multiple Graphics Processing Units (GPUs) and multi-core CPUs, currently exploits low-level programming approaches like CUDA and OpenCL, which leads to complex, lengthy and error-prone programs.
In this talk, we advocate a high-level programming approach for such systems, which relies on the following two main principles: a) the model is based on the current OpenCL standard, such that programs remain portable across various many-core systems, independently of the vendor, and all low-level code optimizations can be applied; b) the model extends OpenCL with three high-level features which simplify many-core programming and are automatically translated by the system into efficient OpenCL code. The additional high-level features are as follows: 1) memory management is simplified and automated using parallel container data types (vectors and matrices); 2) an automatic data (re)distribution mechanism allows for implicit data movements between GPUs and ensures scalability on multiple GPUs; 3) computations are conveniently expressed using parallel algorithmic patterns (skeletons). The well-defined skeletons allow for formal transformations of SkelCL programs which are used both in the process of program development and in the compilation and optimization phase.
We demonstrate how our programming model and its implementation are used to express parallel applications on one- and two-dimensional data, and we report experimental results that confirm greatly reduced programming effort and program size, as well as competitive target performance of our approach.
Prof. Sergei Gorlatch is an internationally acknowledged expert in the area of algorithms, architectures, software and applications for modern parallel and distributed systems. He has been Full Professor of Computer Science at the University of Muenster (Germany) since 2003. Earlier he was Associate Professor at the Technical University of Berlin, Assistant Professor at the University of Passau, and Humboldt Research Fellow at the Technical University of Munich, all in Germany. Prof. Gorlatch has about 200 peer-reviewed publications in renowned international books, journals and conferences. He was principal investigator in several international research and development projects in the field of parallel, distributed, Grid and Cloud algorithms, networking and computing, as well as e-Learning, funded by the European Commission and by German national bodies. Among his recent achievements in the area communications and future Internet is the novel Real-Time Framework (www.real-time-framework.com) developed in his group as a platform for high-level development of real-time, highly interactive applications. In the area of high-performance computing, his group has been recently developing a high-level SkelCL library (skelcl.uni-muenster.de/) for efficient programming of parallel algorithms on emerging parallel and distributed many-core systems with accelerators.