Ageing societies raise new social and economic challenges which are expected to be partially solved by the use of advanced technology. Ambient home care systems (AHCS) aims at alleviating both elderly and caregivers daily tasks, thanks to their control of environmental, health and physical sensors and their capability of reasoning on the acquired information. In this paper, we design and develop a prototype of an AHCS using and adapting an open software framework, the context toolkit (CTK). The CTK here is customized to handle our proper acquisition platform. On our work, we infer some conclusions about design practices and context management for AHCS.
{"title":"Developing an Ambient Home Care System: Context Toolkit-Based Design and Implementation","authors":"A. Hristova, A. Bernardos, J. Casar","doi":"10.1109/PDCAT.2008.49","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.49","url":null,"abstract":"Ageing societies raise new social and economic challenges which are expected to be partially solved by the use of advanced technology. Ambient home care systems (AHCS) aims at alleviating both elderly and caregivers daily tasks, thanks to their control of environmental, health and physical sensors and their capability of reasoning on the acquired information. In this paper, we design and develop a prototype of an AHCS using and adapting an open software framework, the context toolkit (CTK). The CTK here is customized to handle our proper acquisition platform. On our work, we infer some conclusions about design practices and context management for AHCS.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"5 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":"123044547","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 paper, we present the idea that large-scale ambient intelligence takes the vision of anytime-anywhere to anytime-anywhere-anything (A3). Based on this vision, we argue that a mix of computing, communication and interface technologies remains limited in providing seamless access to services if the data and services from various autonomously operating entities remain non-sharable. Thus, we propose a sensor grid infrastructure that forms the key resource sharing backbone and provides secure access to valuable sensor, computational, data, and storage resources for supporting large-scale ambient intelligence.
{"title":"A Sensor Grid Infrastructure for Large-Scale Ambient Intelligence","authors":"M. Iqbal, H. Lim, Wenqiang Wang, Yuxia Yao","doi":"10.1109/PDCAT.2008.79","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.79","url":null,"abstract":"In this paper, we present the idea that large-scale ambient intelligence takes the vision of anytime-anywhere to anytime-anywhere-anything (A3). Based on this vision, we argue that a mix of computing, communication and interface technologies remains limited in providing seamless access to services if the data and services from various autonomously operating entities remain non-sharable. Thus, we propose a sensor grid infrastructure that forms the key resource sharing backbone and provides secure access to valuable sensor, computational, data, and storage resources for supporting large-scale ambient intelligence.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"24 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":"124577419","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}
With the dominance of multicore processors, parallel programming has become more important. Transactional Memory is a promising solution to synchronisation issues that are hurting parallel programmers. While there are a lot of researches on the implementation tradeoffs of TM, there is rare study on the applications that may utilize the techniques, which is essential to both providing feedbacks to the TM designers and to helping potential users. This paper makes the first step of this work by presenting our identification of emerging applications for the comprehensive study of TM. The selection is based on application-domains including popular server/client softwares, multimedia applications, bioinformatics applications, data mining applications, and other scientific applications, which cover most of the dwarfs. A preliminary experiment is also provided to illustrate what we can get from this work.
{"title":"Exploring the Emerging Applications for Transactional Memory","authors":"Jiaqi Zhang, Wenguang Chen, Xinmin Tian, Weimin Zheng","doi":"10.1109/PDCAT.2008.77","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.77","url":null,"abstract":"With the dominance of multicore processors, parallel programming has become more important. Transactional Memory is a promising solution to synchronisation issues that are hurting parallel programmers. While there are a lot of researches on the implementation tradeoffs of TM, there is rare study on the applications that may utilize the techniques, which is essential to both providing feedbacks to the TM designers and to helping potential users. This paper makes the first step of this work by presenting our identification of emerging applications for the comprehensive study of TM. The selection is based on application-domains including popular server/client softwares, multimedia applications, bioinformatics applications, data mining applications, and other scientific applications, which cover most of the dwarfs. A preliminary experiment is also provided to illustrate what we can get from this work.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"46 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":"123689325","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 wireless sensor networks, location estimation of sensor nodes is important. Therefore some location estimation methods have been proposed. Especially, in wireless sensor networks based on IEEE802.15.4, a method using received signal strength indicator (RSSI) which can be measured by each sensor node is one of the most practicable methods in the way that new hardware is not needed and it is suitable also for the miniaturization. However this technique has a weak point that it needs to investigate the propagation environment of the sensor field to estimate the location of sensor nodes in advance. This paper proposes the method that the decision of the parameter of the propagation environment using only measurements obtained during localization without investigating prior. Evaluation of this method is shown by simulation and experiment that it is able to decide the propagation parameter of an extent that doesnpsilat influence the location estimation accuracy without investigating the propagation environment of the sensor field.
{"title":"Decision Experiment of Attenuation Constant During Location Estimation in RSSI","authors":"K. Tateishi, T. Ikegami","doi":"10.1109/PDCAT.2008.65","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.65","url":null,"abstract":"In wireless sensor networks, location estimation of sensor nodes is important. Therefore some location estimation methods have been proposed. Especially, in wireless sensor networks based on IEEE802.15.4, a method using received signal strength indicator (RSSI) which can be measured by each sensor node is one of the most practicable methods in the way that new hardware is not needed and it is suitable also for the miniaturization. However this technique has a weak point that it needs to investigate the propagation environment of the sensor field to estimate the location of sensor nodes in advance. This paper proposes the method that the decision of the parameter of the propagation environment using only measurements obtained during localization without investigating prior. Evaluation of this method is shown by simulation and experiment that it is able to decide the propagation parameter of an extent that doesnpsilat influence the location estimation accuracy without investigating the propagation environment of the sensor field.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"104 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":"124074966","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}
Parallel computers essentially employ interconnection networks. Huge-scale systems require appropriate networks that can correspond to their required performance. This paper addresses a scalability issue of uniform interconnection networks. We first propose an evaluation method suitable to large-scale networks, define critical load ratio as a common measure, and introduce introduce ramp-, step-, and impulse responses. Our evaluation results reveal some new knowledge on large-scale networks: (1) performance is scalable from macro-scopic viewpoint, (2) large-scale network is sensitive to congestion and sometimes complex behaviors emerge.
{"title":"Are Uniform Nerworks Scalable?","authors":"T. Yokota, K. Ootsu, T. Baba","doi":"10.1109/PDCAT.2008.40","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.40","url":null,"abstract":"Parallel computers essentially employ interconnection networks. Huge-scale systems require appropriate networks that can correspond to their required performance. This paper addresses a scalability issue of uniform interconnection networks. We first propose an evaluation method suitable to large-scale networks, define critical load ratio as a common measure, and introduce introduce ramp-, step-, and impulse responses. Our evaluation results reveal some new knowledge on large-scale networks: (1) performance is scalable from macro-scopic viewpoint, (2) large-scale network is sensitive to congestion and sometimes complex behaviors emerge.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"12 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":"126462396","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}
The EU-funded XtreemOS project implements a grid operating system transparently exploiting resources of virtual organizations through the standard POSIX interface. Grid checkpointing and restart requires to save and restore jobs executing in a distributed heterogeneous grid environment. The latter may spawn millions of grid nodes ( PCs, clusters, and mobile devices ) using different system-specific checkpointers saving and restoring application and kernel data structures for processes executing on a grid node. In this paper we shortly describe the XtreemOS grid checkpointing architecture and how we bridge the gap between the abstract grid and the system-specific checkpointers. Then we discuss how we keep track of processes and how different process grouping techniques are managed to ensure that all processes of a job and any further dependent ones can be checkpointed and restarted. Finally, we present how Linux control groups can be used to address resource isolation issues during the restart.
{"title":"Checkpointing Process Groups in a Grid Environment","authors":"John Mehnert-Spahn, M. Schöttner, C. Morin","doi":"10.1109/PDCAT.2008.14","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.14","url":null,"abstract":"The EU-funded XtreemOS project implements a grid operating system transparently exploiting resources of virtual organizations through the standard POSIX interface. Grid checkpointing and restart requires to save and restore jobs executing in a distributed heterogeneous grid environment. The latter may spawn millions of grid nodes ( PCs, clusters, and mobile devices ) using different system-specific checkpointers saving and restoring application and kernel data structures for processes executing on a grid node. In this paper we shortly describe the XtreemOS grid checkpointing architecture and how we bridge the gap between the abstract grid and the system-specific checkpointers. Then we discuss how we keep track of processes and how different process grouping techniques are managed to ensure that all processes of a job and any further dependent ones can be checkpointed and restarted. Finally, we present how Linux control groups can be used to address resource isolation issues during the restart.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"78 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":"116041235","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}
Connected component labeling is a task that assigns unique IDs to the connected components of a binary image. The main contribution of this paper is to present a hardware connected component labeling algorithm for k-concave binary images designed and implemented in FPGA. Pixels of a binary image are given to the FPGA in raster order, and the resulting labels are also output in the same order. The advantage of our labeling algorithm is low latency and to use FPGA effectively. We have implemented our hardware labeling algorithm in an Altera Stratix Family FPGA, and evaluated the performance. The implementation result shows that for a 20-concave binary image of 2048 times 2048, our connected component labeling algorithm runs in approximately 72 ms and its latency is approximately 2.9 ms.
{"title":"Optimized Component Labeling Algorithm for Using in Medium Sized FPGAs","authors":"Yasuaki Ito, K. Nakano","doi":"10.1109/PDCAT.2008.55","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.55","url":null,"abstract":"Connected component labeling is a task that assigns unique IDs to the connected components of a binary image. The main contribution of this paper is to present a hardware connected component labeling algorithm for k-concave binary images designed and implemented in FPGA. Pixels of a binary image are given to the FPGA in raster order, and the resulting labels are also output in the same order. The advantage of our labeling algorithm is low latency and to use FPGA effectively. We have implemented our hardware labeling algorithm in an Altera Stratix Family FPGA, and evaluated the performance. The implementation result shows that for a 20-concave binary image of 2048 times 2048, our connected component labeling algorithm runs in approximately 72 ms and its latency is approximately 2.9 ms.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"35 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":"127454744","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 recent years, wireless sensor networks have received great interest with rapid developments in both hardware and software aspects. However, there is always a problem with limited energy supply for the tiny sensor node. In wireless imaging sensor network in which imaging devices are utilized, the bottleneck of energy consumption efficiency is even more serious. The main activities of such imaging networks are related to image data transmission over wireless channel. Therefore it is necessary to seek a good balance between the image quality and energy conservation. We propose an energy-efficient control scheme based on recent dynamic range coding techniques. The simulation results are presented with emphasis on prolonging the sensor network lifetime.
{"title":"Energy-Efficient Resource Management in Distributed Wireless Imaging Sensor Networks","authors":"C. Fu, Bang Wang, H. Lim","doi":"10.1109/PDCAT.2008.81","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.81","url":null,"abstract":"In recent years, wireless sensor networks have received great interest with rapid developments in both hardware and software aspects. However, there is always a problem with limited energy supply for the tiny sensor node. In wireless imaging sensor network in which imaging devices are utilized, the bottleneck of energy consumption efficiency is even more serious. The main activities of such imaging networks are related to image data transmission over wireless channel. Therefore it is necessary to seek a good balance between the image quality and energy conservation. We propose an energy-efficient control scheme based on recent dynamic range coding techniques. The simulation results are presented with emphasis on prolonging the sensor network lifetime.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"124 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":"132669972","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}
Considerable power is consumed by unused computers. Studies show many of these computers have their power management features disabled in order to maintain their network presence and network connections. Past research proposes to use a low power proxy to 'stand in' for a computer, allowing it to go to sleep and thus save power while still maintaining its network presence. This paper describes a method to proxy for sleeping Jabber clients. By using a low cost power proxy, Jabber clients can maintain their presence in instant message and chat sessions while sleeping when the user is away from the computer. It keeps a record of session activity for the sleeping client and forwards the record of activity to the client when it wakes up.
{"title":"A Low-Power Proxy to Allow Unattended Jabber Clients to Sleep","authors":"P. Werstein, Wannes Vossen","doi":"10.1109/PDCAT.2008.18","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.18","url":null,"abstract":"Considerable power is consumed by unused computers. Studies show many of these computers have their power management features disabled in order to maintain their network presence and network connections. Past research proposes to use a low power proxy to 'stand in' for a computer, allowing it to go to sleep and thus save power while still maintaining its network presence. This paper describes a method to proxy for sleeping Jabber clients. By using a low cost power proxy, Jabber clients can maintain their presence in instant message and chat sessions while sleeping when the user is away from the computer. It keeps a record of session activity for the sleeping client and forwards the record of activity to the client when it wakes up.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"186 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":"133212780","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 the design and evaluation of the stream processing implementation of the integral image algorithm. The integral image is a key component of many image processing algorithms in particular the Haar-like feature based systems. Modern GPUs provide a large number of processors with a peak floating point performance that is significantly higher than current general CPUs. This results in significant performance improvement when the Integral Image calculation for large input images is offloaded onto the GPU of the system.
{"title":"Stream Processing of Integral Images for Real-Time Object Detection","authors":"C. Messom, A. Barczak","doi":"10.1109/PDCAT.2008.46","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.46","url":null,"abstract":"This paper presents the design and evaluation of the stream processing implementation of the integral image algorithm. The integral image is a key component of many image processing algorithms in particular the Haar-like feature based systems. Modern GPUs provide a large number of processors with a peak floating point performance that is significantly higher than current general CPUs. This results in significant performance improvement when the Integral Image calculation for large input images is offloaded onto the GPU of the system.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 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":"133029004","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
扫码关注我们
求助内容：
应助结果提醒方式：