A. Sena, A. P. Nascimento, Cristina Boeres, Vinod E. F. Rebello
{"title":"EasyGrid Enabling of Iterative Tightly-Coupled Parallel MPI Applications","authors":"A. Sena, A. P. Nascimento, Cristina Boeres, Vinod E. F. Rebello","doi":"10.1109/ISPA.2008.122","DOIUrl":"https://doi.org/10.1109/ISPA.2008.122","url":null,"abstract":"This paper addresses the challenge of how to permit tightly coupled parallel applications, optimised for uniform, stable, static environments, execute equally efficiently in environments which exhibit the complete opposite characteristics. Using the N-body problem as a case study, both the traditional and proposed grid enabled MPI implementations of the popular ring algorithm are analysed. Results with respect to performance show the latter approach to be competitive on a cluster and significantly more effective in heterogeneous and dynamic environments.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"9 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126115347","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}
{"title":"An Empirical Comparison of Pen Pressure and Pen Tilt Input Techniques","authors":"Xiaolei Zhou, Xiangshi Ren, Yue Hui","doi":"10.1109/ISPA.2008.114","DOIUrl":"https://doi.org/10.1109/ISPA.2008.114","url":null,"abstract":"Three experiments were conducted in this study to investigate the human ability to control pen pressure and pen tilt input, coupling cursor position, angle and scale respectively. Comparisons between pressure input and tilt input have been made in the three experiments. Experimental results show that decreasing pressure input resulted in very bad performance and was not a good input technique for any of the three experiments. In \"experiment1-coupling to cursor position\", the tilt input technique performed relatively better than the increasing pressure input technique, even though the tilt technique had a slightly higher error rate. In \"experiment2-coupling to cursor angle\", the tilt input performed relatively better than the increasing pressure input in terms of time. In \"experiment3-coupling to cursor scale\", tilt input performed a little better than increasing pressure input in terms of adjustment time, but a little worse in terms of the degree of control that users exerted. These results will be useful for further user interface design.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123377286","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}
Ismail Khalil, M. A. Feki, Gabriele Anderst-Kotsis
{"title":"A Datalog Model for Context Reasoning in Pervasive Environments","authors":"Ismail Khalil, M. A. Feki, Gabriele Anderst-Kotsis","doi":"10.1109/ISPA.2008.168","DOIUrl":"https://doi.org/10.1109/ISPA.2008.168","url":null,"abstract":"Context is considered by research community in pervasive computing, and particularly in context awareness, to be subject to the available environmental sensors to retrieve the suitable information to the user. For example, the users context is based on location information or even based on other deterministic information, such as time (morning, evening, 11:00 am, etc.). The challenge is to also consider the user as a parameter influencing the context in addition to environmental information collected by sensors. This implies that human factors should be highly considered in order to formalize the ldquouser profilerdquo as an input to context awareness (context reasoning) and also as an output to the context adaptation. This vision, which we have adopted in this paper, implied to investigate both, the user actions acting in his or her living environment (Human behavior, preferences, etc.), and the context reasoning sensitive to human factors.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131308709","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}
{"title":"Adapting the Hyper-Ring Interconnect for Many-Core Processors","authors":"F. Sibai","doi":"10.1109/ISPA.2008.72","DOIUrl":"https://doi.org/10.1109/ISPA.2008.72","url":null,"abstract":"This paper makes the case for the Hyper-Ring as the interconnect or NoC for many-cores. While other prominent candidates for many-core interconnect such as the torus and mesh have superior bisection bandwidth to the HR, their cost, number of links and chip area are much higher than the HR. The worst-case latency or maximum hop count is relatively inferior on the mesh, while that of the HR is comparative to that of the torus for about a 100 core nodes. Moreover, the HR resembles more the LANs and WANs which have dedicated gateway or router nodes. We present a many-core floorplan where adjacent pairs of cores share an L2 cache memory and where the cores are interconnected according the HR topology. We also address L2 cache partitioning and coherence in HR-connected many-core processors and how such a processor can be tolerant of faulty links and nodes. The HR-connected many-core processor is naturally tolerant of core and link faults owing to its double second directional rings. To keep the same amount of operational hardware and the same performance levels in the presence of faults, we present a circuit for bypassing faulty cores and replacing them by spare cores.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126478366","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}
{"title":"Movement Awareness Position-Based Routing Protocol for Intersection of Urban Environment","authors":"Yunho Jung, Keecheon Kim","doi":"10.1109/ISPA.2008.112","DOIUrl":"https://doi.org/10.1109/ISPA.2008.112","url":null,"abstract":"The vehicle networks on the urban roads have many important factors that influence the performance, such as street layouts and intersections with traffic signs, or inter-vehicle interactions. Thus it is important to use a realistic mobility model. We use real world road layouts in TIGER and compared the performance of the GPSR (position based routing) and the OLSR (reactive routing) popular routing protocol. In this paper, we suggest a position-based routing scheme designed for communication with control node at intersection area, like light controller, in urban environment.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116437482","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}
{"title":"QPID: A Distributed Priority Queue with Item Locality","authors":"R. Bajpai, K. Dhara, V. Krishnaswamy","doi":"10.1109/ISPA.2008.90","DOIUrl":"https://doi.org/10.1109/ISPA.2008.90","url":null,"abstract":"Distributed systems have evolved from highly regular systems to irregular systems that are not based on any specific architecture. Highly optimized distributed algorithms that are often variants of classic data structures have been developed for these systems. However, such approaches may not be effective for applications built on loosely coupled irregular distributed systems. In this paper, we look at distributed priority queues for such systems, where the locality of items cannot be altered and bottlenecks at any one node should be avoided. We present QPID, a new distributed priority queue algorithm for irregular distributed systems in which nodes communicate via message passing only. We introduce mechanisms to track and update the head of a logical distributed priority queue without moving items between nodes and avoiding bottlenecks at any single node. A novel lazy update scheme is employed for improving the efficiency of our algorithm. We present our analysis of QPID and argue its correctness.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129672506","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}
{"title":"Misusing Kademlia Protocol to Perform DDoS Attacks","authors":"Zhoujun Li, Xiaoming Chen","doi":"10.1109/ISPA.2008.15","DOIUrl":"https://doi.org/10.1109/ISPA.2008.15","url":null,"abstract":"Kademlia-based DHT has been deployed in many P2P applications and it is reported that there are millions of simultaneous users in Kad network. For such a protocol that significantly involves so many peers, its robustness and security must be evaluated carefully. In this paper, we analyze the Kademlia protocol and identify several potential vulnerabilities. We classify potential attacks as three types: asymmetric attack, routing table reflection attack and index reflection attack. A limited real-world experiment was run on eMule and the results show that these attacks tie up bandwidth and TCP connection resources of victim. We analyze the results of our experiment in three aspects: the effect of DDoS attacks by misusing Kad in eMule, the comparison between asymmetric attack and routing table reflection attack, and the distribution of attacks. More large-scale DDoS attack can be performed by means of a little more effort. We introduce some methods to amplify the performance of attack and some strategies to evade detection. Finally, we further discuss several solutions for these DDoS attacks.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133405533","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}
Mohammed Al Zomai, A. Jøsang, Adrian McCullagh, Ernest Foo
{"title":"Strengthening SMS-Based Authentication through Usability","authors":"Mohammed Al Zomai, A. Jøsang, Adrian McCullagh, Ernest Foo","doi":"10.1109/ISPA.2008.57","DOIUrl":"https://doi.org/10.1109/ISPA.2008.57","url":null,"abstract":"Current state-of-the art solutions for online banking authentication and identity management include methods for re-authenticating users via out-of-band channels for each transaction. SMS-based schemes belong to this category, and can provide strong authentication to protect against security attacks. Poor usability of these schemes is still a problem, which makes them vulnerable to other obvious attacks. This paper describes a method for improving the usability of typical SMS-based authentication schemes which thereby will improve their overall security.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132704011","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}
David J. Claypool, K. Mcneill, T. McNevin, Raja R. Balan
{"title":"A Feasible Modular Mesh Networking Platform for Vehicular Ad Hoc Networks","authors":"David J. Claypool, K. Mcneill, T. McNevin, Raja R. Balan","doi":"10.1109/ISPA.2008.50","DOIUrl":"https://doi.org/10.1109/ISPA.2008.50","url":null,"abstract":"As more wireless communications protocols become widely available, more affordable, and more capable, there exists an opportunity to combine standardized products with advanced mesh networking technology in such a way to dramatically improve on-the-move roadway vehicle communications capabilities. These capabilities can support the intelligent transportation system concepts for safety as well as provide consumer services. This paper discusses the scenarios and feasible deployments of such a combination of technology. These scenarios outline a characteristic combination of existing commercial off-the-shelf hardware and available software to meet a demand of supporting network consumers on multiple layers of the transit network. Critical to this discussion is a feasible cost-effective extensible implementation framework made possible through the inclusion of a robust mesh networking protocol. Unlike legacy cellular networks, initial investment can be more gradual while providing a robust regional capability.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116507798","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}
{"title":"Wideband Stacked Microstrip Patch Antenna for Wireless Communication","authors":"M. Islam, N. Misran, M. Shakib, B. Yatim","doi":"10.1109/ISPA.2008.76","DOIUrl":"https://doi.org/10.1109/ISPA.2008.76","url":null,"abstract":"A wideband stacked microstrip patch antenna is presented. The proposed structure combines the merits of the stacked patch antennas and L-shaped feed for broadband operation. This paper presents extended E and H shaped patch stacked with rectangular patch (53 mm times 35 mm). The composite effect of integrating inverting techniques and by introducing the proposed patch, offer a low profile, high gain, and compact antenna element. The simulated impedance bandwidth of the proposed antenna is 680 MHz (33%). It is shown that the wide bandwidth is caused by a two-frequency resonance. The study showed maximum achievable gain of about 9.58 dBi and gain variation of 0.76 dBi between the frequency ranges of 1.72 GHz to 2.4 GHz. Details of the proposed compact and broadband design is presented and discussed in this paper.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129511366","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}