B. Li, Jianxin Li, Tianyu Wo, Chunming Hu, Liang Zhong
System call interposition is a powerful method for regulating and monitoring program behavior. A wide variety of security tools have been developed which use this technique. However, traditional system call interposition techniques are vulnerable to kernel attacks and have some limitations on effectiveness and transparency. In this paper, we propose a novel approach named VSyscall, which leverages virtualization technology to enable system call interposition outside the operating system. A system call correlating method is proposed to identify the coherent system calls belonging to the same process from the system call sequence. We have developed a prototype of VSyscall and implemented it in two mainstream virtual machine monitors, Qemu and KVM, respectively. We also evaluate the effectiveness and performance overhead of our approach by comprehensive experiments. The results show that VSyscall achieves effectiveness with a small overhead, and our experiments with six real-world applications indicate its practicality.
{"title":"A VMM-Based System Call Interposition Framework for Program Monitoring","authors":"B. Li, Jianxin Li, Tianyu Wo, Chunming Hu, Liang Zhong","doi":"10.1109/ICPADS.2010.53","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.53","url":null,"abstract":"System call interposition is a powerful method for regulating and monitoring program behavior. A wide variety of security tools have been developed which use this technique. However, traditional system call interposition techniques are vulnerable to kernel attacks and have some limitations on effectiveness and transparency. In this paper, we propose a novel approach named VSyscall, which leverages virtualization technology to enable system call interposition outside the operating system. A system call correlating method is proposed to identify the coherent system calls belonging to the same process from the system call sequence. We have developed a prototype of VSyscall and implemented it in two mainstream virtual machine monitors, Qemu and KVM, respectively. We also evaluate the effectiveness and performance overhead of our approach by comprehensive experiments. The results show that VSyscall achieves effectiveness with a small overhead, and our experiments with six real-world applications indicate its practicality.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127301468","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}
Xiaoming Tang, Panlong Yang, Chang Tian, Laixian Peng, Yubo Yan
The main challenge in DTNs is how to deal with path uncertainty in achieving a reliable routing scheme. All Erasure coding based routing algorithms make the assumption that the underlying path probabilities are known previously and remain constant, which is unpractical. On the other hand, the overall behavior of path probability tends to be stable with the increasing number of paths, which can be used to increase the stability of Erasure coding based schemes. Bearing this in mind, we present Inter-Coding: Inter-Coding is designed to fully combine the reliability of erasure coding, and the stability of interleaving to cope with uncertainties. We evaluate our approach in terms of delivery ratio under different level of uncertainty as well as different interleaving policy, and validate that Inter-Coding offers reliable and stable performance even the path uncertainty and dynamic is high.
{"title":"Inter-Coding: An Interleaving and Erasure Coding Based Stable Routing Scheme in Multi-path DTN","authors":"Xiaoming Tang, Panlong Yang, Chang Tian, Laixian Peng, Yubo Yan","doi":"10.1109/ICPADS.2010.22","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.22","url":null,"abstract":"The main challenge in DTNs is how to deal with path uncertainty in achieving a reliable routing scheme. All Erasure coding based routing algorithms make the assumption that the underlying path probabilities are known previously and remain constant, which is unpractical. On the other hand, the overall behavior of path probability tends to be stable with the increasing number of paths, which can be used to increase the stability of Erasure coding based schemes. Bearing this in mind, we present Inter-Coding: Inter-Coding is designed to fully combine the reliability of erasure coding, and the stability of interleaving to cope with uncertainties. We evaluate our approach in terms of delivery ratio under different level of uncertainty as well as different interleaving policy, and validate that Inter-Coding offers reliable and stable performance even the path uncertainty and dynamic is high.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130356083","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}
Providing secure and efficient outsourced storage is a precursor to widespread cloud deployment and availability. For this purpose, existing designs mainly rely on block ciphers, although stream ciphers are more computationally-efficient than block ciphers. This paper presents a construction of secure storage, BLAST, enhanced with a stream cipher rather than a block cipher with a novel block accessible encryption mechanism based on streaming ciphers. In BLAST, a hierarchical tree generated in the form of an n-level quad tree is created for each user during the registration phase of the storage system. When a user wants to access the outsourced storage, the user can access their data after encrypting or decrypting it using a sequence of key stream frames derived from the hierarchical tree. The experimental results show that the proposed system achieves significant improved performance than normal streaming/block cipher-based secure storage system in terms of throughput and access latency.
{"title":"BLAST: Applying Streaming Ciphers Into Outsourced Cloud Storage","authors":"Ki-Woong Park, Chulmin Kim, K. Park","doi":"10.1109/ICPADS.2010.9","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.9","url":null,"abstract":"Providing secure and efficient outsourced storage is a precursor to widespread cloud deployment and availability. For this purpose, existing designs mainly rely on block ciphers, although stream ciphers are more computationally-efficient than block ciphers. This paper presents a construction of secure storage, BLAST, enhanced with a stream cipher rather than a block cipher with a novel block accessible encryption mechanism based on streaming ciphers. In BLAST, a hierarchical tree generated in the form of an n-level quad tree is created for each user during the registration phase of the storage system. When a user wants to access the outsourced storage, the user can access their data after encrypting or decrypting it using a sequence of key stream frames derived from the hierarchical tree. The experimental results show that the proposed system achieves significant improved performance than normal streaming/block cipher-based secure storage system in terms of throughput and access latency.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128322722","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}
Unstructured peer-to-peer (P2P) file-sharing networks are popular in the mass market. As the peers participating in unstructured networks interconnect randomly, they rely on flooding query messages to discover objects of interest. Empirical measurement studies indicate that the peers in P2P networks have similar preferences, and recently proposed unstructured P2P networks intend to organize the participating peers in a small-world (SW) fashion by exploiting the knowledge of contents stored in peers. As existing algorithms for constructing SW-based unstructured P2P networks may not precisely reveal the object sharing patterns, the resultant networks thus may not perform searches efficiently and effectively by exploiting the common interests among peers. In this paper, we suggest a novel P2P network formation algorithm to construct SW-based unstructured networks. We validate our proposal in simulations with an empirical data set, and the simulation results prove that our proposal greatly outperforms existing algorithms in terms of search efficiency and effectiveness.
{"title":"Small-World Social Relationship Awareness in Unstructured Peer-to-Peer Networks","authors":"Hao Liao, Kuo-Chan Huang, Hung-Chang Hsiao","doi":"10.1109/ICPADS.2010.37","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.37","url":null,"abstract":"Unstructured peer-to-peer (P2P) file-sharing networks are popular in the mass market. As the peers participating in unstructured networks interconnect randomly, they rely on flooding query messages to discover objects of interest. Empirical measurement studies indicate that the peers in P2P networks have similar preferences, and recently proposed unstructured P2P networks intend to organize the participating peers in a small-world (SW) fashion by exploiting the knowledge of contents stored in peers. As existing algorithms for constructing SW-based unstructured P2P networks may not precisely reveal the object sharing patterns, the resultant networks thus may not perform searches efficiently and effectively by exploiting the common interests among peers. In this paper, we suggest a novel P2P network formation algorithm to construct SW-based unstructured networks. We validate our proposal in simulations with an empirical data set, and the simulation results prove that our proposal greatly outperforms existing algorithms in terms of search efficiency and effectiveness.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133481415","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}
For some sensor network applications, the problem of sweep coverage, which periodically covers POIs (Points of Interest) to sense events, is of importance. How to schedule minimum number of mobile sensors to achieve the sweep coverage within specified sweep period is a challenging problem, especially when the POIs to be scanned exceeds certain scale and the speed of mobile sensor is limited. Therefore, multiple mobile sensors are required to collaboratively complete the scanning task. When the mobile sensor is restricted to follow the same trajectory in different sweep periods, we design a centralized algorithm, MinExpand, to schedule the scan path. When the scan path of the existing mobile sensors has been exceeds the length constraint, MinExpand gradually deploys more mobile sensors and eventually achieves sweep coverage to all POIs. When the mobile sensors are not restricted to follow the same trajectory in different sweep periods, we design OSweep algorithm, where all the mobile sensors are scheduled to move along a TSP (Traveling Salesman Problem) ring consists of POIs. We conduct comprehensive simulations to study the performance of the proposed algorithms. The simulation results show that MinExpand and OSweep outperform CSWEEP in both effectiveness and efficiency.
{"title":"On Sweep Coverage with Minimum Mobile Sensors","authors":"Junzhao Du, Yawei Li, Hui Liu, Kewei Sha","doi":"10.1109/ICPADS.2010.109","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.109","url":null,"abstract":"For some sensor network applications, the problem of sweep coverage, which periodically covers POIs (Points of Interest) to sense events, is of importance. How to schedule minimum number of mobile sensors to achieve the sweep coverage within specified sweep period is a challenging problem, especially when the POIs to be scanned exceeds certain scale and the speed of mobile sensor is limited. Therefore, multiple mobile sensors are required to collaboratively complete the scanning task. When the mobile sensor is restricted to follow the same trajectory in different sweep periods, we design a centralized algorithm, MinExpand, to schedule the scan path. When the scan path of the existing mobile sensors has been exceeds the length constraint, MinExpand gradually deploys more mobile sensors and eventually achieves sweep coverage to all POIs. When the mobile sensors are not restricted to follow the same trajectory in different sweep periods, we design OSweep algorithm, where all the mobile sensors are scheduled to move along a TSP (Traveling Salesman Problem) ring consists of POIs. We conduct comprehensive simulations to study the performance of the proposed algorithms. The simulation results show that MinExpand and OSweep outperform CSWEEP in both effectiveness and efficiency.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122415314","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}
Yan Cui, Weiyi Wu, Yingxin Wang, Xufeng Guo, Yu Chen, Yuanchun Shi
Multi-core architectures have become mainstream. Trends suggest that the number of cores integrated on a single chip will increase continuously. However, lock contention in operating systems can limit the parallel scalability on multi-cores so significantly that the speedup decreases with the increasing number of cores (thrashing). Although the phenomenon can be easily reproduced experimentally, most existing lock models are not able to do so. To overcome this challenge, this paper develops a discrete event simulation model which has the capability of capturing both the sequential execution in critical sections and the contention for shared hardware resources. The model is evaluated using a series of typical parameter configurations which can represent different degrees of lock contention. Experimental results suggest that the thrashing phenomenon can be observed when the model parameters are selected properly. To further understand this phenomenon, statistics such as the percentage of time spent waiting for locks and the number of cores waiting for a lock are exploited to characterize the lock thrashing. In addition, the model sensitivity to changes in memory latency and hardware architectures are also examined. Finally, we use this model to compare three methods which are proposed for preventing the lock thrashing.
{"title":"A Discrete Event Simulation Model for Understanding Kernel Lock Thrashing on Multi-core Architectures","authors":"Yan Cui, Weiyi Wu, Yingxin Wang, Xufeng Guo, Yu Chen, Yuanchun Shi","doi":"10.1109/ICPADS.2010.28","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.28","url":null,"abstract":"Multi-core architectures have become mainstream. Trends suggest that the number of cores integrated on a single chip will increase continuously. However, lock contention in operating systems can limit the parallel scalability on multi-cores so significantly that the speedup decreases with the increasing number of cores (thrashing). Although the phenomenon can be easily reproduced experimentally, most existing lock models are not able to do so. To overcome this challenge, this paper develops a discrete event simulation model which has the capability of capturing both the sequential execution in critical sections and the contention for shared hardware resources. The model is evaluated using a series of typical parameter configurations which can represent different degrees of lock contention. Experimental results suggest that the thrashing phenomenon can be observed when the model parameters are selected properly. To further understand this phenomenon, statistics such as the percentage of time spent waiting for locks and the number of cores waiting for a lock are exploited to characterize the lock thrashing. In addition, the model sensitivity to changes in memory latency and hardware architectures are also examined. Finally, we use this model to compare three methods which are proposed for preventing the lock thrashing.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124559704","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}
Deploying multimedia streaming over IP Multimedia Subsystem (IMS) can enable all kinds of user equipments to enjoy unified streaming service, without considering the differences of heterogeneous accessing methods. The combination of IMS and peer-to-peer (P2P) may help operators (especially telecommunication operators) to provide more scalable multimedia streaming. In this paper, we propose PMSAI, a novel P2P multimedia streaming architecture over IMS, in order to expand the capability of IMS multimedia streaming and reduce server side resource consumption, while restricting P2P traffic within local areas and trying best to keep standard IMS unchanged. To study how PMSAI performs, we also build a experimental system of live multimedia streaming. Carefully measurement study demonstrates the feasibility and effectiveness of PMSAI. To the best of our knowledge, PMSAI is the first P2P multimedia streaming architecture over IMS.
{"title":"PMSAI: A Novel Peer-to-Peer Multimedia Streaming Architecture over IMS","authors":"Ran Liu, H. Yin, Wen Hui","doi":"10.1109/ICPADS.2010.54","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.54","url":null,"abstract":"Deploying multimedia streaming over IP Multimedia Subsystem (IMS) can enable all kinds of user equipments to enjoy unified streaming service, without considering the differences of heterogeneous accessing methods. The combination of IMS and peer-to-peer (P2P) may help operators (especially telecommunication operators) to provide more scalable multimedia streaming. In this paper, we propose PMSAI, a novel P2P multimedia streaming architecture over IMS, in order to expand the capability of IMS multimedia streaming and reduce server side resource consumption, while restricting P2P traffic within local areas and trying best to keep standard IMS unchanged. To study how PMSAI performs, we also build a experimental system of live multimedia streaming. Carefully measurement study demonstrates the feasibility and effectiveness of PMSAI. To the best of our knowledge, PMSAI is the first P2P multimedia streaming architecture over IMS.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127676919","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}
It is being envisaged that a wide variety of applications can be running on vehicular ad hoc networks (VANETs) in the near future. The coexistence of these applications suggests that they will be competing for the use of the wireless medium. That easily leads to severe congestion and even “hotspot” problem in high traffic density urban areas, and results in the failure of time-critical applications. To address this issue, we propose two carry-and-forward schemes called LARD-Greedy and LARD-Optimal respectively that attempt to deliver packets along the path with optimal performance. The proposed algorithms leverage local or global knowledge of traffic statistics to choose the path with optimal performance, and rationally alternate between the Carrying and Multihop Forwarding strategies according to the current load status in order to avoid congestion. Experimental results based on a real city map show the proposed solutions reach very good performance in terms of packet delivery ratio and delay.
{"title":"Load Aware Routing with Delay Threshold for Vehicular Ad Hoc Networks","authors":"Yong Feng, Mingyu Fan, Qiwei Xiao, Lishu Wang","doi":"10.1109/ICPADS.2010.74","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.74","url":null,"abstract":"It is being envisaged that a wide variety of applications can be running on vehicular ad hoc networks (VANETs) in the near future. The coexistence of these applications suggests that they will be competing for the use of the wireless medium. That easily leads to severe congestion and even “hotspot” problem in high traffic density urban areas, and results in the failure of time-critical applications. To address this issue, we propose two carry-and-forward schemes called LARD-Greedy and LARD-Optimal respectively that attempt to deliver packets along the path with optimal performance. The proposed algorithms leverage local or global knowledge of traffic statistics to choose the path with optimal performance, and rationally alternate between the Carrying and Multihop Forwarding strategies according to the current load status in order to avoid congestion. Experimental results based on a real city map show the proposed solutions reach very good performance in terms of packet delivery ratio and delay.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115465581","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 topologies of Internet and Internet-based information systems have complex network properties. Designing Internet-based virtual computing environment topology with appropriate properties is significant for both the resource sharing and system performance. We analyses the topology properties of the typical P2P systems, and proposes a new topology generating method, which includes three phases, birth, growth and maturity, and supports multi-node concurrent joining in. The iVCE topology generation method can produce stable structure, with load balancing capability. Analysis of the generated topologies shows that the degree of their super-node obeys normal distribution law, the average path length between nodes shows small-world properties.
{"title":"A Complex Network Based Virtual Computing Environment Topology Generating Method","authors":"Xiaoheng Deng, Yi Liu, Fu-Yao Zhao, Zhigang Chen","doi":"10.1109/ICPADS.2010.69","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.69","url":null,"abstract":"The topologies of Internet and Internet-based information systems have complex network properties. Designing Internet-based virtual computing environment topology with appropriate properties is significant for both the resource sharing and system performance. We analyses the topology properties of the typical P2P systems, and proposes a new topology generating method, which includes three phases, birth, growth and maturity, and supports multi-node concurrent joining in. The iVCE topology generation method can produce stable structure, with load balancing capability. Analysis of the generated topologies shows that the degree of their super-node obeys normal distribution law, the average path length between nodes shows small-world properties.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114888357","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}
It has been widely known that various benefits can be achieved by reducing energy consumption for high end computing. This paper aims to develop power aware scheduling heuristics for parallel tasks in a cluster with the DVFS technique. In this paper, formal models are presented for precedenceconstrained parallel tasks, DVFS enabled clusters, and energy consumption. This paper studies the slack time for non-critical jobs, extends their execution time and reduces the energy consumption without increasing the task’s execution time as a whole. This paper develops a power aware task clustering algorithm for parallel task scheduling Simulation results justify the design and implementation of proposed energy aware scheduling heuristics in the paper.
{"title":"Power Aware Scheduling for Parallel Tasks via Task Clustering","authors":"Lizhe Wang, J. Tao, G. Laszewski, Dan Chen","doi":"10.1109/ICPADS.2010.128","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.128","url":null,"abstract":"It has been widely known that various benefits can be achieved by reducing energy consumption for high end computing. This paper aims to develop power aware scheduling heuristics for parallel tasks in a cluster with the DVFS technique. In this paper, formal models are presented for precedenceconstrained parallel tasks, DVFS enabled clusters, and energy consumption. This paper studies the slack time for non-critical jobs, extends their execution time and reduces the energy consumption without increasing the task’s execution time as a whole. This paper develops a power aware task clustering algorithm for parallel task scheduling Simulation results justify the design and implementation of proposed energy aware scheduling heuristics in the paper.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126169693","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
扫码关注我们
求助内容：
应助结果提醒方式：