S. Fiore, Alessandro Negro, S. Vadacca, M. Cafaro, G. Aloisio, R. Barbera, E. Giorgio
In a growing number of scientific disciplines, large data collections are emerging as important community resources. Data and metadata management exploiting the data grid paradigm is becoming more and more important as the number of involved data sources is continuously increasing and decentralizing. Efficient grid data access services are perceived as mandatory components for data management. In the grid data management area the GRelC Project has been addressing efficiency, transparency, interoperability and security issues, providing grid enabled solutions and proposing a set of data access and integration/federation services. In this paper we present the advances related to the GRelC Data Access, highlighting differences and innovations w.r.t. previous work. Basic foundations about the grid-enabled queries provided by the GRelC DAS and experimental results related to a bioinformatics international testbed on the GILDA t-Infrastructure are also reported and discussed.
{"title":"Advances in the GRelC Data Access Service","authors":"S. Fiore, Alessandro Negro, S. Vadacca, M. Cafaro, G. Aloisio, R. Barbera, E. Giorgio","doi":"10.1109/ISPA.2008.87","DOIUrl":"https://doi.org/10.1109/ISPA.2008.87","url":null,"abstract":"In a growing number of scientific disciplines, large data collections are emerging as important community resources. Data and metadata management exploiting the data grid paradigm is becoming more and more important as the number of involved data sources is continuously increasing and decentralizing. Efficient grid data access services are perceived as mandatory components for data management. In the grid data management area the GRelC Project has been addressing efficiency, transparency, interoperability and security issues, providing grid enabled solutions and proposing a set of data access and integration/federation services. In this paper we present the advances related to the GRelC Data Access, highlighting differences and innovations w.r.t. previous work. Basic foundations about the grid-enabled queries provided by the GRelC DAS and experimental results related to a bioinformatics international testbed on the GILDA t-Infrastructure are also reported and discussed.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"43 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":"126737641","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}
Security incident response is a major activity to guarantee the protection of information systems. We develop in this paper a methodology for automatically determining responses to security incidents based on a new category of cognitive maps, referred to as incident response probabilistic cognitive map. The main issue addressed in this paper is the development of a methodology using mathematical tools for reasoning about the constructed cognitive map to identify the attack, to reduce its complexity, and to search for the decision responding to the detected attack. The main features have been highlighted showing the complexity of the incident response team role.
{"title":"Incident Response Probabilistic Cognitive Maps","authors":"J. Krichène, N. Boudriga","doi":"10.1109/ISPA.2008.33","DOIUrl":"https://doi.org/10.1109/ISPA.2008.33","url":null,"abstract":"Security incident response is a major activity to guarantee the protection of information systems. We develop in this paper a methodology for automatically determining responses to security incidents based on a new category of cognitive maps, referred to as incident response probabilistic cognitive map. The main issue addressed in this paper is the development of a methodology using mathematical tools for reasoning about the constructed cognitive map to identify the attack, to reduce its complexity, and to search for the decision responding to the detected attack. The main features have been highlighted showing the complexity of the incident response team role.","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":"131243062","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}
As the cornerstone of effective patient-physician relationships in the traditional healthcare infrastructures, trust faces new opportunities and challenges in the ubiquitous healthcare. Ubiquitous healthcare enables the agents acquire more information on trust evaluation through effectively resource sharing. Yet ubiquitous healthcare also lays the agents in a more dynamic and uncertainty environment for the trust evaluations. This paper contributes to develop a distributed trust management for the ubiquitous healthcare. Our trust management infrastructure is responsible for evaluating the trust value and assigning access rights based on the trust value. Based on each agent's confidence of its personal experience on other agents, three naive Bayes classifier based algorithms are introduced for the trust evaluation: the robust experience algorithm, the weak experience algorithm and the no experience algorithm. The simulation results show the feasibility and effectiveness of our trust management in the ubiquitous healthcare.
{"title":"Trust Management for Ubiquitous Healthcare","authors":"Weiwei Yuan, D. Guan, Sungyoung Lee","doi":"10.1109/ISPA.2008.117","DOIUrl":"https://doi.org/10.1109/ISPA.2008.117","url":null,"abstract":"As the cornerstone of effective patient-physician relationships in the traditional healthcare infrastructures, trust faces new opportunities and challenges in the ubiquitous healthcare. Ubiquitous healthcare enables the agents acquire more information on trust evaluation through effectively resource sharing. Yet ubiquitous healthcare also lays the agents in a more dynamic and uncertainty environment for the trust evaluations. This paper contributes to develop a distributed trust management for the ubiquitous healthcare. Our trust management infrastructure is responsible for evaluating the trust value and assigning access rights based on the trust value. Based on each agent's confidence of its personal experience on other agents, three naive Bayes classifier based algorithms are introduced for the trust evaluation: the robust experience algorithm, the weak experience algorithm and the no experience algorithm. The simulation results show the feasibility and effectiveness of our trust management in the ubiquitous healthcare.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"12 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":"133378936","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}
R. Tynan, Gregory M. P. O'Hare, M. O'Grady, C. Muldoon
As the cost and size of WSN nodes reduce, it will be possible for deployments to provide node densities far in excess of the resolution requirements of any one single application. When this is the case, multiple, independent Virtual Sensor Networks (VSNs) can be maintained on the same physical deployment that satisfy distinct application requirements. In addition to this, nodes not part of any VSN can be considered redundant and can therefore be opportunistically hibernated. In this paper, the disadvantages of a layered approach to achieving such a system are demonstrated. An architecture based on a Multi-Agent System (MAS) is proposed as an alternative to alleviate some of the problems with the layered technique. Utilising a MAS facilitates the distribution of new VSNs onto a deployed WSN and permits heterogeneous timing regimes to be implemented that allow optimal performance of the individual VSNs.
{"title":"Virtual Sensor Networks: An Embedded Agent Approach","authors":"R. Tynan, Gregory M. P. O'Hare, M. O'Grady, C. Muldoon","doi":"10.1109/ISPA.2008.91","DOIUrl":"https://doi.org/10.1109/ISPA.2008.91","url":null,"abstract":"As the cost and size of WSN nodes reduce, it will be possible for deployments to provide node densities far in excess of the resolution requirements of any one single application. When this is the case, multiple, independent Virtual Sensor Networks (VSNs) can be maintained on the same physical deployment that satisfy distinct application requirements. In addition to this, nodes not part of any VSN can be considered redundant and can therefore be opportunistically hibernated. In this paper, the disadvantages of a layered approach to achieving such a system are demonstrated. An architecture based on a Multi-Agent System (MAS) is proposed as an alternative to alleviate some of the problems with the layered technique. Utilising a MAS facilitates the distribution of new VSNs onto a deployed WSN and permits heterogeneous timing regimes to be implemented that allow optimal performance of the individual VSNs.","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":"129130260","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}
In this work, we study the behaviour of different resource scheduling strategies when doing job orchestration in grid environments. We empirically demonstrate that scheduling strategies based on reinforcement learning are a good choice to improve the overall performance of grid applications and resource utilization.
{"title":"RL-Based Scheduling Strategies in Actual Grid Environments","authors":"B. F. Costa, I. Dutra, M. Mattoso","doi":"10.1109/ISPA.2008.119","DOIUrl":"https://doi.org/10.1109/ISPA.2008.119","url":null,"abstract":"In this work, we study the behaviour of different resource scheduling strategies when doing job orchestration in grid environments. We empirically demonstrate that scheduling strategies based on reinforcement learning are a good choice to improve the overall performance of grid applications and resource utilization.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"14 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":"131749124","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}
Ahmad Jabas, R. M. Garimella, Ramachandram Sirandas
A wireless ad hoc network (MANET) is a collection of autonomous nodes or terminals that communicate with each other by forming a multihop radio network and maintaining connectivity in a decentralized manner. MANET is characterized by a rapidly changed topology. As a result packets select different multi-hops paths to reach their destinations. Even though packets are somehow independent from each other, there are still some hidden relations (patterns) among them. These relations may be utilized to give useful information to different MANET protocols. In this work, association rules technique is applied in time domain to obtain these hidden relations.
{"title":"MANET Mining: Mining Temporal Association Rules","authors":"Ahmad Jabas, R. M. Garimella, Ramachandram Sirandas","doi":"10.1109/ISPA.2008.66","DOIUrl":"https://doi.org/10.1109/ISPA.2008.66","url":null,"abstract":"A wireless ad hoc network (MANET) is a collection of autonomous nodes or terminals that communicate with each other by forming a multihop radio network and maintaining connectivity in a decentralized manner. MANET is characterized by a rapidly changed topology. As a result packets select different multi-hops paths to reach their destinations. Even though packets are somehow independent from each other, there are still some hidden relations (patterns) among them. These relations may be utilized to give useful information to different MANET protocols. In this work, association rules technique is applied in time domain to obtain these hidden relations.","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":"129434460","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}
Most workflow management systems nowadays are based on centralized client/server architecture. Under this architecture, the response time of request might increase unacceptably when the number of users who login to the system increase quickly and a large amount of requests are sent to the centralized server within a short time period. Parallel server architecture could help to resolve the performance bottleneck of a single server. However, a static parallel architecture with a fixed number of servers is not efficient at resource utilization because the numbers of users and their requests usually change time by time, especially for big and fast changes. This paper presents an effective architecture of dynamic resource-provisioning and then the implementation for a parallel workflow management system. There are a series of experiments conducted and the results indicate that it is an effective approach to handling the time-varying workloads in real world WfMS.
{"title":"Dynamic Provisioning of a Parallel Workflow Management System","authors":"Ching-Hong Tsai, Kuo-Chan Huang, Feng-Jian Wang","doi":"10.1109/ISPA.2008.116","DOIUrl":"https://doi.org/10.1109/ISPA.2008.116","url":null,"abstract":"Most workflow management systems nowadays are based on centralized client/server architecture. Under this architecture, the response time of request might increase unacceptably when the number of users who login to the system increase quickly and a large amount of requests are sent to the centralized server within a short time period. Parallel server architecture could help to resolve the performance bottleneck of a single server. However, a static parallel architecture with a fixed number of servers is not efficient at resource utilization because the numbers of users and their requests usually change time by time, especially for big and fast changes. This paper presents an effective architecture of dynamic resource-provisioning and then the implementation for a parallel workflow management system. There are a series of experiments conducted and the results indicate that it is an effective approach to handling the time-varying workloads in real world WfMS.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"27 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":"131391824","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}
Pub Date : 2008-12-10DOI: 10.1504/IJHPCN.2012.046383
A. A. Zain, P. Trinder, K. Hammond
This paper describes a very high-level approach that aims to orchestrate sequential components written using high-level domain-specific programming into high-performance parallel applications. By achieving this goal, we hope to make parallel programming more accessible to experts in mathematics, engineering and other domains. A key feature of our approach is that parallelism is achieved without any modification to the underlying sequential computational algebra systems, or to the user-level components: rather, all orchestration is performed at an outer level, with sequential components linked through a standard communication protocol, the Symbolic Computing Software Composability Protocol, SCSCP. Despite the generality of our approach, our results show that we are able to achieve very good, and even, in some cases, super-linear, speedups on clusters of commodity workstations: up to a factor of 33.4 on a 28-processor cluster. We are, moreover, able to parallelise a wider variety of problem, and achieve higher performance than typical specialist parallel computational algebra implementations.
{"title":"Parallelism without Pain: Orchestrating Computational Algebra Components into a High-Performance Parallel System","authors":"A. A. Zain, P. Trinder, K. Hammond","doi":"10.1504/IJHPCN.2012.046383","DOIUrl":"https://doi.org/10.1504/IJHPCN.2012.046383","url":null,"abstract":"This paper describes a very high-level approach that aims to orchestrate sequential components written using high-level domain-specific programming into high-performance parallel applications. By achieving this goal, we hope to make parallel programming more accessible to experts in mathematics, engineering and other domains. A key feature of our approach is that parallelism is achieved without any modification to the underlying sequential computational algebra systems, or to the user-level components: rather, all orchestration is performed at an outer level, with sequential components linked through a standard communication protocol, the Symbolic Computing Software Composability Protocol, SCSCP. Despite the generality of our approach, our results show that we are able to achieve very good, and even, in some cases, super-linear, speedups on clusters of commodity workstations: up to a factor of 33.4 on a 28-processor cluster. We are, moreover, able to parallelise a wider variety of problem, and achieve higher performance than typical specialist parallel computational algebra implementations.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"14 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":"122923231","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}
Evaluation of distributed join queries often deals with an increasing data volume and low bandwidth in large scale environments. Several techniques were proposed to improve join performances. In this paper, we propose to use a new form of signatures, the algebraic signatures. We prove that these signatures combined to semi-join based join technique are very useful for reducing the communication cost in a distributed environment and focus in the semi-join based join operation. Semi-join based join is one of the most used techniques to decrease the communication cost on distributed architectures. We demonstrate that algebraic signatures are very useful to reduce significantly the amount of the data transfer between sites. Also, we have not any data decoding step in the site receiving these data. The performance study of our technique shows the reduction of the communication costs in the semi-join based join operation. Our technique can be deployed in large scale peer to peer or grid environments especially in a network with low bandwidth and strong latency.
{"title":"Performance Improving of Semi-join Based Join Operation through Algebraic Signatures","authors":"R. Mokadem, A. Hameurlain, F. Morvan","doi":"10.1109/ISPA.2008.84","DOIUrl":"https://doi.org/10.1109/ISPA.2008.84","url":null,"abstract":"Evaluation of distributed join queries often deals with an increasing data volume and low bandwidth in large scale environments. Several techniques were proposed to improve join performances. In this paper, we propose to use a new form of signatures, the algebraic signatures. We prove that these signatures combined to semi-join based join technique are very useful for reducing the communication cost in a distributed environment and focus in the semi-join based join operation. Semi-join based join is one of the most used techniques to decrease the communication cost on distributed architectures. We demonstrate that algebraic signatures are very useful to reduce significantly the amount of the data transfer between sites. Also, we have not any data decoding step in the site receiving these data. The performance study of our technique shows the reduction of the communication costs in the semi-join based join operation. Our technique can be deployed in large scale peer to peer or grid environments especially in a network with low bandwidth and strong latency.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"66 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":"121382304","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}
This paper proposes a novel node localization algorithm that collaborates with street maps to estimate the locations of mobile nodes. It uses simple motion equations for moving objects in two dimensions to estimate the location of nodes, and then verifies the estimated location using street maps. This localization algorithm reduces the number of periodic beacons propagated into the network and reduces the latency or the time delay to update location information. Performance assessment was tested by simulation using MATLAB. This algorithm can be used in routing for wireless mobile and personal area networks that use geographical routing.
{"title":"Use of Street Maps to Aid Node Localization in Mobile Wireless Networks","authors":"M. Al-Hattab, J. Agbinya","doi":"10.1109/ISPA.2008.49","DOIUrl":"https://doi.org/10.1109/ISPA.2008.49","url":null,"abstract":"This paper proposes a novel node localization algorithm that collaborates with street maps to estimate the locations of mobile nodes. It uses simple motion equations for moving objects in two dimensions to estimate the location of nodes, and then verifies the estimated location using street maps. This localization algorithm reduces the number of periodic beacons propagated into the network and reduces the latency or the time delay to update location information. Performance assessment was tested by simulation using MATLAB. This algorithm can be used in routing for wireless mobile and personal area networks that use geographical routing.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"110 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":"116176956","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：