发布求助
文献互助 智能选刊 最新文献

2011 40th International Conference on Parallel Processing Workshops最新文献

筛选
英文 中文
Connectivity Modeling of Vehicular Ad Hoc Networks in Signalized City Roads 城市信号化道路车辆自组织网络的连通性建模
2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.60
P. Sahoo, Ming-Jer Chiang, Shih-Lin Wu
{"title":"Connectivity Modeling of Vehicular Ad Hoc Networks in Signalized City Roads","authors":"P. Sahoo, Ming-Jer Chiang, Shih-Lin Wu","doi":"10.1109/ICPPW.2011.60","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.60","url":null,"abstract":"Connectivity in vehicular ad hoc networks(VANETs) exhibits stronger challenges than that in other general ad hoc networks. In this paper inter vehicular connectivity is analyzed among different length of vehicles that are running along the city roads. Considering the traffic signals, connectivity among the vehicles waiting at different intersections is analyzed taking the safe distance into account. Besides, car following model is used to formulate the connectivity among vehicles with different speed on a multi lane road with several intersections. Simulation results show that performance in terms of packet forwarding is very good for the vehicles with least speed. Duration of connectivity among vehicles at any intersection is reduced for the vehicles with higher speed.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130066910","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}
引用次数: 10
Pre-computing Function Results in Multi-Core and Many-Core Processors 多核和多核处理器的预计算功能
2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.46
Edward C. Herrmann, Prudhvi Janga, P. Wilsey
{"title":"Pre-computing Function Results in Multi-Core and Many-Core Processors","authors":"Edward C. Herrmann, Prudhvi Janga, P. Wilsey","doi":"10.1109/ICPPW.2011.46","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.46","url":null,"abstract":"In recent years, the number of hardware supported threads in desktop processors has increased dramatically. All but the very lowest cost net books and embedded processors now have at least dual cores and soon systems supporting upwards of 8 to 16 hardware threads are likely to be commonplace. Unfortunately, it will be difficult to take full advantage of the parallelism emerging processors will be able to provide. To help address this issue, we are investigating mechanisms to pre-compute function results in separate threads running concurrently with the main program thread. The concurrent threads are forked automatically and without program modification. A critical component for the success of this idea is an ability to build a background thread that can pre-compute usable results in some effective manner. For some support functions (dynamic memory) exact arguments predictions for the function pre-computation are not necessary, for others (trigonometric functions) they are. In work with dynamic memory, we are able to pre-compute memory blocks and show modest speedup: saving approximately 25% of the dynamic memory costs. In studies with predicting argument values to trigonometric functions, we show that learning algorithms are able to successfully predict the next argument values approximately 44% of the time.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126951963","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}
引用次数: 1
Simulation of Large-Scale HPC Architectures 大规模HPC架构的仿真
2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.44
Ian S. Jones, C. Engelmann
{"title":"Simulation of Large-Scale HPC Architectures","authors":"Ian S. Jones, C. Engelmann","doi":"10.1109/ICPPW.2011.44","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.44","url":null,"abstract":"The Extreme-scale Simulator (xSim) is a recently developed performance investigation toolkit that permits running high-performance computing (HPC) applications in a controlled environment with millions of concurrent execution threads. It allows observing parallel application performance properties in a simulated extreme-scale HPC system to further assist in HPC hardware and application software co-design on the road toward multi-petascale and exascale computing. This paper presents a newly implemented network model for the xSim performance investigation toolkit that is capable of providing simulation support for a variety of HPC network architectures with the appropriate trade-off between simulation scalability and accuracy. The taken approach focuses on a scalable distributed solution with latency and bandwidth restrictions for the simulated network. Different network architectures, such as star, ring, mesh, torus, twisted torus and tree, as well as hierarchical combinations, such as to simulate network-on-chip and network-on-node, are supported. Network traffic congestion modeling is omitted to gain simulation scalability by reducing simulation accuracy.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132488168","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}
引用次数: 15
Parallel Response Query Tree Splitting for RFID Tag Anti-collision 面向RFID标签防碰撞的并行响应查询树分割
2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.62
Ming-Kuei Yeh, Jehn-Ruey Jiang, Shing-Tsaan Huang
{"title":"Parallel Response Query Tree Splitting for RFID Tag Anti-collision","authors":"Ming-Kuei Yeh, Jehn-Ruey Jiang, Shing-Tsaan Huang","doi":"10.1109/ICPPW.2011.62","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.62","url":null,"abstract":"In an RFID system, a tag can be identified by a reader when it moves into the interrogation zone of the reader. Collisions occur when tags using backscatter technology respond their IDs to the reader at the same carrier frequency simultaneously. The performance of tag identification is degraded by collisions, so it is important to reduce them. Several anti-collision protocols have been proposed for reducing tag collisions. They can be categorized into two classes: ALOHA-based and tree-based protocols. In this paper, we propose a 4-ary query tree-based anti-collision protocol, namely parallel response query tree (PRQT) protocol, to improve the performance of tag identification. In PRQT protocol, the tags with the ID prefix matching the reader¶s request bit string or the complementary of the string are arranged to respond in two sub carriers in parallel. We also conduct simulation experiments for the proposed protocol and compare it with related ones to demonstrate its advantages.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131695461","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}
引用次数: 9
Sliding-Typed Communication Range Recognition Method for Indoor Position Estimation in Passive RFID Systems 无源射频识别系统中室内位置估计的滑动式通信距离识别方法
2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.29
Atsuki Inada, Y. Oda, E. Nakamori, Manato Fujimoto, T. Wada, K. Mutsuura, H. Okada
{"title":"Sliding-Typed Communication Range Recognition Method for Indoor Position Estimation in Passive RFID Systems","authors":"Atsuki Inada, Y. Oda, E. Nakamori, Manato Fujimoto, T. Wada, K. Mutsuura, H. Okada","doi":"10.1109/ICPPW.2011.29","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.29","url":null,"abstract":"RFID (Radio Frequency Identification) systems have become meaningful as a new identification source that is applicable in ubiquitous environments. Each RFID tag has a unique ID, and is attached to an object. A user reads the unique ID of an RFID tag with RFID readers and obtains the information of the object. One of the most important technologies that use the RFID system is the position estimation of RFID tags. The position estimation means to estimates the location of the object with the RFID tag. It is very useful to acquire the location information of RFID tag. If a user understands the position of the RFID tag, a new navigation system for persons in complex buildings. In this paper, we propose a new method for accurate indoor position estimation of passive RFID systems named as the Sliding-Typed CRR method. In this method, the position of an RFID tag is estimated by using S-CRR (Swift Communication Range Recognition) method. The proposed method is capable of accurate position estimation in any directions of RFID tags.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125404471","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
Agent-Based Adaptive Resource Allocation on the Cloud Computing Environment 云计算环境下基于agent的自适应资源分配
2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.18
Gihun Jung, K. Sim
{"title":"Agent-Based Adaptive Resource Allocation on the Cloud Computing Environment","authors":"Gihun Jung, K. Sim","doi":"10.1109/ICPPW.2011.18","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.18","url":null,"abstract":"Since both consumers and data centers of a cloud service provider can be distributed in geographically, the provider needs to allocate each consumer request to an appropriate data center among the distributed data centers, so that the consumers can satisfy with the service in terms of fast allocation time and execution response time. In this paper, we propose an adaptive resource allocation model that allocates the consumer's job to an appropriate data center. The method to adaptively find a proper data center is based on two evaluations: 1) the geographical distance (network delay)between a consumer and data centers, and 2) the workload of each data center. The proposed model is implemented in an agent based test bed. The test bed simulates a cloud computing environment adopting the proposed adaptive resource allocation model. Empirical results were obtained from simulations using the test bed. The results suggest that the proposed model can successfully allocate consumers' requests to the data center closest to each consumer. Also, the proposed model shows a better response time for allocation than related resource allocation models.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125604048","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}
引用次数: 52
A Security Framework of Group Location-Based Mobile Applications in Cloud Computing 云计算环境下基于群组位置的移动应用安全框架
2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.6
Yu-Jia Chen, Li-Chun Wang
{"title":"A Security Framework of Group Location-Based Mobile Applications in Cloud Computing","authors":"Yu-Jia Chen, Li-Chun Wang","doi":"10.1109/ICPPW.2011.6","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.6","url":null,"abstract":"In this paper, we present a secure frame-work when the location information of mobile terminals is utilized in a cloud computing environment. Because cloud computing provides powerful storage capability and scalability, many application providers start migrating the data stored in their original databases to outsourced databases (ODB), such as AMAZONSIMPLEDB. However, because of the multiple tenants and multiple replicas of data in the cloud databases, the security issues of location-based services (LBS)become more serious in cloud computing. In this paper, we propose a security model for LBS using ODB and demonstrate how we can use distributed storage and international mobile subscriber identity (IMSI) as user identification to secure the location data. Enhanced privacy and authentication mechanisms on top of the suggested security framework are also proposed, which achieve significant improvements in privacy, authentication, and continuity when providing LBS in cloud computing. Simulation results show that network coding scheme has better performance than hash function scheme.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122261669","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}
引用次数: 51
Barrier Coverage Constructions for Border Security Systems Using Wireless Sensors 利用无线传感器构建边境安全系统的屏障覆盖
2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.31
Koji Yamamoto, Hayato Ozaki, Takuya Suzuki, T. Wada, K. Mutsuura, H. Okada
{"title":"Barrier Coverage Constructions for Border Security Systems Using Wireless Sensors","authors":"Koji Yamamoto, Hayato Ozaki, Takuya Suzuki, T. Wada, K. Mutsuura, H. Okada","doi":"10.1109/ICPPW.2011.31","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.31","url":null,"abstract":"In this paper, we propose network construction methods of sensor nodes for Border Security Systems. A Border Security System watches intruders by using sensor nodes with communication function. The detection of some intruders and the use of a long-term operation system are required in this system. In this paper, we propose two methods to reduce the power consumption of the whole network system by effective control of sensor nodes. By computer simulation, we show that the proposed network construction methods are suitable for Border Security Systems.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121241238","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}
引用次数: 8
Energy-Aware Workload Consolidation on GPU GPU上的能量感知工作负载整合
2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.25
Dong Li, S. Byna, S. Chakradhar
{"title":"Energy-Aware Workload Consolidation on GPU","authors":"Dong Li, S. Byna, S. Chakradhar","doi":"10.1109/ICPPW.2011.25","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.25","url":null,"abstract":"Enterprise workloads like search, data mining and analytics, etc. typically involve a large number of users who are simultaneously using applications that are hosted on clusters of commodity computers. Use of GPUs for enterprise computing is challenging because of poor performance and higher energy consumption compared to running enterprise workloads on CPUs. In this paper, we show that the GPU work consolidation can improve system throughput and results in significant energy savings over multicore CPUs. We develop a novel runtime framework that dynamically consolidates instances from different workloads from multiple user processes into a single GPU workload. However, arbitrary consolidation of GPU workloads does not always lead to better energy efficiency. We use new GPU performance and power models to make predictions for potential workload consolidation alternatives and identify useful consolidations. Our experiments on a variety of workloads (that perform poorly on a GPU compared to well optimized multicore CPU implementations) show that the proposed framework for GPUcan provide 2X to 22X energy benefit over a multicore CPU.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116539795","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}
引用次数: 29
A Study for Connection Establishment in Femtocell Network 移动蜂窝网络中连接建立的研究
2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.13
Yu-Ching Hsu, Show-Shiow Tzeng, Ching-Wen Huang
{"title":"A Study for Connection Establishment in Femtocell Network","authors":"Yu-Ching Hsu, Show-Shiow Tzeng, Ching-Wen Huang","doi":"10.1109/ICPPW.2011.13","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.13","url":null,"abstract":"The F-BSs (Fem to-Base Stations) are deployed indoors and connect to the mobile core network through fixed broadband access network which is paid by users. The power and serviced cell of an F-BS is much smaller than that of an outdoor M-BS (Macro-Base Station). However, F-BS is a good solution to improve the indoor coverage and to reduce the number of outdoor M-BSs and the therefore cost, including backhaul costs. Therefore, the tariff for connections through FBSs should be cheaper than those through M-BSs. Thus, users would prefer make connections via F-BSs rather than via MBSs. This paper proposes a novel scheme by redirecting an idle UE (User Equipment) to its accessible F-BS, if available, whenever the UE makes a call. This novel scheme is completely compatible to existing 3GPP standards and can be adopted in RNCs (Radio Network Controllers) immediately. Our study shows the proposed scheme does increase the probability of making calls via F-BSs in terms of longer call setup time.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116556600","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信