2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies最新文献_第7页

Diffusion Wavelets-Based Analysis on Traffic Matrices 基于扩散小波的交通矩阵分析

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.35

Hui Tian, M. Roughan, Yingpeng Sang, Hong Shen

引用次数: 8

Network Threat Assessment Based on Alert Verification 基于告警验证的网络威胁评估

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.57

Rongrong Xi, Xiao-chun Yun, Shuyuan Jin, Yongzheng Zhang

引用次数: 4

Automatic Energy Status Controlling with Dynamic Voltage Scaling in Power-Aware High Performance Computing Cluster 基于动态电压缩放的功率感知高性能计算集群能量状态自动控制

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.24

Yuansheng Cheng, Yu Zeng

{"title":"Automatic Energy Status Controlling with Dynamic Voltage Scaling in Power-Aware High Performance Computing Cluster","authors":"Yuansheng Cheng, Yu Zeng","doi":"10.1109/PDCAT.2011.24","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.24","url":null,"abstract":"Recently, more and more people are focused on the energy efficiency of HPC(High Performance Computing) centers. The power consumption of supercomputer listed in the first 10 of top 500 is usually more than 1Mkw. Power-aware techniques have been widely used in data centre or supercomputer centre for reducing the power consumption. It is useful for us to reduce the power consumption with frequency scalable CPU being adopted in the HPC centers. Because load unbalance is a common problem in high performance computing, we can gear the frequency of CPU down when it is idle so that the power consumption can be reduced with little performance lose. In this paper, we present a new method called AESC(Automatic Energy Status Controlling) which can control the energy status of CPU automatically. Firstly, we identify the application as different kinds of power consumption by the load balancing and communication time. Secondly, we will give a control policy for controlling the energy status based on former results. By using this policy, we can automatically gear the frequency of CPU and get the best result that 20% less energy while increasing execution time by only 1%.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115846828","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}

引用次数: 18

Dynamically Accessing Packet Header Fields at High-Speed 高速动态访问报文报头字段

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.37

R. Duncan, P. Jungck, Kenneth Ross

{"title":"Dynamically Accessing Packet Header Fields at High-Speed","authors":"R. Duncan, P. Jungck, Kenneth Ross","doi":"10.1109/PDCAT.2011.37","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.37","url":null,"abstract":"A significant part of packet processing consists of detecting whether certain standard protocol headers are present, where they are located and whether they include optional information. Packet processing programs are on tight time budgets, especially to handle speeds in the gigabits per second (gbps) range. Thus, high-speed mechanisms for finding and accessing headers are critical. Our approach lets users define headers as C-style structures in a high-level language, packetC [1], and specify header locations in terms of offsets from the start of the current packet, which is treated as an array of unsigned bytes. These offsets can be expressed in terms of network layer offsets, constant values, runtime-calculated variables and combinations of all of these. This paper focuses on the principal forms these offset expressions can take and on how our FPGAs (Field Programmable Gate Arrays), compiler and interpreter collectively handle them at runtime. For simple and complex header offset scenarios we provide users with intuitive, high-level ways to describe offsets and provide effective runtime mechanisms to access header fields.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126344542","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}

引用次数: 0

A Segmented Approach for DAG Scheduling in Heterogeneous Environment 异构环境下DAG调度的分段方法

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.10

S. G. Ahmad, E. Munir, M. W. Nisar

引用次数: 6

Optimizing Web Browser on Many-Core Architectures 在多核架构上优化Web浏览器

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.61

Lingjun Fan, Weisong Shi, Shibin Tang, C. Yan, Dongrui Fan

{"title":"Optimizing Web Browser on Many-Core Architectures","authors":"Lingjun Fan, Weisong Shi, Shibin Tang, C. Yan, Dongrui Fan","doi":"10.1109/PDCAT.2011.61","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.61","url":null,"abstract":"As more and more Web applications emerging on sever end today, the Web browser on client end has become a host of a variety of applications other than just rendering static Web pages. This leads to more and more performance requirements of a Web browser, for which user experience is very important. This situation may become more urgency when on handheld devices. Some efforts like redesign a new Web browser have been made to overcome this problem. In this paper, we address this issue by optimizing the main processes of the Web browser on a state-of-the-art 64-core architecture, Godson-T, which was developed at Chinese Academy of Sciences, as multi-/many-core architecture to be the mainstream processor in the upcoming years. We start a new core to process a new tab when facing up to intensive URL requests, and we use scratch-pad memory (SPM) of each core as a local buffer to store the HTML source data to be processed to reduce off-chip memory access and exploit more data locality, otherwise, we use DTA to transfer HTML data for backup. Experiments conducted on the cycle-accurate simulator show that, starting each tab process by a new core could obtain 5.7% to 50% speedup with different number of cores used to process corresponding URL requests, with on-chip scratchpad memory of each core used to store the HTML data, more speedup could be achieved when number of cores increase. Also, as Data Transfer Agent (DTA) used to transfer the HTML data, the backup of HTML data can get 2X to 5X speedups according to different data amount.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125573748","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}

引用次数: 2

Providing Access Control through Program Transformation 通过程序转换提供访问控制

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.71

Xinfeng Ye, Chen Wang

引用次数: 0

A Logical Approach to the Management of Object Identifiers in Non-conventional Database Management Systems 非传统数据库管理系统中对象标识符管理的逻辑方法

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.6

C. R. Valêncio, André Cid Ferrizzi, F. Almeida, Juliano Augusto Carreira, M. L. Tronco

引用次数: 3

Analysis of Parameters Contributing Performance and Coverage of Mobile WiMAX with Mix Traffic 混合业务下移动WiMAX性能和覆盖影响参数分析

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-01 DOI: 10.1109/PDCAT.2011.20

Fatima Furqan, D. Hoang

引用次数: 4

Fast Fault-Tolerant Resource Allocation 快速容错资源分配

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-01 DOI: 10.1109/PDCAT.2011.41

Kewen Liao, Hong Shen

{"title":"Fast Fault-Tolerant Resource Allocation","authors":"Kewen Liao, Hong Shen","doi":"10.1109/PDCAT.2011.41","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.41","url":null,"abstract":"We present the first efficient approximation algorithm for the Unconstrained Fault-Tolerant Resource Allocation (UFTRA) problem [13] with uniform fault tolerance levels. UFTRA is a relaxation of the classical Fault-Tolerant Facility Location problem [11]. Based on the fundamental primal-dual theory [25], our primal-dual algorithm achieves an approximation ratio of 1.861 while it can be implemented in quasi-linear time. Besides the significant improvement in runtime over all previous work, the solution quality of the algorithm matches the work in [28] using a phase-greedy algorithm and improves the result of [29] adopting the linear program rounding technique. Built on this algorithm, we also show that the capacitated UFTRA (CUFTRA) problem introduced in [13] achieves 3.722-approximation in quasi-linear time. In this paper, before the presence of the main algorithm and its extensive theoretical analysis, we provide some necessary background knowledge of the problem. This includes the problem's mathematical model formulation, the primal-dual theory applied to this formulation, and the problem's abstract system model with its potential application domains such as content distribution networks and cloud computing.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115696830","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}

引用次数: 2