In this paper, we have estimated new call block and handoff call drop performances in Cellular WiMAX. Call Admission Control (CAC) is the process of regulating voice communication, particularly in wireless mobile networks. Further it is a fundamental mechanism used for QoS provisioning in a network. It restricts the access to the network based on resource availability in order to prevent network congestion and service degradation for already supported users. CAC decides whether a new connection can be established or not. Permission is granted only when QoS requirement of the new incoming flow is met without degrading those of the existing flows. The IEEE802.16e standard support for handover (HO) and various services like with Unsolicited Grant Service (UGS), real-time Polling Service (rtPS), non-real-time Polling Service (nrtPS), Best-Effort (BE), and extended real time Polling Service (ertPS). The Quality-of-Service (QoS) parameters used are the new and handoff call blocking. In this paper we investigate the blocking performances of three channel assignment schemes in the context of Cellular WiMAX network. Numerical results are found including the performance of these schemes.
{"title":"Estimation of Blocking Performances in Mobile WiMAX Cellular Networks","authors":"Anindita Chhotray, H. K. Pati","doi":"10.1109/ICIT.2014.62","DOIUrl":"https://doi.org/10.1109/ICIT.2014.62","url":null,"abstract":"In this paper, we have estimated new call block and handoff call drop performances in Cellular WiMAX. Call Admission Control (CAC) is the process of regulating voice communication, particularly in wireless mobile networks. Further it is a fundamental mechanism used for QoS provisioning in a network. It restricts the access to the network based on resource availability in order to prevent network congestion and service degradation for already supported users. CAC decides whether a new connection can be established or not. Permission is granted only when QoS requirement of the new incoming flow is met without degrading those of the existing flows. The IEEE802.16e standard support for handover (HO) and various services like with Unsolicited Grant Service (UGS), real-time Polling Service (rtPS), non-real-time Polling Service (nrtPS), Best-Effort (BE), and extended real time Polling Service (ertPS). The Quality-of-Service (QoS) parameters used are the new and handoff call blocking. In this paper we investigate the blocking performances of three channel assignment schemes in the context of Cellular WiMAX network. Numerical results are found including the performance of these schemes.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"27 1","pages":"148-154"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75165464","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}
A data space system facilitates a new way for sharing and integrating the information among the various distributed, autonomous and heterogeneous data sources. To provide the best effort answer of a user query, a data space system needs to resolve the semantic heterogeneity in its core. There are many solutions being proposed to address this problem widely. We are exploring the problem of semantic heterogeneity in a data space system as a part of our PhD work. In this paper, we have addressed the semantic heterogeneity in the context of a data space system, and presented an abstract framework to model the semantic heterogeneity in data space. The proposed model is based on machine learning and ontology approaches. The machine learning technique analyzes the semantically equivalent data items (or entities) in data space, and the ontology conceptualizes the structural entities in a data space. This model resolves the semantic heterogeneity of a data space system, and creates a conceptual model using "from-data-to-schema" approach. The proposed approach implicitly creates the domain ontology by finding the most similar concepts comming from different data sources and enriches the performance of the system by finding the semantic relationships among them.
{"title":"Modeling Semantic Heterogeneity in Dataspace: A Machine Learning Approach","authors":"Mrityunjay Singh, S. Jain, V. Panchal","doi":"10.1109/ICIT.2014.24","DOIUrl":"https://doi.org/10.1109/ICIT.2014.24","url":null,"abstract":"A data space system facilitates a new way for sharing and integrating the information among the various distributed, autonomous and heterogeneous data sources. To provide the best effort answer of a user query, a data space system needs to resolve the semantic heterogeneity in its core. There are many solutions being proposed to address this problem widely. We are exploring the problem of semantic heterogeneity in a data space system as a part of our PhD work. In this paper, we have addressed the semantic heterogeneity in the context of a data space system, and presented an abstract framework to model the semantic heterogeneity in data space. The proposed model is based on machine learning and ontology approaches. The machine learning technique analyzes the semantically equivalent data items (or entities) in data space, and the ontology conceptualizes the structural entities in a data space. This model resolves the semantic heterogeneity of a data space system, and creates a conceptual model using \"from-data-to-schema\" approach. The proposed approach implicitly creates the domain ontology by finding the most similar concepts comming from different data sources and enriches the performance of the system by finding the semantic relationships among them.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"48 1","pages":"275-280"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79088836","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 performance of particle swarm optimization (PSO) greatly depends upon the effective selection of vital tuning metric known as acceleration coefficients (especially when applied to design space exploration (DSE) problem) which incorporates ability to clinically balance between exploration and exploitation during searching. The major contributions of the paper are as follows: a) A novel analysis of two variants of acceleration coefficient (hierarchical time varying acceleration coefficient vs. Constant acceleration coefficient) in PSO and their impact on convergence time and exploration time in context of multi objective (MO) DSE in HLS. The analysis assists the designer in pre-tuning the acceleration coefficient to an optimal value for achieving better convergence and exploration time before DSE initiation, b) A novel performance comparison of PSO driven DSE (PSO-DSE) with previous works based on quality metrics for MO evolutionary algorithms such as generational distance, maximum pareto-optimal front error, spacing, spreading and weighted metric. When two variants of acceleration coefficients (constant and time varying) were compared, it was revealed from the results that the PSO-DSE has on average 9.5% better exploration speed with constant acceleration coefficient as compared to hierarchical time varying acceleration coefficient. Further, with setting of constant acceleration coefficient, the PSO-DSE produces results with efficient generational distance, maximum pareto-optimal front error, spacing, spreading and weighted metric as compared to previous approaches.
{"title":"Time Varying vs. Fixed Acceleration Coefficient PSO Driven Exploration during High Level Synthesis: Performance and Quality Assessment","authors":"A. Sengupta, V. Mishra","doi":"10.1109/ICIT.2014.16","DOIUrl":"https://doi.org/10.1109/ICIT.2014.16","url":null,"abstract":"The performance of particle swarm optimization (PSO) greatly depends upon the effective selection of vital tuning metric known as acceleration coefficients (especially when applied to design space exploration (DSE) problem) which incorporates ability to clinically balance between exploration and exploitation during searching. The major contributions of the paper are as follows: a) A novel analysis of two variants of acceleration coefficient (hierarchical time varying acceleration coefficient vs. Constant acceleration coefficient) in PSO and their impact on convergence time and exploration time in context of multi objective (MO) DSE in HLS. The analysis assists the designer in pre-tuning the acceleration coefficient to an optimal value for achieving better convergence and exploration time before DSE initiation, b) A novel performance comparison of PSO driven DSE (PSO-DSE) with previous works based on quality metrics for MO evolutionary algorithms such as generational distance, maximum pareto-optimal front error, spacing, spreading and weighted metric. When two variants of acceleration coefficients (constant and time varying) were compared, it was revealed from the results that the PSO-DSE has on average 9.5% better exploration speed with constant acceleration coefficient as compared to hierarchical time varying acceleration coefficient. Further, with setting of constant acceleration coefficient, the PSO-DSE produces results with efficient generational distance, maximum pareto-optimal front error, spacing, spreading and weighted metric as compared to previous approaches.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"1 1","pages":"281-286"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79416477","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}
MANETs are normally used in applications which are highly confidential in nature, such as defense, disaster management, etc. Secure data transmission is one of the challenging issues in MANET. Secret sharing has been one of the popular techniques for implementing security in MANETs. The existing logics for securing the packet delivery seem to involve too many control signal interchanges. This paper discusses the performance of a multiple agent based secured routing scheme to detect secure routes with minimum load on the network. The Chinese remainder theorem is used in generating the secure key by the source node. Source node shares the secure key among all probable routes using multiple agents. The three phased approach is aimed to increase the overall performance in the network. Performance metrics which are used to evaluate the performance of AESCRT are delivery rate, load, malicious nodes and packet dropped. Simulation analysis shows that performance of AESCRT give better result compared to other existing routing protocols.
{"title":"Comparative Performance Analysis of AESCRT Using NS2","authors":"Ditipriya Sinha, R. Chaki","doi":"10.1109/ICIT.2014.42","DOIUrl":"https://doi.org/10.1109/ICIT.2014.42","url":null,"abstract":"MANETs are normally used in applications which are highly confidential in nature, such as defense, disaster management, etc. Secure data transmission is one of the challenging issues in MANET. Secret sharing has been one of the popular techniques for implementing security in MANETs. The existing logics for securing the packet delivery seem to involve too many control signal interchanges. This paper discusses the performance of a multiple agent based secured routing scheme to detect secure routes with minimum load on the network. The Chinese remainder theorem is used in generating the secure key by the source node. Source node shares the secure key among all probable routes using multiple agents. The three phased approach is aimed to increase the overall performance in the network. Performance metrics which are used to evaluate the performance of AESCRT are delivery rate, load, malicious nodes and packet dropped. Simulation analysis shows that performance of AESCRT give better result compared to other existing routing protocols.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"47 1","pages":"35-40"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76168938","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}
As a large number of requests are submitted to the data center, load balancing is one of the main challenges in Cloud Data Center. Existing load Balancing techniques mainly focus on improving the quality of services, providing the expected output on time etc. Therefore, there is a need to develop load balancing technique that can improve the performance of cloud computing along with optimal resource utilization. The proposed technique of load balancing is based on Ant Colony Optimization which detects overloaded and under loaded servers and thereby performs load balancing operations between identified servers of Data Center. The proposed technique ensures availability, achieves efficient resource utilization, maximizes number of requests handled by cloud and minimizes time required to serve multiple requests. The complexity of proposed algorithm depends on datacenter network architecture.
{"title":"A Technique Based on Ant Colony Optimization for Load Balancing in Cloud Data Center","authors":"Ekta Gupta, Vidya Deshpande","doi":"10.1109/ICIT.2014.54","DOIUrl":"https://doi.org/10.1109/ICIT.2014.54","url":null,"abstract":"As a large number of requests are submitted to the data center, load balancing is one of the main challenges in Cloud Data Center. Existing load Balancing techniques mainly focus on improving the quality of services, providing the expected output on time etc. Therefore, there is a need to develop load balancing technique that can improve the performance of cloud computing along with optimal resource utilization. The proposed technique of load balancing is based on Ant Colony Optimization which detects overloaded and under loaded servers and thereby performs load balancing operations between identified servers of Data Center. The proposed technique ensures availability, achieves efficient resource utilization, maximizes number of requests handled by cloud and minimizes time required to serve multiple requests. The complexity of proposed algorithm depends on datacenter network architecture.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"107 1","pages":"12-17"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85912687","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}
Mining Human Interaction in Meetings is useful to identify how a person reacts in different situations. Behavior represents the nature of the person and mining helps to analyze, how the person express their opinion in meeting. For this, study of semantic knowledge is important. Human interactions in meeting are categorized as propose, comment, acknowledgement, ask opinion, positive opinion and negative opinion. The sequence of human interactions is represented as a Tree. Tree structure is used to represent the Human Interaction flow in meeting. Interaction flow helps to assure the probability of another type of interaction. Tree pattern mining and sub tree pattern mining algorithms are automated to analyze the structure of the tree and to extract interaction flow patterns. The extracted patterns are interpreted from human interactions. The frequent patterns are used as an indexing tool to access a particular semantics, and that patterns are clustered to determine the behavior of the person.
{"title":"Smart Meeting System: An Approach to Recognize Patterns Using Tree Based Mining","authors":"Puja R. Kose, P. K. Bharne","doi":"10.1109/ICIT.2014.45","DOIUrl":"https://doi.org/10.1109/ICIT.2014.45","url":null,"abstract":"Mining Human Interaction in Meetings is useful to identify how a person reacts in different situations. Behavior represents the nature of the person and mining helps to analyze, how the person express their opinion in meeting. For this, study of semantic knowledge is important. Human interactions in meeting are categorized as propose, comment, acknowledgement, ask opinion, positive opinion and negative opinion. The sequence of human interactions is represented as a Tree. Tree structure is used to represent the Human Interaction flow in meeting. Interaction flow helps to assure the probability of another type of interaction. Tree pattern mining and sub tree pattern mining algorithms are automated to analyze the structure of the tree and to extract interaction flow patterns. The extracted patterns are interpreted from human interactions. The frequent patterns are used as an indexing tool to access a particular semantics, and that patterns are clustered to determine the behavior of the person.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"10 1","pages":"206-208"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82790806","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}
Reversible Logic Technology has emerged as potential logic design style for implementation in Low Power VLSI Design, Quantum Computing and Dissipation less Computing. Based on this technology, a 6×6 Multifunctional Dwivedi - Rao (DR) Gate has been designed for implementation of logical and arithmetical functions. DR gate has been applied for designing of 1-bit ALU to perform NOT, 2 no's NOR, COPIER, ADD, COUT logical and arithmetical operations in one clock cycle. Comparison of various results shows that proposed DR gate and its application in ALU design is better than its counterpart [16] in terms of Quantum Cost, Logical Operations, Worst Case Delay, Garbage output, Total Boolean function performed etc. Proposed gate has been simulated on VHDL and improvement of 72, 40, 24 logical operations on 4, 3, 2 control input signals respectively, without any garbage output.
{"title":"Design of Multifunctional DR Gate and Its Application in ALU Design","authors":"A. G. Rao, A. K. D. Dwivedi","doi":"10.1109/ICIT.2014.49","DOIUrl":"https://doi.org/10.1109/ICIT.2014.49","url":null,"abstract":"Reversible Logic Technology has emerged as potential logic design style for implementation in Low Power VLSI Design, Quantum Computing and Dissipation less Computing. Based on this technology, a 6×6 Multifunctional Dwivedi - Rao (DR) Gate has been designed for implementation of logical and arithmetical functions. DR gate has been applied for designing of 1-bit ALU to perform NOT, 2 no's NOR, COPIER, ADD, COUT logical and arithmetical operations in one clock cycle. Comparison of various results shows that proposed DR gate and its application in ALU design is better than its counterpart [16] in terms of Quantum Cost, Logical Operations, Worst Case Delay, Garbage output, Total Boolean function performed etc. Proposed gate has been simulated on VHDL and improvement of 72, 40, 24 logical operations on 4, 3, 2 control input signals respectively, without any garbage output.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"14 1","pages":"339-344"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88039843","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}
Service Oriented design and software development has gained much importance in the area of e-Governance applications. The main focus is to design and implement web services for efficient realisation of service interoperability and reuse. In this paper, we have proposed a layered service oriented design approach with government department wise abstraction levels for uniform service specification and composition mechanism. For our case study we have considered seven web services of different departments, which are interdependent. The service identification, service composition and service interaction pattern of all these services are done as per the principles of service oriented design. A generalised framework is also proposed to develop any complex web service, which can use and reuse services of multiple departments seamlessly. It provides flexible and dependable solution for developing agile e-Governance applications as the complexity of web services increases.
{"title":"Service Oriented Layered Approach for E-Governance System Implementation","authors":"R. Das, Sujata Patnaik, A. K. Padhy, C. Mohini","doi":"10.1109/ICIT.2014.38","DOIUrl":"https://doi.org/10.1109/ICIT.2014.38","url":null,"abstract":"Service Oriented design and software development has gained much importance in the area of e-Governance applications. The main focus is to design and implement web services for efficient realisation of service interoperability and reuse. In this paper, we have proposed a layered service oriented design approach with government department wise abstraction levels for uniform service specification and composition mechanism. For our case study we have considered seven web services of different departments, which are interdependent. The service identification, service composition and service interaction pattern of all these services are done as per the principles of service oriented design. A generalised framework is also proposed to develop any complex web service, which can use and reuse services of multiple departments seamlessly. It provides flexible and dependable solution for developing agile e-Governance applications as the complexity of web services increases.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"74 1","pages":"293-298"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85404358","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 paper proposes a multi-party key exchange scheme with Perfect Forward Secrecy (PFS) which ensures that a session key derived from a set of long-term public and private keys used in the protocol to authenticate, does not compromise the secrecy of session key. In this protocol, each group establishes connection by communicating through a trusted third party. The trusted party acts as a group controller generates a public key and broadcasts it among the groups. Each group generate their public keys and send to trusted party. After receiving all the keys the group controller shares it among all the parties to generate the session key. Similarly, each group manager of individual group communicates with the members of the corresponding group. The security of the proposed scheme is analysed rigorously and proved to be resistant against non-repudiation attack, replay attack, chosen cipher attack, man-in-the middle attack. The scheme has wider applications such as, sending encrypted e-mail in a military environment to multiple users, securing submitted bids information in online tender, contract signing by many organizations, etc.
{"title":"Multi-party Key-Exchange with Perfect Forward Secrecy","authors":"Susmita Mandal, S. Mohanty","doi":"10.1109/ICIT.2014.30","DOIUrl":"https://doi.org/10.1109/ICIT.2014.30","url":null,"abstract":"The paper proposes a multi-party key exchange scheme with Perfect Forward Secrecy (PFS) which ensures that a session key derived from a set of long-term public and private keys used in the protocol to authenticate, does not compromise the secrecy of session key. In this protocol, each group establishes connection by communicating through a trusted third party. The trusted party acts as a group controller generates a public key and broadcasts it among the groups. Each group generate their public keys and send to trusted party. After receiving all the keys the group controller shares it among all the parties to generate the session key. Similarly, each group manager of individual group communicates with the members of the corresponding group. The security of the proposed scheme is analysed rigorously and proved to be resistant against non-repudiation attack, replay attack, chosen cipher attack, man-in-the middle attack. The scheme has wider applications such as, sending encrypted e-mail in a military environment to multiple users, securing submitted bids information in online tender, contract signing by many organizations, etc.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"1 1","pages":"362-367"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88964053","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}
Many applications in scientific computations exhibit both data and task parallelism. Several studies have proved that designing parallel applications using both task and data parallelism is an effective approach than pure data or pure task parallel models. This mixed parallelism achieves both higher scalability and performance. Mixed parallel applications are represented as Parallel Task Graph (PTG), a graph of data parallel tasks. Scheduling such a mixed-parallel application is NP-complete even on a single homogeneous cluster. To maximize resource utilizations and to increase cluster throughput, multiple applications are scheduled concurrently on a cluster. Scheduling multiple applications is challenging as different applications compete for the shared resources and also fairness must be ensured. A new method to perform concurrent schedule of multiple PTGs on a cluster is proposed in this work. Further a complete framework to schedule PTGs submitted at different instants of time and to vary processor allotment for each application during their depending on processor availability is proposed. From simulation experiments, it is observed that the proposed method to schedule multiple PTGs performs better than other methods found in the literature. The suggested scheduler framework to handle online submission of PTGs is proved to be a promising one.
{"title":"A Framework for Multiple Parallel Task Graphs (PTG) Scheduler","authors":"U. Boregowda, Venugopal R. Chakravarthy","doi":"10.1109/ICIT.2014.34","DOIUrl":"https://doi.org/10.1109/ICIT.2014.34","url":null,"abstract":"Many applications in scientific computations exhibit both data and task parallelism. Several studies have proved that designing parallel applications using both task and data parallelism is an effective approach than pure data or pure task parallel models. This mixed parallelism achieves both higher scalability and performance. Mixed parallel applications are represented as Parallel Task Graph (PTG), a graph of data parallel tasks. Scheduling such a mixed-parallel application is NP-complete even on a single homogeneous cluster. To maximize resource utilizations and to increase cluster throughput, multiple applications are scheduled concurrently on a cluster. Scheduling multiple applications is challenging as different applications compete for the shared resources and also fairness must be ensured. A new method to perform concurrent schedule of multiple PTGs on a cluster is proposed in this work. Further a complete framework to schedule PTGs submitted at different instants of time and to vary processor allotment for each application during their depending on processor availability is proposed. From simulation experiments, it is observed that the proposed method to schedule multiple PTGs performs better than other methods found in the literature. The suggested scheduler framework to handle online submission of PTGs is proved to be a promising one.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"15 1","pages":"6-11"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79776418","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
扫码关注我们
求助内容：
应助结果提醒方式：