2010 First International Conference on Networking and Computing最新文献

Multiprocessor Architectures Specialized for Multi-agent Simulation 专门用于多代理仿真的多处理器体系结构

2010 First International Conference on Networking and Computing Pub Date : 2010-11-17 DOI: 10.1109/IC-NC.2010.34

Christian Schäck, W. Heenes, R. Hoffmann

引用次数: 4

An Adaptive Timeout Strategy for Profiling UDP Flows 分析UDP流的自适应超时策略

2010 First International Conference on Networking and Computing Pub Date : 2010-11-17 DOI: 10.1109/IC-NC.2010.15

Jing Cai, Zhibin Zhang, P. Zhang, Xinbo Song

{"title":"An Adaptive Timeout Strategy for Profiling UDP Flows","authors":"Jing Cai, Zhibin Zhang, P. Zhang, Xinbo Song","doi":"10.1109/IC-NC.2010.15","DOIUrl":"https://doi.org/10.1109/IC-NC.2010.15","url":null,"abstract":"With the increase of network bandwidth, more and more new applications such as audio, video and online games have become the main body in network traffic. Based on real time considerations, these new applications mostly use UDP as transport layer protocol, which directly increase UDP traffic. However, traditional studies believe that TCP dominates the Internet traffic and previous traffic measurements were generally based on it while UDP was ignored. In view of this, we mainly discuss the adaptive timeout strategy of UDP flows in this paper. Firstly, due to the significant differences in flow characteristics between the TCP flows and UDP flows, we expound and prove that the existing adaptive timeout strategies are not appropriate for UDP flows. Secondly, we present our adaptive strategy using Support Vector Machine techniques. We build six classifiers to accurately predict its corresponding maximum packet inter-arrival time and adapt its timeout value within the flow duration. Limited to its accurate rating, we present another concept of adjust accuracy rating which can probability-guaranteed(90%,95%,98%) to avoid long flow to be cut into short flows. The experiment result reveals that our adaptive strategy has the potential to achieve significant performance advantages over other widely used fixed and other adaptive timeout schemes.","PeriodicalId":375145,"journal":{"name":"2010 First International Conference on Networking and Computing","volume":"697 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114896501","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

An Evaluation on Sensor Network Technologies for AMI Associated Mudslide Warning System AMI关联泥石流预警系统传感器网络技术评价

2010 First International Conference on Networking and Computing Pub Date : 2010-11-17 DOI: 10.1109/IC-NC.2010.10

Cheng-Jen Tang, Miau-Ru Dai

引用次数: 6

Implementation of SIVARM: A Simple VMM for the ARM Architecture SIVARM的实现:ARM架构的简单VMM

2010 First International Conference on Networking and Computing Pub Date : 2010-11-17 DOI: 10.1109/IC-NC.2010.23

A. Suzuki, S. Oikawa

引用次数: 1

The Design of On-the-Fly Virtual Channel Allocation for Low Cost High Performance On-Chip Routers 面向低成本高性能片上路由器的实时虚拟信道分配设计

2010 First International Conference on Networking and Computing Pub Date : 2010-11-17 DOI: 10.1109/IC-NC.2010.25

S. Nguyen, S. Oyanagi

引用次数: 8

Design and Implementation of a Uniform Platform to Support Multigenerational GPU Architectures for High Performance Stream-Based Computing 一个统一平台的设计与实现，以支持多代GPU架构的高性能流计算

2010 First International Conference on Networking and Computing Pub Date : 2010-11-17 DOI: 10.1109/IC-NC.2010.35

S. Yamagiwa, Masahiro Arai, K. Wada

引用次数: 1

Loop Performance Improvement for Min-cut Program Decomposition Method 最小割程序分解法的循环性能改进

2010 First International Conference on Networking and Computing Pub Date : 2010-11-17 DOI: 10.1109/IC-NC.2010.47

K. Ootsu, Takeshi Abe, T. Yokota, T. Baba

{"title":"Loop Performance Improvement for Min-cut Program Decomposition Method","authors":"K. Ootsu, Takeshi Abe, T. Yokota, T. Baba","doi":"10.1109/IC-NC.2010.47","DOIUrl":"https://doi.org/10.1109/IC-NC.2010.47","url":null,"abstract":"In recent years, speedup by the thread level parallel processing becomes more and more important with the spread of multi-core processors, and various techniques for parallelizing the single thread code into the efficient multithreaded code that can achieve efficient thread level parallel processing have been developed. The speculative multithreading is an important technology for achieving the high performance by the thread level parallel processing. To improve the execution performance by speculative multithreading, it is necessary to appropriately decompose the program code. Against the background of this, T. A. Johnson, et al. proposed a program decomposition technique (hereafter, we refer to their method as min-cut method) for finding the decomposition pattern that can minimize the effects of the performance degradation factors, by finding the minimum cut set in the weighted control flow graph (CFG) of the program. The min-cut method is wide coverage and a very promising technique since the whole program can be decomposed without being restricted to the logical structures, such as loop. However, the min-cut method has a problem that the loop level parallelism cannot be utilized enough. In this paper, we propose an improved method for the min-cut method to enhance the loop execution performance. Our method is based on the min-cut method and tries to apply the loop unrolling to the loop in the target program codes during the process of the decomposition. We apply our method to the practical program codes selected from the SPEC CINT2000 benchmarks. The results show that the loops, that are not decomposed with the min-cut method, are decomposed, and the possibilities of making use of the loop level parallelism increased. In addition, the results of the performance evaluation by using a cycle-based simulator show that our method can improve the loop execution performance, as compared to the min-cut method.","PeriodicalId":375145,"journal":{"name":"2010 First International Conference on Networking and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128797178","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

Design an Implementation of Bee Hive in a Mult-agent Based Resource Discovery Method in P2P Systems 基于多代理的P2P系统中蜂箱资源发现方法的实现设计

2010 First International Conference on Networking and Computing Pub Date : 2010-11-17 DOI: 10.1109/IC-NC.2010.20

Junpei Yamasaki, Y. Kambayashi

引用次数: 0

An Efficient Path Setup for a Photonic Network-on-Chip 片上光子网络的有效路径设置

2010 First International Conference on Networking and Computing Pub Date : 2010-11-17 DOI: 10.1109/IC-NC.2010.31

Cisse Ahmadou Dit Adi, Hiroki Matsutani, M. Koibuchi, H. Irie, T. Miyoshi, T. Yoshinaga

{"title":"An Efficient Path Setup for a Photonic Network-on-Chip","authors":"Cisse Ahmadou Dit Adi, Hiroki Matsutani, M. Koibuchi, H. Irie, T. Miyoshi, T. Yoshinaga","doi":"10.1109/IC-NC.2010.31","DOIUrl":"https://doi.org/10.1109/IC-NC.2010.31","url":null,"abstract":"Electrical Network-on-Chip (NoC) faces critical challenges in meeting the high performance and low power consumption requirements for future multicore processors interconnection. Recent tremendous advances in CMOS compatible optical components give the potential for photonics to deliver an efficient NoC performance at an acceptable energy cost. However, the lack of in ¿ight processing and buffering of optical data made the realization of a fully optical NoC complicated. A hybrid architecture which uses optical high bandwidth transfer and a tiny electrical control network can take advantage of both interconnection methods to offer an efficient performance-per-watt infrastructure to connect multicore processors and System-on-Chip (SoC). In this paper, we propose a hybrid photonic torus NoC (HPNoC) that uses a predictive switching to improve the performance of a hybrid architecture. By using prediction techniques, we can reduce the path set up latency for the electrical control network hence improving the overall end-to-end delay for communication in the HPNoC. Simulation results using a cycle accurate simulator under uniform, neighbor and bit reversal traffic patterns for 64 nodes show that predictive switching considerably improves the HPNoC overall performance.","PeriodicalId":375145,"journal":{"name":"2010 First International Conference on Networking and Computing","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123133443","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}

引用次数: 16

Optimization Vector Quantization by Adaptive Associative-Memory-Based Codebook Learning in Combination with Huffman Coding 基于自适应联想记忆的码本学习与霍夫曼编码相结合的优化矢量量化

2010 First International Conference on Networking and Computing Pub Date : 2010-11-17 DOI: 10.1109/IC-NC.2010.38

A. Kawabata, T. Koide, H. Mattausch

引用次数: 3