Pub Date : 2014-10-01DOI: 10.1109/ComComAp.2014.7017202
Chen Xiao, Wendong Wang, Nan Yang, Lifeng Wang
In embedded video sensing system, real-time video data is high-volume. Meanwhile, the computation and energy resources are very limited, which restricts the usage of complex encryption process on video data. Therefore the confidentiality of video data under limited resources needs to be addressed. Firstly, dissymmetry with its trend between data volume and limited resources has been studied, while a strategy of resources optimization is given. Secondly, an all-purpose speed adjustable fast encryption scheme with its improved version is proposed. Thirdly, a DSP and ARM based embedded secure video sensing system is designed, and the fast encryption scheme and the improved version have been implemented in secure video data storage and transmission of system respectively. Experimental analyses show that the encryption schemes can meet the system's real-time requirements under the tight resource constraints.
{"title":"A video sensing oriented speed adjustable fast multimedia encryption scheme and embedded system","authors":"Chen Xiao, Wendong Wang, Nan Yang, Lifeng Wang","doi":"10.1109/ComComAp.2014.7017202","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017202","url":null,"abstract":"In embedded video sensing system, real-time video data is high-volume. Meanwhile, the computation and energy resources are very limited, which restricts the usage of complex encryption process on video data. Therefore the confidentiality of video data under limited resources needs to be addressed. Firstly, dissymmetry with its trend between data volume and limited resources has been studied, while a strategy of resources optimization is given. Secondly, an all-purpose speed adjustable fast encryption scheme with its improved version is proposed. Thirdly, a DSP and ARM based embedded secure video sensing system is designed, and the fast encryption scheme and the improved version have been implemented in secure video data storage and transmission of system respectively. Experimental analyses show that the encryption schemes can meet the system's real-time requirements under the tight resource constraints.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"290 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":"116770813","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.7017173
M. Miao, J. Sun, S. Shao
The introduction of device-to-device(D2D) technology into LTE system could bring such mutual interferences between cellular users and D2D users that the instantaneous channel quality become worse in D2D communication. In this paper, with the purpose to make up for the link loss that caused by serious interferences and to optimize the performance of Device-to-Device communication, we consider a cross-layer framework which combines hybrid automatic repeat request(HARQ) protocol at the data link layer with the adaptive modulation and coding(AMC) technique at physical layer under the prescribed packet rate and average delay. At the same time, we compare the three types HARQ schemes in terms of throughput. Numerical simulation results illustrate that the application of type III HARQ could achieve the highest throughput and the performance of overall system is better than conventional scheme.
{"title":"Cross-layer optimization schemes based on HARQ for Device-to-Device communication","authors":"M. Miao, J. Sun, S. Shao","doi":"10.1109/ComComAp.2014.7017173","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017173","url":null,"abstract":"The introduction of device-to-device(D2D) technology into LTE system could bring such mutual interferences between cellular users and D2D users that the instantaneous channel quality become worse in D2D communication. In this paper, with the purpose to make up for the link loss that caused by serious interferences and to optimize the performance of Device-to-Device communication, we consider a cross-layer framework which combines hybrid automatic repeat request(HARQ) protocol at the data link layer with the adaptive modulation and coding(AMC) technique at physical layer under the prescribed packet rate and average delay. At the same time, we compare the three types HARQ schemes in terms of throughput. Numerical simulation results illustrate that the application of type III HARQ could achieve the highest throughput and the performance of overall system is better than conventional scheme.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"27 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":"129416302","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.7017174
Pingyan Shi, Zhenguo Shi, Xiaofeng Tao, Jianchao Ji, Xiaohui Liu
This paper studies the Rake receiver for the direct sequence ultra-wideband (DS-UWB) system. SRake receiver and PRake receiver are employed to receive the UWB signal in the indoor dense multi-path UWB channel (IEEE P802.15.TG3a). In order to study how to improve the performance of receivers, different order of Gaussian pulses are discussed firstly. And then, the ML estimation algorithm is used to get the channel timing delay and the weighted value of the Rake receiver. The effect of the performance influenced by different assisted-pilot numbers is discussed with different SNR. Finally, the influence of different branch numbers of the SRake receiver and PRake receiver are given. The simulation results show that the fifth order Gaussian pulse could achieve better performance for the SRake considering the limits of FCC, while the waveforms will not affect the performance greatly for the PRAke receiver. Furthermore, more numbers of assisted-pilot and branches of receiver will improve the system performance. All of these results provide a basis for Rake receiver design of DS-UWB system.
{"title":"Design of Rake receiver for the multi-path DS-UWB system","authors":"Pingyan Shi, Zhenguo Shi, Xiaofeng Tao, Jianchao Ji, Xiaohui Liu","doi":"10.1109/ComComAp.2014.7017174","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017174","url":null,"abstract":"This paper studies the Rake receiver for the direct sequence ultra-wideband (DS-UWB) system. SRake receiver and PRake receiver are employed to receive the UWB signal in the indoor dense multi-path UWB channel (IEEE P802.15.TG3a). In order to study how to improve the performance of receivers, different order of Gaussian pulses are discussed firstly. And then, the ML estimation algorithm is used to get the channel timing delay and the weighted value of the Rake receiver. The effect of the performance influenced by different assisted-pilot numbers is discussed with different SNR. Finally, the influence of different branch numbers of the SRake receiver and PRake receiver are given. The simulation results show that the fifth order Gaussian pulse could achieve better performance for the SRake considering the limits of FCC, while the waveforms will not affect the performance greatly for the PRAke receiver. Furthermore, more numbers of assisted-pilot and branches of receiver will improve the system performance. All of these results provide a basis for Rake receiver design of DS-UWB system.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"73 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":"125949728","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.7017191
Jianwen Sun, Xiang Long, Han Wan, Jingwei Yang
Checkpointing is the act of saving the state of a running program so that it may be recovered later, which is a general idea that enables various functionalities in computer systems, including fault tolerance, system recovery, and process migration. Checkpointing mechanisms in traditional systems normally save the state of process running on volatile memory to a checkpoint file stored on non-volatile disks. However, moving checkpoint data between decoupled memory and storage levels can be significantly inefficient. Emerging non-volatile memory technology with their large, fast and persistent properties has the potential to finalize this traditional decoupled memory/storage model. Implementing checkpointing mechanism in a system based on non-volatile memories can largely improve the performance of checkpointing. We have implemented an embedded platform based on magnetic random access memories and a checkpointing mechanism in this system. Our results show that checkpointing performance based on non-volatile memories can be order of magnitudes faster than traditional disk-based (or flash-based) approaches and that it is possible to conduct checkpointing operation in a shorter period. Restarting procedure in our platform can be done instantaneously, which shows possibilities of implementing instant-on.
{"title":"A checkpointing and instant-on mechanism for a embedded system based on non-volatile memories","authors":"Jianwen Sun, Xiang Long, Han Wan, Jingwei Yang","doi":"10.1109/ComComAp.2014.7017191","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017191","url":null,"abstract":"Checkpointing is the act of saving the state of a running program so that it may be recovered later, which is a general idea that enables various functionalities in computer systems, including fault tolerance, system recovery, and process migration. Checkpointing mechanisms in traditional systems normally save the state of process running on volatile memory to a checkpoint file stored on non-volatile disks. However, moving checkpoint data between decoupled memory and storage levels can be significantly inefficient. Emerging non-volatile memory technology with their large, fast and persistent properties has the potential to finalize this traditional decoupled memory/storage model. Implementing checkpointing mechanism in a system based on non-volatile memories can largely improve the performance of checkpointing. We have implemented an embedded platform based on magnetic random access memories and a checkpointing mechanism in this system. Our results show that checkpointing performance based on non-volatile memories can be order of magnitudes faster than traditional disk-based (or flash-based) approaches and that it is possible to conduct checkpointing operation in a shorter period. Restarting procedure in our platform can be done instantaneously, which shows possibilities of implementing instant-on.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"87 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":"125761295","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.7017208
Chaoqing Ma, O. Gwun, Seung-Han Jeong
The simulation of thrombosis is a popular research topic recently. Since Level Set Methods have well developed in fluid flow simulation, this paper presents a 3D simulation of primary thrombus formation based on Level Set Methods. A hybrid model including a macroscale model and a microscale model is built to simulate the flow, adhesion, and aggregation of platelets. The macroscale model is based on Navier-Stokes equations and the microscale model is described as external force and viscosity increase of platelets. By this simulation we observe the process of primary thrombus formation and analyze the effect of Reynolds Number (Re) to the formation rate. The results show that the formation rate increases with Re rise and this phenomenon becomes significant when Re is larger than the normal average Re of vessels which is a threshold value.
{"title":"3D simulation of primary thrombus formation based on Level Set Methods","authors":"Chaoqing Ma, O. Gwun, Seung-Han Jeong","doi":"10.1109/ComComAp.2014.7017208","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017208","url":null,"abstract":"The simulation of thrombosis is a popular research topic recently. Since Level Set Methods have well developed in fluid flow simulation, this paper presents a 3D simulation of primary thrombus formation based on Level Set Methods. A hybrid model including a macroscale model and a microscale model is built to simulate the flow, adhesion, and aggregation of platelets. The macroscale model is based on Navier-Stokes equations and the microscale model is described as external force and viscosity increase of platelets. By this simulation we observe the process of primary thrombus formation and analyze the effect of Reynolds Number (Re) to the formation rate. The results show that the formation rate increases with Re rise and this phenomenon becomes significant when Re is larger than the normal average Re of vessels which is a threshold value.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"1 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":"128646275","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}
Nowadays an increasing number of Open Geospatial Consortium Web services (OWSs) is built and being available on the Web for the accessibility and processing of geospatial information. Typically, the specific requirement specified by a certain user can be satisfied by a chain of OWSs. In this setting, retrieving and recommending sub-chains of possible service invocations is critical. Leveraging the semantic similarity between the name and text description of parameters and operations, the degree that represents the invocation possibility between operations in OWSs is calculated. Thereafter, the service network model is constructed that captures the possible invocations between operations. Given a user's requirement represented in terms of the initial and ending operations, possible sub-chains of operations are retrieved, ranked and recommended. Based on which the user can select the most appropriate sub-chain with respect to her specific requirement.
如今，越来越多的开放地理空间联盟Web服务(Open Geospatial Consortium Web services, OWSs)被构建并在Web上可用，用于地理空间信息的访问和处理。通常，某个用户指定的特定需求可以通过OWSs链来满足。在此设置中，检索和推荐可能的服务调用的子链至关重要。利用参数和操作的名称和文本描述之间的语义相似性，计算OWSs中操作之间调用可能性的程度。然后，构建服务网络模型，以捕获操作之间可能的调用。给定以初始和结束操作表示的用户需求，检索、排序和推荐可能的操作子链。在此基础上，用户可以根据自己的具体需求选择最合适的子链。
{"title":"Web service sub-chain recommendation leveraging graph searching","authors":"Zehui Cheng, Beibei Yao, Xiaolei Wang, Zhangbing Zhou","doi":"10.1109/ComComAp.2014.7017209","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017209","url":null,"abstract":"Nowadays an increasing number of Open Geospatial Consortium Web services (OWSs) is built and being available on the Web for the accessibility and processing of geospatial information. Typically, the specific requirement specified by a certain user can be satisfied by a chain of OWSs. In this setting, retrieving and recommending sub-chains of possible service invocations is critical. Leveraging the semantic similarity between the name and text description of parameters and operations, the degree that represents the invocation possibility between operations in OWSs is calculated. Thereafter, the service network model is constructed that captures the possible invocations between operations. Given a user's requirement represented in terms of the initial and ending operations, possible sub-chains of operations are retrieved, ranked and recommended. Based on which the user can select the most appropriate sub-chain with respect to her specific requirement.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"156 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":"114272053","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.7017176
Xiong Li, Junguo Liao, Jiao Zhang, J. Niu, S. Kumari
Recently, Yang et al. Proposed a remote user authentication scheme using smart card. Through careful cryptanalysis, we find that Yang et al.'s scheme is not repairable, and cannot achieve mutual authentication and session key agreement. To overcome these security flaws, we propose a new remote user authentication scheme with smart card. In the proposed scheme, the user can choose his/her password freely and renew the password anytime. At the same time, the proposed scheme provides more functions and security features, such as mutual authentication, session key agreement, perfect forward secrecy and so on.
{"title":"A secure remote user mutual authentication scheme using smart cards","authors":"Xiong Li, Junguo Liao, Jiao Zhang, J. Niu, S. Kumari","doi":"10.1109/ComComAp.2014.7017176","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017176","url":null,"abstract":"Recently, Yang et al. Proposed a remote user authentication scheme using smart card. Through careful cryptanalysis, we find that Yang et al.'s scheme is not repairable, and cannot achieve mutual authentication and session key agreement. To overcome these security flaws, we propose a new remote user authentication scheme with smart card. In the proposed scheme, the user can choose his/her password freely and renew the password anytime. At the same time, the proposed scheme provides more functions and security features, such as mutual authentication, session key agreement, perfect forward secrecy and so on.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"1 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":"129850673","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.7017188
Boxue Wang, Xinhuai Tang
Web service compositions run in changing environment where different context events can arise to affect the execution of services. In order not to make service execution affected by context events, context-aware service composition becomes one of the major research trends. Service providers can develop context-aware services which can adapt their behaviors dynamically to execution contexts. However, it burdens service providers because they have to keep in mind different execution contexts where their services could be used. In this paper, we design and implement a self-adaptive and context-aware service composition system which can adapt to changing execution contexts and make adjustments according to context events and user-defined personalized policies. It frees service providers from context handling which in turn becomes a task of our system. We use OWL to model context ontologies and extend the OWL-S service model to support context information. Policy is a user-defined adjustment strategy to guide the dynamic adaptation. Service consumers can submit their requests and get context-aware services. Our system can composite services according to service consumers' requests, execute services, monitor execution contexts and adjust its action when contexts change.
{"title":"Designing a self-adaptive and context-aware service composition system","authors":"Boxue Wang, Xinhuai Tang","doi":"10.1109/ComComAp.2014.7017188","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017188","url":null,"abstract":"Web service compositions run in changing environment where different context events can arise to affect the execution of services. In order not to make service execution affected by context events, context-aware service composition becomes one of the major research trends. Service providers can develop context-aware services which can adapt their behaviors dynamically to execution contexts. However, it burdens service providers because they have to keep in mind different execution contexts where their services could be used. In this paper, we design and implement a self-adaptive and context-aware service composition system which can adapt to changing execution contexts and make adjustments according to context events and user-defined personalized policies. It frees service providers from context handling which in turn becomes a task of our system. We use OWL to model context ontologies and extend the OWL-S service model to support context information. Policy is a user-defined adjustment strategy to guide the dynamic adaptation. Service consumers can submit their requests and get context-aware services. Our system can composite services according to service consumers' requests, execute services, monitor execution contexts and adjust its action when contexts change.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"36 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":"124820257","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}
An automated method of penetration testing was proposed, which is deigned to solve the problems such as high cost and low efficiency in the traditional penetration testing. This method consists of two parts: the automatic generating method of the penetration testing scheme and the automatic executing method of penetration testing scheme. We design and implement an original system which can execute penetration testing automatically, it was named AEPT (automatic executing penetration testing). The system integrates the necessary functions of penetration testing and can execute the penetration testing automatically. The experimental results showed that this method can overcome the problems exist in traditional penetration testing and can dramatically improve the efficiency and the accuracy of penetration testing, greatly reduce the cost of penetration testing.
{"title":"An automated method of penetration testing","authors":"Xue Qiu, Shuguang Wang, Qiong Jia, Chunhe Xia, Qingxin Xia","doi":"10.1109/ComComAp.2014.7017198","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017198","url":null,"abstract":"An automated method of penetration testing was proposed, which is deigned to solve the problems such as high cost and low efficiency in the traditional penetration testing. This method consists of two parts: the automatic generating method of the penetration testing scheme and the automatic executing method of penetration testing scheme. We design and implement an original system which can execute penetration testing automatically, it was named AEPT (automatic executing penetration testing). The system integrates the necessary functions of penetration testing and can execute the penetration testing automatically. The experimental results showed that this method can overcome the problems exist in traditional penetration testing and can dramatically improve the efficiency and the accuracy of penetration testing, greatly reduce the cost of penetration testing.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"5 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":"122992369","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.7017200
M. M. Alobaedy, K. Ku-Mahamud
Metaheuristics algorithms show very good performance in solving various job scheduling problems in computational grid systems. However, due to the complexity and heterogeneous nature of resources in grid computing, stand-alone algorithm is not capable to find a good quality solution in reasonable time. This study proposes a hybrid algorithm, specifically ant colony system and genetic algorithm to solve the job scheduling problem. The high level hybridization algorithm will keep the identity of each algorithm in performing the scheduling task. The study focuses on static grid computing environment and the metrics for optimization are the makespan and flowtime. Experiment results show that the proposed algorithm outperforms other stand-alone algorithms such as ant system, genetic algorithms, and ant colony system for makespan. However, for flowtime, ant system and genetic algorithm perform better.
{"title":"Scheduling jobs in computational grid using hybrid ACS and GA approach","authors":"M. M. Alobaedy, K. Ku-Mahamud","doi":"10.1109/ComComAp.2014.7017200","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017200","url":null,"abstract":"Metaheuristics algorithms show very good performance in solving various job scheduling problems in computational grid systems. However, due to the complexity and heterogeneous nature of resources in grid computing, stand-alone algorithm is not capable to find a good quality solution in reasonable time. This study proposes a hybrid algorithm, specifically ant colony system and genetic algorithm to solve the job scheduling problem. The high level hybridization algorithm will keep the identity of each algorithm in performing the scheduling task. The study focuses on static grid computing environment and the metrics for optimization are the makespan and flowtime. Experiment results show that the proposed algorithm outperforms other stand-alone algorithms such as ant system, genetic algorithms, and ant colony system for makespan. However, for flowtime, ant system and genetic algorithm perform better.","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":"129328241","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
扫码关注我们
求助内容：
应助结果提醒方式：