RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • Job Scheduling Algorithms on Grid Computing: State-of- the Art

        Adil Yousif,Sulaiman Mohd Nor,Mohammed Bakri Bashir 보안공학연구지원센터 2015 International Journal of Grid and Distributed Comp Vol.8 No.6

        Scheduling jobs on computational grids is identified as NP-complete problem due to the heterogeneity of resources; the resources belong to different administrative domains and apply different management policies. This paper conducted an extensive and wide literature review to study the state of the art of grid scheduling algorithms. This review starts with an overview of the grid technologies and a description of the grid resource management systems. The evolution of the grid scheduling mechanisms is illustrated in this paper started from basic scheduling mechanisms such as Min-Min and Max-Min approaches ending with the swarm intelligence optimization methods. The swarm intelligence and evolutionary mechanisms are also presented and critically analyzed.

      • High Exploitation Genetic Algorithm for Job Scheduling on Grid Computing

        Walaa AbdElrouf,Adil Yousif,Mohammed Bakri Bashir 보안공학연구지원센터 2016 International Journal of Grid and Distributed Comp Vol.9 No.3

        Scheduling jobs on computational grids is identified as NP-hard problem due to the heterogeneity of resources; the resources belong to different administrative domains and apply different management policies. Genetic algorithm which is a metaheuristic search on the basis of the idea of the natural evolution of living organisms generate solutions in order to reach the best solution, using techniques inspired by nature, such as the selection, crossover and mutation. One of the most important processes in the genetic algorithm is the crossover process that combines two chromosomes (parents) to produce a new chromosome (offspring). The parents with the highest fitness functions are selected to participate in the process. The idea behind crossover is that the new chromosome will be better than both parents because it takes the best qualities of both of them. This paper proposed a new job scheduling mechanism based on increasing the crossover rate in genetic algorithm in order to reach the best solution faster to improve the functionality of the genetic algorithm. To evaluate the proposed mechanism this study conducted a simulation using GridSim simulator and different workloads. The results of the simulation process revealed that the increase in the exploitation process decrease the finish time.

      • Scheduling Jobs on Cloud Computing using Firefly Algorithm

        Demyana Izzat Esa,Adil Yousif 보안공학연구지원센터 2016 International Journal of Grid and Distributed Comp Vol.9 No.7

        Cloud computing is a new technology, instead of all computer hardware and software that used on desktop, or somewhere within company's network, it's presented as a service by cloud service providers and accessed via the Internet. Exactly where hardware and software are located and how everything works does not matter. In cloud computing there are many jobs that requires to be executed on the available resources to achieve best minimal execution time. Several optimization methods are available for cloud job scheduling. However, the job scheduling process is still need to be optimized. This paper proposes a new job scheduling mechanism using Firefly Algorithm to minimize the execution time of jobs. The proposed mechanism based on information of jobs and resources such as length of job speed of resource and identifiers. The scheduling function in the proposed job scheduling mechanism firstly creates a set of jobs and resources to generate the population by assigning the jobs to resources randomly and evaluates the population using a fitness value which represents the execution time of jobs. Secondly the function used iterations to regenerate populations based on firefly behavior to produce the best job schedule that gives the minimum execution time of jobs. Several scenarios are implemented using Java Language and CloudSim simulator. Different settings have been considered in the evaluation and experimentation phase to examine the proposed mechanism in different workloads. The first phase of the evaluation process describes how the proposed mechanism can be used to minimize the execution time of jobs. The second phase of the evaluation process compares the proposed mechanism with First Come First Serves (FCFS) algorithm. The results revealed that the proposed mechanism minimizes the execution time significantly. Furthermore, the proposed mechanism outperformed the FCFS algorithm.

      • Multilevel Authentication Scheme for Cloud Computing

        Sara Alfatih Adam,Adil Yousif,Mohammed Bakri Bashir 보안공학연구지원센터 2016 International Journal of Grid and Distributed Comp Vol.9 No.9

        Cloud Computing is a new technology that allows access to applications as utilities over the internet. Cloud computing environment provides a great flexibility and availability of computing resources at a lower cost. However, it brings new security concerns mainly when users understand exactly how a process is running. One of the main important challenges in cloud computing is data security, as users need to access data they share securely. So the main problem is how to employ an effective authentication procedure for ensuring data security and preventing unauthorized users to access the authorized user’s data. This paper identifies the security issues of single level authentication and the problem of single password. This study proposed a new security mechanism for cloud computing based on multilevel authentication. The proposed scheme aimed to enhance the security and authentication process in cloud computing. The proposed scheme consists of three level of authentication, and the data will be splitting on this level depending on the sensitivity to confidential (C), secret (S), and top secret (TS). Data at level (C) have the lowest sensitivity. The user at this level has single textual password to access this level data. The user at level (S) has two passwords, textual and biometrics password to access this level and the lower level. User at level (TS) has three password textual, biometrics password and image sequencing password. The data at this level is the more sensitive data so it is encrypted using RSA algorithm before storing in cloud database. The results of the proposed multilevel authentication for cloud computing were promising.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼