Pub Date : 2014-10-01DOI: 10.1109/ComComAp.2014.7017213
Weihong Zhang, Yong Chen
Vertical search is an important topic in the design of search engines as it offers more abundant and more precise results on specific domain compared with large-scale search engines, like Google and Baidu. Prior to this paper, most vertical search engines were built using manually selected and edited materials, which was time and money consuming. In this paper, we propose a new information resource discovery model and build a crawler in the vertical search engine, which can selectively fetch webpages relevant to a pre-defined topic. The model includes three aspects. First, webpages are transformed into term vectors. TF-TUF , short for Term Frequency-Topic Unbalanced Factor , is proposed as the weighting schema in vector space model. In the schema,we put more weight on terms whose frequencies differ a lot among topics, which will contribute more in the topic prediction we believe. Second, we use Bayes method to predict the topics of the webpages, where topic labeled text is used for training in advance. The specific method about using Bayes to predict the topic is illustrated in the algorithm section. Third, we create a focused crawler using the topic prediction result. The prediction result is used not only to filter the irrelevant webpages but also to direct the crawler to the areas, which are most possible to be topic relevant. The whole three aspects work together to reach the goal of discovering the topic relevant materials on the web efficiently, in building a vertical search engine. Our experiment shows that the average prediction accuracy of our proposed model can reach more than 85%. For application, we also used the proposed model to build "Search Engine for S&T" (http://nstr.com.cn/search), a vertical search engine in science field.
{"title":"Bayes topic prediction model for focused crawling of vertical search engine","authors":"Weihong Zhang, Yong Chen","doi":"10.1109/ComComAp.2014.7017213","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017213","url":null,"abstract":"Vertical search is an important topic in the design of search engines as it offers more abundant and more precise results on specific domain compared with large-scale search engines, like Google and Baidu. Prior to this paper, most vertical search engines were built using manually selected and edited materials, which was time and money consuming. In this paper, we propose a new information resource discovery model and build a crawler in the vertical search engine, which can selectively fetch webpages relevant to a pre-defined topic. The model includes three aspects. First, webpages are transformed into term vectors. TF-TUF , short for Term Frequency-Topic Unbalanced Factor , is proposed as the weighting schema in vector space model. In the schema,we put more weight on terms whose frequencies differ a lot among topics, which will contribute more in the topic prediction we believe. Second, we use Bayes method to predict the topics of the webpages, where topic labeled text is used for training in advance. The specific method about using Bayes to predict the topic is illustrated in the algorithm section. Third, we create a focused crawler using the topic prediction result. The prediction result is used not only to filter the irrelevant webpages but also to direct the crawler to the areas, which are most possible to be topic relevant. The whole three aspects work together to reach the goal of discovering the topic relevant materials on the web efficiently, in building a vertical search engine. Our experiment shows that the average prediction accuracy of our proposed model can reach more than 85%. For application, we also used the proposed model to build \"Search Engine for S&T\" (http://nstr.com.cn/search), a vertical search engine in science field.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124610747","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}
PAA is an important algorithm in time series dimensionality reduction. However, how to determine the sliding window keeps an open issue for PAA and its derivatives. In this paper, a new optimization method to decide the PAA window is proposed based on root mean square distance measure. A rate of information loss is proposed to overcome the scalability issue, which can be used to balance information loss and query performance improvement caused by PAA transformation. Experiment results with a real time series dataset demonstrate that the method is effective and feasible to determine the PAA window size and optimize the whole performance of PAA algorithm.
{"title":"An efficient and accurate optimization method of sliding window size for PAA","authors":"Jinyang Liu, Chuanlei Zhang, Shanwen Zhang, Weidong Fang","doi":"10.1109/ComComAp.2014.7017211","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017211","url":null,"abstract":"PAA is an important algorithm in time series dimensionality reduction. However, how to determine the sliding window keeps an open issue for PAA and its derivatives. In this paper, a new optimization method to decide the PAA window is proposed based on root mean square distance measure. A rate of information loss is proposed to overcome the scalability issue, which can be used to balance information loss and query performance improvement caused by PAA transformation. Experiment results with a real time series dataset demonstrate that the method is effective and feasible to determine the PAA window size and optimize the whole performance of PAA algorithm.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116510320","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 : 2014-10-01DOI: 10.1109/ComComAp.2014.7017171
Jianzhong Qi, Feixiang Luo, Qingping Song
To overcome the influence of Doppler shifts for the acquisition time of navigation receiver in high dynamic situation, a improved method adopts an acquisition algorithm composed of Partial Matched Filter (PMF) and Fast Fourier Transform (FFT) method. The algorithm changes the traditional two-dimensional searching strategy based on spread spectrum code phase and signal-carrier frequency into one-dimensional searching strategy based on spread spectrum code phase. Moreover, PMF not only consumes many hardware resources but also fails to acquire long period Pseudo-Noise (PN) code. Considering of these drawbacks, an improved algorithm is proposed by using folded matched filter and accelerating the operation speed. The results of test show that folded PMF saves hardware resources and achieves double parallel fast acquisition of carrier and PN code.
{"title":"Fast acquisition method of navigation receiver based on folded PMF-FFT","authors":"Jianzhong Qi, Feixiang Luo, Qingping Song","doi":"10.1109/ComComAp.2014.7017171","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017171","url":null,"abstract":"To overcome the influence of Doppler shifts for the acquisition time of navigation receiver in high dynamic situation, a improved method adopts an acquisition algorithm composed of Partial Matched Filter (PMF) and Fast Fourier Transform (FFT) method. The algorithm changes the traditional two-dimensional searching strategy based on spread spectrum code phase and signal-carrier frequency into one-dimensional searching strategy based on spread spectrum code phase. Moreover, PMF not only consumes many hardware resources but also fails to acquire long period Pseudo-Noise (PN) code. Considering of these drawbacks, an improved algorithm is proposed by using folded matched filter and accelerating the operation speed. The results of test show that folded PMF saves hardware resources and achieves double parallel fast acquisition of carrier and PN code.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"43 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114126806","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 : 2014-10-01DOI: 10.1109/ComComAp.2014.7017212
Ying Li, J. Niu, Xiang Long, Meikang Qiu
The main challenges for embedded real-time systems which use battery as their power supply are both to satisfy the requirements of real-time systems and minimize the energy consumption. This paper studies the energy saving problem for DAG (Directed Acyclic Graph) tasks in soft real-time systems with heterogeneous multicore processors. Since soft real-time systems can tolerate occasional time violations and tasks are completed before deadlines with a given probability, this paper proposes a novel processor and voltage assignment scheme - Adaptive Processor and Voltage Assignment with Probability (APVAP) to realize the minimum energy consumption which can satisfy the requirements of time constraints under the given probability. Most of previous work focuses on multicore processor task assignment for predecessor and successor (P-S) tasks. However, this paper introduced affinity to indicate successor tasks can be re-allocated to more appropriate cores according to task features and workload. Besides, this paper introduces the concept of data migration energy (DME) to compute the transmission energy when a task is migrated to a different core and adopts Ratio between Time and Energy (RTE) to determine the most suitable tasks for migration to reduce energy consumption at the cost of execution time. The experimental results demonstrate that our approach outperforms state-of-the-art algorithms in this field (maximum improvement of 30.7%).
{"title":"Energy efficient scheduling with probability and task migration considerations for soft real-time systems","authors":"Ying Li, J. Niu, Xiang Long, Meikang Qiu","doi":"10.1109/ComComAp.2014.7017212","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017212","url":null,"abstract":"The main challenges for embedded real-time systems which use battery as their power supply are both to satisfy the requirements of real-time systems and minimize the energy consumption. This paper studies the energy saving problem for DAG (Directed Acyclic Graph) tasks in soft real-time systems with heterogeneous multicore processors. Since soft real-time systems can tolerate occasional time violations and tasks are completed before deadlines with a given probability, this paper proposes a novel processor and voltage assignment scheme - Adaptive Processor and Voltage Assignment with Probability (APVAP) to realize the minimum energy consumption which can satisfy the requirements of time constraints under the given probability. Most of previous work focuses on multicore processor task assignment for predecessor and successor (P-S) tasks. However, this paper introduced affinity to indicate successor tasks can be re-allocated to more appropriate cores according to task features and workload. Besides, this paper introduces the concept of data migration energy (DME) to compute the transmission energy when a task is migrated to a different core and adopts Ratio between Time and Energy (RTE) to determine the most suitable tasks for migration to reduce energy consumption at the cost of execution time. The experimental results demonstrate that our approach outperforms state-of-the-art algorithms in this field (maximum improvement of 30.7%).","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114856781","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 : 2014-10-01DOI: 10.1109/ComComAp.2014.7017161
Chao Tong, Zhongyu Xie, Xiaoyun Mo, J. Niu, Yan Zhang
In recent years, the community structures in complex networks has become a research hotspot. In this paper, we focus on weighted networks and propose a unique algorithm on detecting overlapping communities of weighted networks based on central figure with considerable accuracy. In the algorithm, all the central figures are first extracted. Then to each central figure, nodes are absorbed by closures and weak ties. The experiments are based on LFR Benchmark. Through the experiment, we can know that the performance of our algorithm is better than that of COPRA (Community Overlap Propagation Algorithm) algorithm.
{"title":"Detecting overlapping communities of weighted networks by central figure algorithm","authors":"Chao Tong, Zhongyu Xie, Xiaoyun Mo, J. Niu, Yan Zhang","doi":"10.1109/ComComAp.2014.7017161","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017161","url":null,"abstract":"In recent years, the community structures in complex networks has become a research hotspot. In this paper, we focus on weighted networks and propose a unique algorithm on detecting overlapping communities of weighted networks based on central figure with considerable accuracy. In the algorithm, all the central figures are first extracted. Then to each central figure, nodes are absorbed by closures and weak ties. The experiments are based on LFR Benchmark. Through the experiment, we can know that the performance of our algorithm is better than that of COPRA (Community Overlap Propagation Algorithm) algorithm.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133550566","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}
Data compression on sensing data in Wireless Sensor Networks (WSNs) has long been the topic of extensive research in the last decade. Especially, in video sensor networks, the video and image data that need to be transmitted are relatively larger than common data. However WSNs usually have limited power supply and constrained communication bandwidth, it is significant to reduce the video and image data without any distortion before transmission to lower the energy consumption and the transmission delay. Therefore, in this paper we propose Horizontal Hierarchy Slicing (HHS) method based on Mathematical Morphology technology for compressing the data in WSNs. The results show its effectiveness in data compression for video and image data.
{"title":"Horizontal hierarchy slicing based data compression for WSN","authors":"Yanwen Wang, Xiaoyu Li, Xiaoling Wu, Zhangbing Zhou, Hainan Chen","doi":"10.1109/ComComAp.2014.7017206","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017206","url":null,"abstract":"Data compression on sensing data in Wireless Sensor Networks (WSNs) has long been the topic of extensive research in the last decade. Especially, in video sensor networks, the video and image data that need to be transmitted are relatively larger than common data. However WSNs usually have limited power supply and constrained communication bandwidth, it is significant to reduce the video and image data without any distortion before transmission to lower the energy consumption and the transmission delay. Therefore, in this paper we propose Horizontal Hierarchy Slicing (HHS) method based on Mathematical Morphology technology for compressing the data in WSNs. The results show its effectiveness in data compression for video and image data.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"262 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122466928","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 : 2014-10-01DOI: 10.1109/ComComAp.2014.7017215
Qingxin Xia, Yuqing Lan, Liang Zhao, Limin Xiao
With the development of cloud infrastructure services, IaaS(Infrastructure as a Service) study on energy-saving technology has been attracted more and more attention. IaaS platform providers can provide high performance service for the users. Meanwhile, how to save the energy cost of the cloud platform must be considered without violating the Service Level Agreement(SLA). The overload and underload are two running statuses of physical machine(PM), the former will cause the possibility of SLA violation, while the latter will cause the low utilization rate of PM's resources, causing additional energy consumption. This paper proposes a model of workload characteristic based on K-means clustering analysis, using Google workload trace data set, which is the basis of virtual machine(VM) migrating when PM has been underloading or overloading. The establishment of workload characteristic model can present the demand of system resources in real time so that VM scheduling strategies carry out efficiently.
随着云基础设施服务的发展，IaaS(infrastructure as a Service)节能技术的研究越来越受到重视。IaaS平台提供商可以为用户提供高性能的服务。同时，如何在不违反服务水平协议(Service Level Agreement, SLA)的前提下，节约云平台的能源成本是必须考虑的问题。过载和欠载是物理机(PM)的两种运行状态，前者会导致违反SLA的可能性，后者会导致PM的资源利用率低，造成额外的能源消耗。本文利用Google工作负载跟踪数据集，提出了基于K-means聚类分析的工作负载特征模型，该模型是虚拟机(VM)在PM处于欠载或过载状态时迁移的基础。工作负载特征模型的建立可以实时地反映系统资源的需求，从而有效地执行虚拟机调度策略。
{"title":"Energy-saving analysis of Cloud workload based on K-means clustering","authors":"Qingxin Xia, Yuqing Lan, Liang Zhao, Limin Xiao","doi":"10.1109/ComComAp.2014.7017215","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017215","url":null,"abstract":"With the development of cloud infrastructure services, IaaS(Infrastructure as a Service) study on energy-saving technology has been attracted more and more attention. IaaS platform providers can provide high performance service for the users. Meanwhile, how to save the energy cost of the cloud platform must be considered without violating the Service Level Agreement(SLA). The overload and underload are two running statuses of physical machine(PM), the former will cause the possibility of SLA violation, while the latter will cause the low utilization rate of PM's resources, causing additional energy consumption. This paper proposes a model of workload characteristic based on K-means clustering analysis, using Google workload trace data set, which is the basis of virtual machine(VM) migrating when PM has been underloading or overloading. The establishment of workload characteristic model can present the demand of system resources in real time so that VM scheduling strategies carry out efficiently.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117090520","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 : 2014-10-01DOI: 10.1109/ComComAp.2014.7017185
Long Zhang, Liusheng Huang, Hongli Xu
Recently, cognitive radio has been proposed to improved the spectrum resource utilization efficiency. The secondary users (SUs) are allowed to sense, detect and access the frequency bands that are not currently being in use by primary users (PUs). In fact, SUs always have no knowledge about PUs' exact communication mechanism. In order to guarantee PUs' communication quality of service (QoS) and satisfy SUs' demand of using spectrum resource, it is a challenging task to find the spectrum sensing and access mechanism. When there are multiple SUs and multiple channels, the spectrum allocation and spectrum sharing must be considered. In this paper, we propose a multi-user spectrum allocation and multi-channel spectrum sharing mechanism for the SUs confronting with unknown primary behavior and study the interference to PUs caused by their dynamic access. The interference caused by SUs was analysis utilizing the Renewal Theory. Under the constraints of the interference to PUs and the secondary network's stability, the queuing theory is utilized to obtain the maximum average data rate of SUs. Through lots of simulations, we verify the effectiveness of our analysis.
{"title":"Queuing-theoretical multi-user dynamic spectrum allocation & sharing mechanism in multi-channel cognitive radio networks","authors":"Long Zhang, Liusheng Huang, Hongli Xu","doi":"10.1109/ComComAp.2014.7017185","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017185","url":null,"abstract":"Recently, cognitive radio has been proposed to improved the spectrum resource utilization efficiency. The secondary users (SUs) are allowed to sense, detect and access the frequency bands that are not currently being in use by primary users (PUs). In fact, SUs always have no knowledge about PUs' exact communication mechanism. In order to guarantee PUs' communication quality of service (QoS) and satisfy SUs' demand of using spectrum resource, it is a challenging task to find the spectrum sensing and access mechanism. When there are multiple SUs and multiple channels, the spectrum allocation and spectrum sharing must be considered. In this paper, we propose a multi-user spectrum allocation and multi-channel spectrum sharing mechanism for the SUs confronting with unknown primary behavior and study the interference to PUs caused by their dynamic access. The interference caused by SUs was analysis utilizing the Renewal Theory. Under the constraints of the interference to PUs and the secondary network's stability, the queuing theory is utilized to obtain the maximum average data rate of SUs. Through lots of simulations, we verify the effectiveness of our analysis.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115135807","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 : 2014-10-01DOI: 10.1109/ComComAp.2014.7017168
Yiding Wang, Di Zhang, Xiaoyu Zhang, Wen-Rui Wu
In the production of copper electrolytic, short circuit frequently takes place between anode and cathode, the heat loss from which will result the reducing for the production of copper. To solve this problem, this paper presents a high-temperature electrode faulted diagnosis method base on the new-type integrated filtering of thermal infrared images and the division and location processing. Short circuit can be found by analyzing the temperature of the plates in the electrolytic cell timely with a suitable algorithm and realize the purpose of raising the production of electrolytic copper. We have made a practical application in electrolytic copper factory and the conclusion is accordance with the desired effects.
{"title":"High-temperature electrode faulted diagnosis for copper electrolytic cell","authors":"Yiding Wang, Di Zhang, Xiaoyu Zhang, Wen-Rui Wu","doi":"10.1109/ComComAp.2014.7017168","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017168","url":null,"abstract":"In the production of copper electrolytic, short circuit frequently takes place between anode and cathode, the heat loss from which will result the reducing for the production of copper. To solve this problem, this paper presents a high-temperature electrode faulted diagnosis method base on the new-type integrated filtering of thermal infrared images and the division and location processing. Short circuit can be found by analyzing the temperature of the plates in the electrolytic cell timely with a suitable algorithm and realize the purpose of raising the production of electrolytic copper. We have made a practical application in electrolytic copper factory and the conclusion is accordance with the desired effects.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125672493","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 : 2014-10-01DOI: 10.1109/ComComAp.2014.7017186
Mohammed I. Alghamdi, Xunfei Jiang, X. Qin, Jifu Zhang, Minghua Jiang, Meikang Qiu
In this work we propose a two-phase scheduling technique (TOPS) for distributed real-time systems. The first phase of TOPS is in charge of producing a scheduling sequence, whereas the second phase aims to dispatch tasks to computing nodes of a distributed system. The two phases are independent of one another and; therefore, one can change a policy in one phase without configuring another phase. TOPS makes it possible to observe the impacts of sorting policies on the performance of scheduling policies. We implement a TOPS prototype, in which the first phase is comprised of three sorting policies and the second phase consists of two scheduling policies in the second phase. TOPS enables us to discover that combining the EDF (Earliest-Deadline-First) and AEAP (As-Early-As-Possible) policies leads to an optimized performance among all the six candidate algorithms.
{"title":"TOPS: Two-phase scheduling for distributed real-time systems","authors":"Mohammed I. Alghamdi, Xunfei Jiang, X. Qin, Jifu Zhang, Minghua Jiang, Meikang Qiu","doi":"10.1109/ComComAp.2014.7017186","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017186","url":null,"abstract":"In this work we propose a two-phase scheduling technique (TOPS) for distributed real-time systems. The first phase of TOPS is in charge of producing a scheduling sequence, whereas the second phase aims to dispatch tasks to computing nodes of a distributed system. The two phases are independent of one another and; therefore, one can change a policy in one phase without configuring another phase. TOPS makes it possible to observe the impacts of sorting policies on the performance of scheduling policies. We implement a TOPS prototype, in which the first phase is comprised of three sorting policies and the second phase consists of two scheduling policies in the second phase. TOPS enables us to discover that combining the EDF (Earliest-Deadline-First) and AEAP (As-Early-As-Possible) policies leads to an optimized performance among all the six candidate algorithms.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122643001","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
扫码关注我们
求助内容：
应助结果提醒方式：