The rapid development of intelligent transportation technology has promoted the progress of multiple trains cooperative technology. This paper proposes an online cooperative cruise control method based on improved par...
详细信息
As more business activities are being automated and an increasing number of computers are being used to store vital and sensitive information the need for secure computer systems becomes more apparent. This need is ev...
详细信息
When facing complex requirements of city development, ever-growing spatial data, rapid development of geographical business and increasing business complexity, collaboration between multiple users and departments is n...
详细信息
Embedded high perfonnance computing is being called upon to provide critical computing resources with increasing frequency. The ability to tolerate faults during operation, both maintaining operational capability and ...
详细信息
This book constitutes the refereed proceedings of the Second international Conference on Information computing and applications, ICICA 2010, held in Qinhuangdao, China, in October 2011.;The 97 papers presented were ca...
详细信息
ISBN:
(数字)9783642252556
ISBN:
(纸本)9783642252549
This book constitutes the refereed proceedings of the Second international Conference on Information computing and applications, ICICA 2010, held in Qinhuangdao, China, in October 2011.;The 97 papers presented were carefully reviewed and selected from numerous submissions. They are organized in topical sections on computational economics and finance, computational statistics, mobile computing and applications, social networking and computing, intelligent computing and applications, internet and Web computing, paralelle and distributedcomputing, and system simulation and computing.
Irregular computing significantly influences the performance of large scale parallel applications. How to generate local memory access sequence and communication set efficiently for irregular parallel application is a...
详细信息
ISBN:
(纸本)0769525547
Irregular computing significantly influences the performance of large scale parallel applications. How to generate local memory access sequence and communication set efficiently for irregular parallel application is an important issue in compiling a data parallel language into a Single Program Multiple Data (SPMD) code for distributed-memory machines. In this paper we propose a hybrid approach, which combines the advantages of the algebra method and the integer lattice method. Our approach derives an algebraic solution of communication set enumeration at compile time for the situation of irregular array references in nested loops. Based on the integer lattice, we develop our method for global-to-local and local-to-global index translations in the case of alignment and cyclic (k) distribution. Then, we present our algorithm for the corresponding SPMD code generation, which adopts some communication optimization techniques. In our method, when parameters are known, the communication set generation, the global-to-local and local-to-global index translations, and the SPMD code generation can be completed at compile time without inspector phase of run time.
distributedcomputing is a form of computing in which a group of independent systems are connected to a computer network. Cloud computing is one of the emerging domain in the field of Computer science. With the help o...
详细信息
As the number of data-intensive applications increases in various domains, scientists need to save, retrieve, and analyze increasingly large datasets. The huge volume of data and the long latency of data transfer on t...
详细信息
ISBN:
(纸本)0769525857
As the number of data-intensive applications increases in various domains, scientists need to save, retrieve, and analyze increasingly large datasets. The huge volume of data and the long latency of data transfer on the Internet make it very difficult to ensure high-performance access to Data Grids. Thus, data replication techniques have been widely adopted to solve the latency problem. In this paper, we propose an efficient data replication algorithm for multi-source data transfer, whereby a data replica can be assembled in parallel from multiple distributed data sources and adapted to the variability of network bandwidths. The experimental results show that the proposed algorithm can obtain more aggregated bandwidth, reduce connection overheads, and achieve superior load balance.
Many-core accelerators, as represented by the XeonPhi coprocessors and GPGPUs, allow software to exploit spatial and temporal sharing of computing resources to improve the overall system performance. To unlock this pe...
详细信息
ISBN:
(纸本)9781538643686
Many-core accelerators, as represented by the XeonPhi coprocessors and GPGPUs, allow software to exploit spatial and temporal sharing of computing resources to improve the overall system performance. To unlock this performance potential requires software to effectively partition the hardware resource to maximize the overlap between host-device communication and accelerator computation, and to match the granularity of task parallelism to the resource partition. However, determining the right resource partition and task parallelism on a per program, per dataset basis is challenging. This is because the number of possible solutions is huge, and the benefit of choosing the right solution may be large, but mistakes can seriously hurt the performance. In this paper, we present an automatic approach to determine the hardware resource partition and the task granularity for any given streamed application, targeting the Intel XeonPhi architecture. Instead of hand-crafting the heuristic for which the process will have to repeat for each hardware generation, we employ machine learning techniques to automatically learn it. We achieve this by first learning a predictive model offline using training programs;we then use the learned model to predict the resource partition and task granularity for any unseen programs at runtime. We apply our approach to 23 representative parallel applications and evaluate it on a CPU-XeonPhi mixed heterogenous many-core platform. Our approach achieves, on average, a 1.6x (upto 5.6x) speedup, which translates to 94.5% of the performance delivered by a theoretically perfect predictor.
The prediction of the time-series data stream in AIOps is an important research field of data mining. However, due to the non-stationary and non-linear characteristics of time series data, many existing methods cannot...
详细信息
ISBN:
(纸本)9781665414852
The prediction of the time-series data stream in AIOps is an important research field of data mining. However, due to the non-stationary and non-linear characteristics of time series data, many existing methods cannot comprehensively solve the accuracy and reduce time consumption. To solve this problem, we propose a new MWNN (Memory Wavelet Neural Network) algorithm. It can effectively overcome the contradiction between accuracy and time consumption. In MWNN, we designed a new hidden layer structure. By adding a new memory storage unit to the hidden layer, it can be ensured that the hidden layer can make the best use of historical data and greatly improve the prediction accuracy. Moreover, the model does not require any prior information or data distribution assumptions. This paper selects real Ops data for verification. The final experimental results show that, compared with the commonly used prediction models, this model has the highest prediction accuracy and lower time consumption. The data set used in the experiment has been uploaded to https://***/Yang-Yun726/MWNN/tree/master/DATA.
暂无评论