Recently, using mobile gateway(s) as a mechanical data carries emerges as a promising approach to prolong sensor network lifetime and relaying information in partitioned network. These mobile gateways, which move in pre-determined paths, visit the sensors to upload their data. As the sensors data generation rate for different sensors may vary based on their locations, sensors need to be visited at different frequencies. In this paper, we present the problem of scheduling the mobile gatewayspsila path so that the sensorspsila visiting frequencies are satisfactory, and the sensorspsila data is uploaded to the sink at least at the frequency they are generated. We also prove that the problem is NP-Hard. In addition to integer linear programming formulation, a practical heuristic is also proposed and its performance is compared against the optimal results.
{"title":"Periodic Mobile Multi-Gateway Scheduling","authors":"Khaled Almiani, S. Selvadurai, Anastasios Viglas","doi":"10.1109/PDCAT.2008.36","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.36","url":null,"abstract":"Recently, using mobile gateway(s) as a mechanical data carries emerges as a promising approach to prolong sensor network lifetime and relaying information in partitioned network. These mobile gateways, which move in pre-determined paths, visit the sensors to upload their data. As the sensors data generation rate for different sensors may vary based on their locations, sensors need to be visited at different frequencies. In this paper, we present the problem of scheduling the mobile gatewayspsila path so that the sensorspsila visiting frequencies are satisfactory, and the sensorspsila data is uploaded to the sink at least at the frequency they are generated. We also prove that the problem is NP-Hard. In addition to integer linear programming formulation, a practical heuristic is also proposed and its performance is compared against the optimal results.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123638756","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 presents Tupleware, a cluster middleware which provides a distributed tuple space intended for use by computationally intensive scientific and numerical applications. It aims to add no extra burden to the application programmer due to the distribution of the tuple space, and uses a decentralised approach and intelligent tuple search and retrieval to provide a scalable and efficient execution environment. Tupleware is evaluated using two applications: a modified quicksort and an ocean model, which demonstrates good scalability and a low system overhead.
{"title":"Tupleware: A Distributed Tuple Space for Cluster Computing","authors":"A. Atkinson","doi":"10.1109/PDCAT.2008.63","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.63","url":null,"abstract":"This paper presents Tupleware, a cluster middleware which provides a distributed tuple space intended for use by computationally intensive scientific and numerical applications. It aims to add no extra burden to the application programmer due to the distribution of the tuple space, and uses a decentralised approach and intelligent tuple search and retrieval to provide a scalable and efficient execution environment. Tupleware is evaluated using two applications: a modified quicksort and an ocean model, which demonstrates good scalability and a low system overhead.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"472 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123073840","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 describes a new task scheduling algorithm based on clustering. In this new approach, clustering of the tasks is achieved by applying a force model to the task graph. From an initial configuration of the task graph, forces act upon the nodes to manoeuvre them into a low energy or equilibrium state. Clusters are created from the equilibrium state and scheduled for an unlimited number of processors. This algorithm is compared in an extensive experimental evaluation to three other clustering algorithms namely, linear, single edge and dominant sequence clustering. By keeping the mapping and scheduling phases of the algorithms identical, we compare only the difference in clustering between all algorithms. Results show that force directed clustering is very promising, especially for a limited number of processors.
{"title":"Scheduling Algorithm Based on Force Directed Clustering","authors":"A. Palmer, O. Sinnen","doi":"10.1109/PDCAT.2008.89","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.89","url":null,"abstract":"This paper describes a new task scheduling algorithm based on clustering. In this new approach, clustering of the tasks is achieved by applying a force model to the task graph. From an initial configuration of the task graph, forces act upon the nodes to manoeuvre them into a low energy or equilibrium state. Clusters are created from the equilibrium state and scheduled for an unlimited number of processors. This algorithm is compared in an extensive experimental evaluation to three other clustering algorithms namely, linear, single edge and dominant sequence clustering. By keeping the mapping and scheduling phases of the algorithms identical, we compare only the difference in clustering between all algorithms. Results show that force directed clustering is very promising, especially for a limited number of processors.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121561039","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}
C. Muldoon, Gregory M. P. O'Hare, M. O'Grady, R. Tynan
Intelligent agents offer a viable paradigm for enabling AmI applications and services. As WSN technologies are anticipated to provide an indispensable component in many application domains, the need for enabling the agent paradigm to encompass such technologies becomes more urgent. The resource-constrained ad-hoc nature of WSNs poses significant challenges to conventional agent frameworks. In particular, the implications for agent functionality and behaviour in a WSN context demand that issues such as unreliable message delivery and limited power resources, amongst others, be considered. In this paper, the practical issues of agent migration and communication are considered in light of WSN constraints. The discussion is illustrated through a description of approaches adopted by Agent Factory Micro Edition (AFME).
{"title":"Agent Migration and Communication in WSNs","authors":"C. Muldoon, Gregory M. P. O'Hare, M. O'Grady, R. Tynan","doi":"10.1109/PDCAT.2008.58","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.58","url":null,"abstract":"Intelligent agents offer a viable paradigm for enabling AmI applications and services. As WSN technologies are anticipated to provide an indispensable component in many application domains, the need for enabling the agent paradigm to encompass such technologies becomes more urgent. The resource-constrained ad-hoc nature of WSNs poses significant challenges to conventional agent frameworks. In particular, the implications for agent functionality and behaviour in a WSN context demand that issues such as unreliable message delivery and limited power resources, amongst others, be considered. In this paper, the practical issues of agent migration and communication are considered in light of WSN constraints. The discussion is illustrated through a description of approaches adopted by Agent Factory Micro Edition (AFME).","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114799748","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}
How to share the data in databases of autonomous organizations quickly and flexibly is an important problem. Traditional data integration systems are supposed to be a solution to the problem. Unfortunately, they require a global schema before they can be used to share data and they are centralized system. They can not support data sharing without a common schema and on-demand data sharing in applications. In addition, security is also the important requirements. This paper presents a community-based system for distributed data integration and sharing, Honeycomb. Honeycomb supports many virtual data integration and sharing systems on a single machine, and the system utilizes Web services to access data on other nodes to avoid changing security configuration of autonomous organizations. In addition, the system adopts new cache techniques to improve performance greatly.
{"title":"Honeycomb: A Community-Based System for Distributed Data Integration and Sharing","authors":"Wenlong Huang, Taoying Liu, Yi Zhao","doi":"10.1109/PDCAT.2008.22","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.22","url":null,"abstract":"How to share the data in databases of autonomous organizations quickly and flexibly is an important problem. Traditional data integration systems are supposed to be a solution to the problem. Unfortunately, they require a global schema before they can be used to share data and they are centralized system. They can not support data sharing without a common schema and on-demand data sharing in applications. In addition, security is also the important requirements. This paper presents a community-based system for distributed data integration and sharing, Honeycomb. Honeycomb supports many virtual data integration and sharing systems on a single machine, and the system utilizes Web services to access data on other nodes to avoid changing security configuration of autonomous organizations. In addition, the system adopts new cache techniques to improve performance greatly.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"282 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124513264","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}
GUIDs are globally unique identifiers that can be generated independently. They play an important role in many distributed systems. However, compared to most local identifiers, they are relatively large (16 bytes). We discuss techniques that can make the use of GUIDs more efficient, so that they become more viable as a ubiquitous solution for large distributed databases and similar applications relying on artificial identifiers. The proposed techniques include canonical GUIDs for primitive values and a compression scheme for timestamp-based GUIDs. The techniques have been implemented and can be used in different programming languages. Furthermore, general aspects and potential problems of GUIDs as defined in the RFC 4122 are discussed.
{"title":"Efficient Use of GUIDs","authors":"C. Lutteroth, Gerald Weber","doi":"10.1109/PDCAT.2008.67","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.67","url":null,"abstract":"GUIDs are globally unique identifiers that can be generated independently. They play an important role in many distributed systems. However, compared to most local identifiers, they are relatively large (16 bytes). We discuss techniques that can make the use of GUIDs more efficient, so that they become more viable as a ubiquitous solution for large distributed databases and similar applications relying on artificial identifiers. The proposed techniques include canonical GUIDs for primitive values and a compression scheme for timestamp-based GUIDs. The techniques have been implemented and can be used in different programming languages. Furthermore, general aspects and potential problems of GUIDs as defined in the RFC 4122 are discussed.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121034854","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}
Wireless sensor networks have been applied to monitor pipeline structural health. In these networks, expensive multi-sinks with energy harvesting modules are deployed along the linear pipeline, and battery powered sensor nodes are deployed between the sinks. One of the main problems in such networks is the unbalance of energy consumption of sensor nodes, which makes the whole monitoring system lose its functionality with only a small percentage of sensor nodes depleted of their energy. In this paper, we propose a distributed sensing data propagation algorithm based on graded residual energy (GRE) of the sensor nodes, in order to achieve balanced energy consumption among sensor nodes. The optimum number of energy grades of GRE has been calculated through theoretical analysis in terms of maximizing network lifetime. The simulation results have shown that GRE can achieve balanced energy consumption between the sensor nodes and at the same time prolong the lifetime of the whole monitoring system.
{"title":"GRE: Graded Residual Energy Based Lifetime Prolonging Algorithm for Pipeline Monitoring Sensor","authors":"Zhongwen Guo, Hanjiang Luo, Feng Hong, Peng Zhou","doi":"10.1109/PDCAT.2008.39","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.39","url":null,"abstract":"Wireless sensor networks have been applied to monitor pipeline structural health. In these networks, expensive multi-sinks with energy harvesting modules are deployed along the linear pipeline, and battery powered sensor nodes are deployed between the sinks. One of the main problems in such networks is the unbalance of energy consumption of sensor nodes, which makes the whole monitoring system lose its functionality with only a small percentage of sensor nodes depleted of their energy. In this paper, we propose a distributed sensing data propagation algorithm based on graded residual energy (GRE) of the sensor nodes, in order to achieve balanced energy consumption among sensor nodes. The optimum number of energy grades of GRE has been calculated through theoretical analysis in terms of maximizing network lifetime. The simulation results have shown that GRE can achieve balanced energy consumption between the sensor nodes and at the same time prolong the lifetime of the whole monitoring system.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115182664","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}
Recently, Argonne National Laboratory installed a half petaflop Blue Gene/P system. It is the world's fastest open science supercomputer. With 163,840 cores, the machine is beginning to provide insight on how we might build future platforms as we scale toward exascale computing. There are many challenges, including the dramatic shift to multicore, the cost of electric power, and the need for robust fault management. In this talk I will focus on the architecture and system software challenges we face as we continue to attack ever-larger computational problems.
{"title":"Looking toward Exascale Computing","authors":"P. Beckman","doi":"10.1109/PDCAT.2008.88","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.88","url":null,"abstract":"Recently, Argonne National Laboratory installed a half petaflop Blue Gene/P system. It is the world's fastest open science supercomputer. With 163,840 cores, the machine is beginning to provide insight on how we might build future platforms as we scale toward exascale computing. There are many challenges, including the dramatic shift to multicore, the cost of electric power, and the need for robust fault management. In this talk I will focus on the architecture and system software challenges we face as we continue to attack ever-larger computational problems.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129456047","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 grid software and grid applications grow in size and complexity, memory usage experiment and analysis have become more and more essential. In this paper, we investigate an antitestcase-based approach to analyze the memory usage of GOS core software, and present a set of anti-testcases, which describe predefined memory problems of GOS core. This approach is applied with a set of automated test tools in controlled experiments including basic memory requirements, memory errors and memory usage of GOS core. With the experiment and analysis, we find several memory usage results of GOS core and they are valuable for other systems based on JVM, Tomcat and Axis. We also give some JVM memory configuration suggestions for better performance in the production server.
{"title":"An Experimental Analysis for Memory Usage of GOS Core","authors":"Xiaoyi Lu, Q. Yue, Yongqiang Zou, Xiaoning Wang","doi":"10.1109/PDCAT.2008.30","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.30","url":null,"abstract":"As grid software and grid applications grow in size and complexity, memory usage experiment and analysis have become more and more essential. In this paper, we investigate an antitestcase-based approach to analyze the memory usage of GOS core software, and present a set of anti-testcases, which describe predefined memory problems of GOS core. This approach is applied with a set of automated test tools in controlled experiments including basic memory requirements, memory errors and memory usage of GOS core. With the experiment and analysis, we find several memory usage results of GOS core and they are valuable for other systems based on JVM, Tomcat and Axis. We also give some JVM memory configuration suggestions for better performance in the production server.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125917042","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}
Current cache replacement policies mostly work at the block device level. Block level policies try to achieve better hit ratio by balancing the frequently and recently visited pages, however, further improvements can be realized by using file-system metadata. There are two reasons for this. First, sequential access of disk data is more quickly than non-sequential access, that is to say, the cache penalty of sequential blocks miss can be significantly lower than that of random blocks miss. Second, in most storage systems, files are stored and accessed sequentially. We notice this and propose a novel cache management policy, called bargain cache, which prefers to drop sequential pages by using the file-system metadata, so that hard disks could work under sequential access mode as much as possible. Simulation results show that our technique can efficiently reduce the cache miss penalty, thus improve the overall caching performance.
{"title":"Bargain Cache: Using File-System Metadata to Reduce the Cache Miss Penalty","authors":"Yingjie Zhao, Nong Xiao","doi":"10.1109/PDCAT.2008.33","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.33","url":null,"abstract":"Current cache replacement policies mostly work at the block device level. Block level policies try to achieve better hit ratio by balancing the frequently and recently visited pages, however, further improvements can be realized by using file-system metadata. There are two reasons for this. First, sequential access of disk data is more quickly than non-sequential access, that is to say, the cache penalty of sequential blocks miss can be significantly lower than that of random blocks miss. Second, in most storage systems, files are stored and accessed sequentially. We notice this and propose a novel cache management policy, called bargain cache, which prefers to drop sequential pages by using the file-system metadata, so that hard disks could work under sequential access mode as much as possible. Simulation results show that our technique can efficiently reduce the cache miss penalty, thus improve the overall caching performance.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121937180","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
扫码关注我们
求助内容：
应助结果提醒方式：