Search results for: modular scheduling

Authors: Sawsen Khlifa, Chiheb AMeur Abid, Belhassan Zouari

Abstract:

Modular verification approaches have been widely attempted to cope with the well known state explosion problem. This paper deals with the modular verification of modular Petri nets. We propose a reduced version for the modular state space of a given modular Petri net. The new structure allows the creation of smaller modular graphs. Each one draws the behavior of the corresponding module and outlines some global information. Hence, this version helps to overcome the explosion problem and to use less memory space. In this condensed structure, the verification of some generic properties concerning one module is limited to the exploration of its associated graph.

Keywords: distributed systems, modular verification, petri nets, state space explosition

Procedia PDF Downloads 114

Authors: Chanhyuck Jeon, Jongho Park, Jinwoong Choi, Sungnam Hong, Sun-Kyu Park

Abstract:

Many industries put emphasis on environmentally-friendliness as environmental problems are on the rise all over the world. Among themselves, the Modular Bridge research is going on. Also performing cross-section optimization and duration reducing, this research aims at developing the modular bridge with Environment-Friendliness and economic feasibility. However, the difficulty lies in verifying environmental effectiveness because there are no field applications of the modular bridge until now. Therefore, this thesis is categorized according to the form of the modular bridge superstructure and assessed CO₂ emission quantification per work types and materials according to each form to verify the environmental effectiveness of the modular bridge.

Keywords: modular bridge, CO2 emission, environmentally friendly, quantification, carbon emission factor, LCA (Life Cycle Assessment)

Procedia PDF Downloads 554

Authors: Keshav Rathi, Aakriti Sharma, Vinayak R. Dinesh, Irfan Ramzan Parray

Abstract:

Scheduling is a basic operating system function since practically all computer resources are scheduled before use. The CPU is one of the most important computer resources. Central Processing Unit (CPU) scheduling is vital because it allows the CPU to transition between processes. A processor is the most significant resource in a computer; the operating system can increase the computer's productivity. The objective of the operating system is to allow as many processes as possible to operate at the same time in order to maximize CPU utilization. The highly efficient CPU scheduler is based on the invention of high-quality scheduling algorithms that meet the scheduling objectives. In this paper, we reviewed various fundamental CPU scheduling algorithms for a single CPU and showed which algorithm is best for the particular situation.

Keywords: computer science, Operating system, CPU scheduling, cpu algorithms

Procedia PDF Downloads 3

Authors: Rupali Verma, Maitreyee Dutta, Renu Vig

Abstract:

Encryption and decryption in RSA are done by modular exponentiation which is achieved by repeated modular multiplication. Hence, efficiency of modular multiplication directly determines the efficiency of RSA cryptosystem. This paper designs a Modified Montgomery Modular multiplication in which addition of operands is computed by 4:2 compressor. The basic logic operations in addition are partitioned over two iterations such that parallel computations are performed. This reduces the critical path delay of proposed Montgomery design. The proposed design and RSA are implemented on Virtex 2 and Virtex 5 FPGAs. The two factors partitioning and parallelism have improved the frequency and throughput of proposed design.

Keywords: RSA, montgomery modular multiplication, 4:2 compressor, FPGA

Procedia PDF Downloads 412

Authors: Jian Zheng, Yoshiyasu Takahashi, Yuichi Kobayashi, Tatsuhiro Sato

Abstract:

In the study, we present a conceptual framework for developing a scheduling system that can generate self-explanatory and easy-understanding schedules. To this end, a user interface is conceived to help planners record factors that are considered crucial in scheduling, as well as internal and external sources relating to such factors. A hybrid approach combining machine learning and constraint programming is developed to generate schedules and the corresponding factors, and accordingly display them on the user interface. Effects of the proposed system on scheduling are discussed, and it is expected that scheduling efficiency and system understandability will be improved, compared with previous scheduling systems.

Keywords: constraint programming, factors considered in scheduling, machine learning, scheduling system

Procedia PDF Downloads 323

Authors: Sean Bryner S. Rey, Eric Tanjutco

Abstract:

Modular execution strategies are performed to address the various challenges of any projects and are implemented on each project phase that covers Engineering, Procurement, Fabrication and Construction. It was until the recent years that the intent to surpass mechanical modularization approach were conceptualized to give solution to much greater demands of project components such as site location and adverse weather condition, material sourcing, construction schedule, safety risks and overall plot layout and allocation. The intent of this paper is to introduce the 3rd Generation Modular Execution with an overview of its advantages on project execution and will give emphasis on Engineering, Construction, Operation and Maintenance. Most importantly, the paper will present the key differentiator of 3rd Gen modular execution against other conventional project execution and the merits it bears for the industry.

Keywords: 3rd generation modular, process block, construction, operation & maintenance

Procedia PDF Downloads 474

Authors: Berhane Tewelday Weldhiwot

Abstract:

This research investigates the pivotal role of modular forms in modern cryptographic systems, particularly focusing on their applications in secure communications and data integrity. Modular forms, which are complex analytic functions with rich arithmetic properties, have gained prominence due to their connections to number theory and algebraic geometry. This study begins by outlining the fundamental concepts of modular forms and their historical development, followed by a detailed examination of their applications in cryptographic protocols such as elliptic curve cryptography and zero-knowledge proofs. By employing techniques from analytic number theory, the research delves into how modular forms can enhance the efficiency and security of cryptographic algorithms. The findings suggest that leveraging modular forms not only improves computational performance but also fortifies security measures against emerging threats in digital communication. This work aims to contribute to the ongoing discourse on integrating advanced mathematical theories into practical applications, ultimately fostering innovation in cryptographic methodologies.

Keywords: modular forms, cryptography, elliptic curves, applications, mathematical theory

Procedia PDF Downloads 15

Authors: Jae Hee Chung, Tae Uk Kang, Byung Seo Kim

Abstract:

This study aims to propose design technologies for the energy-saving modular housing units considering environmental and aesthetic aspects. Modular houses are environmentally friendly based on 3R (Reduce, Reuse, Recycle) because they can dramatically reduce carbon dioxide and construction wastes generated during the construction, use, and disposal process by the pre-fabrication at the factory and the recyclability of the unit, compared to the existing construction methods. The existing modular housing, however, tends to focus on quantitative aspects of energy reduction, such as windows, insulation, and introduction of renewable energy, and there is not much research on energy-saving type units considering the environmental aspects such as daylighting and ventilation, and the design that goes beyond the standardized appearance. Therefore, this study conducts theoretical investigation and analytical case studies on the energy-saving methods through various architectural planning elements as well as materials like insulation considering the environmental and aesthetic aspects in the modular housing. Then, comparative analysis on the energy efficiency through the energy simulation is conducted. As a conclusion, the energy-saving modular housing units considering environmental and aesthetics aspects are proposed. It is expected that this study will contribute to the supply and activation of modular housing through deriving design technologies for the energy-saving modular housing units that consider not only quantitative aspects but also qualitative aspects.

Keywords: aesthetic aspects, energy-saving, environmental, modular housing

Procedia PDF Downloads 356

Authors: Anju Bala, Inderveer Chana

Abstract:

Task scheduling is the key concern for the execution of performance-driven workflow applications. As efficient scheduling can have major impact on the performance of the system, task scheduling is often chosen for assigning the request to resources in an efficient way based on cloud resource characteristics. In this paper, priority based task scheduling algorithm has been proposed that prioritizes the tasks based on the length of the instructions. The proposed scheduling approach prioritize the tasks of Cloud applications according to the limits set by six sigma control charts based on dynamic threshold values. Further, the proposed algorithm has been validated through the CloudSim toolkit. The experimental results demonstrate that the proposed algorithm is effective for handling multiple task lists from workflows and in considerably reducing Makespan and Execution time.

Keywords: cloud computing, priority based scheduling, task scheduling, VM allocation

Procedia PDF Downloads 516

Authors: Ajit Rai, Hamza Deroui, Blandine Vacher, Khwansiri Ninpan, Arthur Aumont, Francesco Vitillo, Robert Plana

Abstract:

Large-scale critical industrial scheduling problems are based on Resource-Constrained Project Scheduling Problems (RCPSP), that necessitate integration with other optimization problems (e.g., vehicle routing, supply chain, or unique industrial ones), thus requiring practical solutions (i.e., modular, computationally efficient with feasible solutions). To the best of our knowledge, the current industrial state of the art is not addressing this holistic problem. We propose an original modular solution that answers the issues exhibited by the delivery of complex projects. With three interlinked entities (project, task, resources) having their constraints, it uses a greedy heuristic with a dynamic cost function for each task with a situational assessment at each time step. It handles large-scale data and can be easily integrated with other optimization problems, already existing industrial tools and unique constraints as required by the use case. The solution has been tested and validated by domain experts on three use cases: outage management in Nuclear Power Plants (NPPs), planning of future NPP maintenance operation, and application in the defense industry on supply chain and factory relocation. In the first use case, the solution, in addition to the resources’ availability and tasks’ logical relationships, also integrates several project-specific constraints for outage management, like, handling of resource incompatibility, updating of tasks priorities, pausing tasks in a specific circumstance, and adjusting dynamic unit of resources. With more than 20,000 tasks and multiple constraints, the solution provides a feasible schedule within 10-15 minutes on a standard computer device. This time-effective simulation corresponds with the nature of the problem and requirements of several scenarios (30-40 simulations) before finalizing the schedules. The second use case is a factory relocation project where production lines must be moved to a new site while ensuring the continuity of their production. This generates the challenge of merging job shop scheduling and the RCPSP with location constraints. Our solution allows the automation of the production tasks while considering the rate expectation. The simulation algorithm manages the use and movement of resources and products to respect a given relocation scenario. The last use case establishes a future maintenance operation in an NPP. The project contains complex and hard constraints, like on Finish-Start precedence relationship (i.e., successor tasks have to start immediately after predecessors while respecting all constraints), shareable coactivity for managing workspaces, and requirements of a specific state of "cyclic" resources (they can have multiple states possible with only one at a time) to perform tasks (can require unique combinations of several cyclic resources). Our solution satisfies the requirement of minimization of the state changes of cyclic resources coupled with the makespan minimization. It offers a solution of 80 cyclic resources with 50 incompatibilities between levels in less than a minute. Conclusively, we propose a fast and feasible modular approach to various industrial scheduling problems that were validated by domain experts and compatible with existing industrial tools. This approach can be further enhanced by the use of machine learning techniques on historically repeated tasks to gain further insights for delay risk mitigation measures.

Keywords: deterministic scheduling, optimization coupling, modular scheduling, RCPSP

Procedia PDF Downloads 198

Authors: Achim Kampker, Peter Burggräf, Moritz Krunke, Hanno Voet

Abstract:

As a reaction to current challenges in factory planning, many companies think about introducing factory standards to lower planning times and decrease planning costs. If these factory standards are set-up with a high level of modularity, they are defined as modular factory systems. This paper deals with the main current problems in the application of modular factory systems in practice and presents a solution approach with its basic models. The methodology is based on methods from factory planning but also uses the tools of other disciplines like product development or technology management to deal with the high complexity, which the development of modular factory systems implies. The four basic models that such a methodology has to contain are introduced and pointed out.

Keywords: factory planning, modular factory systems, factory standards, cost-benefit analysis

Procedia PDF Downloads 593

Authors: Su Xiaohan, Jin Chicheng, Liu Yijing, Burra Venkata Durga Kumar

Abstract:

Energy-aware scheduling in real-time systems aims to minimize energy consumption, but issues related to resource reservation and timing constraints remain challenges. This study focuses on analyzing two scheduling algorithms, Fair-Share Scheduling (FFS) and Priority-Driven Preemptive Scheduling (PDPS), for solving these issues and energy-aware scheduling in real-time systems. Based on research on both algorithms and the processes of solving two problems, it can be found that Fair-Share Scheduling ensures fair allocation of resources but needs to improve with an imbalanced system load, and Priority-Driven Preemptive Scheduling prioritizes tasks based on criticality to meet timing constraints through preemption but relies heavily on task prioritization and may not be energy efficient. Therefore, improvements to both algorithms with energy-aware features will be proposed. Future work should focus on developing hybrid scheduling techniques that minimize energy consumption through intelligent task prioritization, resource allocation, and meeting time constraints.

Keywords: energy-aware scheduling, fair-share scheduling, priority-driven preemptive scheduling, real-time systems, optimization, resource reservation, timing constraints

Procedia PDF Downloads 118

Authors: Jae-Joon Song, Sang-Yoon Lee, Bong-Chul Joo

Abstract:

The girder-type precast modular bridge has been developed as a simply supported bridge. The girder-type precast modular bridge could be applied to the multi-span bridges through the continuity method. The continuity of the girder-type precast modular bridge is achieved by using the link slab which is easy to construction and appropriate to the rapid construction. In this study, the link slab with transition zone was used for the continuity of the precast modular bridges, and the construction detail of link slab was modified. In addition, the modified iterative design method of link slab was proposed in this study. To verify the proposed design method, the fatigue test using the mock-up specimen was conducted with cycle loading condition up to two million cycles.

Keywords: precast, modular bridge, link slab

Procedia PDF Downloads 435

Authors: Ali Bagherinia

Abstract:

Efficient task scheduling method can meet users' requirements, and improve the resource utilization, then increase the overall performance of the cloud computing environment. Cloud computing has new features, such as flexibility, virtualization and etc., in this paper we propose a two levels task scheduling method based on load balancing in cloud computing. This task scheduling method meet user's requirements and get high resource utilization, that simulation results in CloudSim simulator prove this.

Keywords: cloud computing, task scheduling, virtualization, SLA

Procedia PDF Downloads 400

Authors: Samia Dardouri, Ridha Bouallegue

Abstract:

Scheduling is the process of dynamically allocating physical resources to User Equipment (UE) based on scheduling algorithms implemented at the LTE base station. Various algorithms have been proposed by network researchers as the implementation of scheduling algorithm which represents an open issue in Long Term Evolution (LTE) standard. This paper makes an attempt to study and compare the performance of PF, MLWDF and EXP/PF scheduling algorithms. The evaluation is considered for a single cell with interference scenario for different flows such as Best effort, Video and VoIP in a pedestrian and vehicular environment using the LTE-Sim network simulator. The comparative study is conducted in terms of system throughput, fairness index, delay, packet loss ratio (PLR) and total cell spectral efficiency.

Keywords: LTE, multimedia flows, scheduling algorithms, mobile computing

Procedia PDF Downloads 382

Authors: Sahar Sohrabi

Abstract:

The emergence of Cloud data centers has revolutionized the IT industry. Private Clouds in specific provide Cloud services for certain group of customers/businesses. In a real-time private Cloud each task that is given to the system has a deadline that desirably should not be violated. Scheduling tasks in a real-time private CLoud determine the way available resources in the system are shared among incoming tasks. The aim of the scheduling policy is to optimize the system outcome which for a real-time private Cloud can include: energy consumption, deadline violation, execution time and the number of host switches. Different scheduling policies can be used for scheduling. Each lead to a sub-optimal outcome in a certain settings of the system. A Bayesian Scheduling strategy is proposed for scheduling to further improve the system outcome. The Bayesian strategy showed to outperform all selected policies. It also has the flexibility in dealing with complex pattern of incoming task and has the ability to adapt.

Keywords: cloud computing, scheduling, real-time private cloud, bayesian

Procedia PDF Downloads 358

Authors: Yu Zhao, Mengqin Sun, Yahui Zhang

Abstract:

Apparel products (or apparel) with the sense of aesthetics, usability (ergonomics) and function are fundamental and varied in people’s daily life. The numerous apparel thus produced by apparel industry, have been triggered many issues, such as the waste of sources and the environmental pollutions. In this study, a hybrid architecture called modular architecture of apparel (MAA) has been proposed to deal with the variety of apparel, and thus to overcome the aforementioned issues. Generally, the establishment of MAA takes advantage of the modular design of a general product that a product is assembled with many modules through their modular interface connector. The development of MAA is to first analyze the structure of apparel in terms of the necessity to form an apparel and the aesthetics, ergonomics, and function of apparel; then to divide apparel into many segments (or module in product design) based on the structure of apparel; to develop modular interfaces and modular interface connectors in terms of the features of apparel’s modules. It is noted that in the general product design, modules of a product are only about the function and ergonomics, but in MAA, the module of aesthetics is developed. Further, an apparel design with employing the MAA is carried out to validate its usefulness and efficiency. There are three contributions out of this study, the first is to overcome the aforementioned issues (i.e. waste of source and environmental pollutions); the second is the improvement of the modular design for product by considering aesthetics; the third is to add the value in realizing the personalized mass production of apparel in the near future.

Keywords: apparel, architecture, modular design, segment

Procedia PDF Downloads 283

Authors: Jongho Park, Ui-Cheol Shin, Jinwoong Choi, Sungnam Hong, Sun-Kyu Park

Abstract:

While the numerous structures built the industrialization are aging, the effort for the maintenance is concentrated in many countries. However, the traffic jam, environmental damage, and enormous maintenance cost, and etc become a problem. So, in order to solve this, the modular bridge has been studied. This bridge is the structure which utilizes and assembles the standard precast member. Through this, the substitution of the existing bridge and advantage of the easy maintenance will be achieved. However, the reliability in the long-term behavior is insufficient due to the junction part between modular precast members. Therefore, in this research, the cyclic load loading experiment was performed on the junction and deflection was analyzed by long-term service in modular slab connection. The deflection of modular slab with junction was mostly generated when initial and final test.

Keywords: modular bridge, deflection, cyclic loading, junction

Procedia PDF Downloads 510

Authors: Benjamin Goldsmith, Felix Heisel

Abstract:

The building industry must reduce its emissions in order to meet 2030 neutrality targets, and modular and/or offsite construction is seen as an alternative to conventional construction methods which could help achieve this goal. Modular construction has previously been shown to be less wasteful and has a lower global warming potential (GWP). While many studies have been conducted investigating the life cycle impacts of modular and conventional construction, few studies have compared different types of modular assembly and construction in order to determine which offer the greatest environmental benefits over their whole life cycle. This study seeks to investigate three different modular construction types -infill frame, core, and podium- in order to determine environmental impacts such as GWP as well as circularity indicators. The study will focus on the emissions of the production, construction, and end-of-life phases. The circularity of the various approaches will be taken into consideration in order to acknowledge the potential benefits of the ability to reuse and/or reclaim materials, products, and assemblies. The study will conduct hypothetical case studies for the three different modular construction types, and in doing so, control the parameters of location, climate, program, and client. By looking in-depth at the GWP of the beginning and end phases of various simulated modular buildings, it will be possible to make suggestions on which type of construction has the lowest global warming potential.

Keywords: modular construction, offsite construction, life cycle analysis, global warming potential, environmental impact, circular economy

Procedia PDF Downloads 165

Authors: Kyung-Suk Choi, Hyung-Joon Kim

Abstract:

Modular structural systems are constructed using a method that they are assembled with prefabricated unit modular frames on-site. This provides a benefit that can significantly reduce building construction time. Their structural design is usually carried out under the assumption that the load-carrying mechanism is similar to that of a traditional steel moment-resisting system. However, both systems are different in terms of beam-column connection details which may strongly influence the lateral structural behavior. Specially, the presence of access holes in a beam-column joint of a unit modular frame could cause undesirable failure during strong earthquakes. Therefore, this study carried out finite element analyses (FEM) of unit modular frames to investigate the cyclic behavior of beam-column joints with the structural influence of access holes. Analysis results show that the unit modular frames present stable cyclic response with large deformation capacities, and their joints are classified into semi-rigid connections.

Keywords: unit modular frame, steel moment connection, nonlinear analytical model, moment-rotation relation

Procedia PDF Downloads 616

Authors: Mohsen Ziaee

Abstract:

Almost all existing researches on the flowshop scheduling problems focus on the permutation schedules and there is insufficient study dedicated to the general flowshop scheduling problems in the literature, since the modeling and solving of the general flowshop scheduling problems are more difficult than the permutation ones, especially for the large-size problem instances. This paper considers the general flowshop scheduling problem with the objective function of the makespan (F//Cmax). We first find the optimal solution of the problem by solving a mixed integer linear programming model. An efficient heuristic method is then presented to solve the problem. An ant colony optimization algorithm is also proposed for the problem. In order to evaluate the performance of the methods, computational experiments are designed and performed. Numerical results show that the heuristic algorithm can result in reasonable solutions with low computational effort and even achieve optimal solutions in some cases.

Keywords: scheduling, general flow shop scheduling problem, makespan, heuristic

Procedia PDF Downloads 206

Authors: Tabrej Khan

Abstract:

Examination Scheduling System (ESS) is a scheduling system that targets as an exam committee in any academic institute to help them in managing the exams automatically. We present an algorithm for Examination Scheduling System. Nowadays, many universities have challenges with creating examination schedule fast with less confliction compared to hand works. Our aims are to develop a computerized system that can be used in examination scheduling in an academic institute versus available resources (Time, Hall, Invigilator and instructor) with no contradiction and achieve fairness among students. ESS was developed using HTML, C# language, Crystal Report and ASP.NET through Microsoft Visual Studio 2010 as developing tools with integrated SQL server database. This application can produce some benefits such as reducing the time spent in creating an exam schedule and achieving fairness among students

Keywords: examination scheduling system (ESS), algorithm, ASP.NET, crystal report

Procedia PDF Downloads 403

Authors: Hong Kai, Zhong Jun Jie, Chen Lin Qi, Wang Chen Guang

Abstract:

There are inefficient global scheduling parallelism and local scheduling parallelism prone to processor starvation in current scheduling algorithms. Regarding this issue, this paper proposed a load-aware queue partitioning scheduling strategy by first allocating the queues according to the number of processor cores, calculating the load factor to specify the load queue capacity, and it assigned the awaiting nodes to the appropriate perceptual queues through the precursor nodes and the communication computation overhead. At the same time, real-time computation of the load factor could effectively prevent the processor from being starved for a long time. Experimental comparison with two classical algorithms shows that there is a certain improvement in both performance metrics of scheduling length and task speedup ratio.

Keywords: load-aware, scheduling algorithm, perceptual queue, heterogeneous multi-core

Procedia PDF Downloads 144

Authors: Te-Jen Chang, Ping-Sheng Huang, Shan-Ten Cheng, Chih-Lin Lin, I-Hui Pan, Tsung- Hsien Lin

Abstract:

RSA system is a great contribution for the encryption and the decryption. It is based on the modular exponentiation. We call this system as “a large of numbers for calculation”. The operation of a large of numbers is a very heavy burden for CPU. For increasing the computational speed, in addition to improve these algorithms, such as the binary method, the sliding window method, the addition chain method, and so on, the cluster computer can be used to advance computational speed. The cluster system is composed of the computers which are installed the MPICH2 in laboratory. The parallel procedures of the modular exponentiation can be processed by combining the sliding window method with the addition chain method. It will significantly reduce the computational time of the modular exponentiation whose digits are more than 512 bits and even more than 1024 bits.

Keywords: cluster system, modular exponentiation, sliding window, addition chain

Procedia PDF Downloads 520

Authors: Jongho Park, Jinwoong Choi, Sungnam Hong, Seung-Kyung Kye, Sun-Kyu Park

Abstract:

Recently, to cope with the rapidly changing construction trend because of aging infrastructures, modular bridge technology has been studied actively. Modular bridge is easily constructed by assembling standardized precast structure members in the field. It will be possible to construct rapidly and reduce construction cost efficiently. However, the shape examination of the transverse connection of T-type girder newly developed between the segmented modules is not performed. Therefore, the investigation of the connection shape is needed. In this study, shape of the modular T-girder bridge transverse connection was analyzed by finite element model that was verified in study which was verification of model for transverse connection using Abaqus. Connection angle was chosen as the parameter. The result of analyses showed that optimal value of angle is 130 degree.

Keywords: modular bridge, optimal transverse shape, parameter, FEM

Procedia PDF Downloads 649

Authors: Majid Khalili, Hamed Tayebi

Abstract:

This paper considers a stochastic flexible job-shop scheduling (SFJSS) problem in the presence of production disruptions, and reactive scheduling is implemented in order to find the optimal solution under uncertainty. In this problem, there are two main disruptions including machine failure which influences operation time, and modification or cancellation of the order delivery date during production. In order to decrease the negative effects of these difficulties, two derived strategies from reactive scheduling are used; the first one is relevant to being able to allocate multiple machine to each job, and the other one is related to being able to select the best alternative process from other job while some disruptions would be created in the processes of a job. For this purpose, a Mixed Integer Linear Programming model is proposed.

Keywords: flexible job-shop scheduling, reactive scheduling, stochastic environment, mixed integer linear programming

Procedia PDF Downloads 359

Authors: Roshanak Khodabakhsh Jolfaei, Javad Akbari Torkestani

Abstract:

As a cooperative environment for problem-solving, it is necessary that grids develop efficient job scheduling patterns with regard to their goals, domains and structure. Since the Grid environments facilitate distributed calculations, job scheduling appears in the form of a critical problem for the management of Grid sources that influences severely on the efficiency for the whole Grid environment. Due to the existence of some specifications such as sources dynamicity and conditions of the network in Grid, some algorithm should be presented to be adjustable and scalable with increasing the network growth. For this purpose, in this paper a job scheduling algorithm has been presented on the basis of learning automata in computational Grid which the performance of its results were compared with FPSO algorithm (Fuzzy Particle Swarm Optimization algorithm) and GJS algorithm (Grid Job Scheduling algorithm). The obtained numerical results indicated the superiority of suggested algorithm in comparison with FPSO and GJS. In addition, the obtained results classified FPSO and GJS in the second and third position respectively after the mentioned algorithm.

Keywords: computational grid, job scheduling, learning automata, dynamic scheduling

Procedia PDF Downloads 342

Authors: M. Ndeley

Abstract:

The performance of global manufacturing supply chains depends on the interaction of production and transport processes. Currently, the scheduling of these processes is done separately without considering mutual requirements, which leads to no optimal solutions. An integrated scheduling of both processes enables the improvement of supply chain performance. The integrated production and transport scheduling problem (PTSP) is NP-hard, so that heuristic methods are necessary to efficiently solve large problem instances as in the case of global manufacturing supply chains. This paper presents a heuristic scheduling approach which handles the integration of flexible production processes with intermodal transport, incorporating flexible land transport. The method is based on a graph that allows a reformulation of the PTSP as a shortest path problem for each job, which can be solved in polynomial time. The proposed method is applied to a supply chain scenario with a manufacturing facility in South Africa and shipments of finished product to customers within the Country. The obtained results show that the approach is suitable for the scheduling of large-scale problems and can be flexibly adapted to different scenarios.

Keywords: production and transport scheduling problem, graph based scheduling, integrated scheduling

Procedia PDF Downloads 473

Authors: Midhun Paul, T. Radha Ramanan

Abstract:

The objective of this work is to present a state-of-the-art literature review highlighting the challenges in the research of the scheduling of assembly job shop problem and providing an insight on how the future directions of the research would be. The number of work has been substantial that it requires a review to enable one to understand the origin of the research and how it is getting evolved. This review paper presents a comprehensive review of the literature dealing with various studies carried on assembly job shop scheduling. The review details the evolution of the AJS from the perspective of other scheduling problems and also presents a classification scheme. The work also identifies the potential directions for future research, which we believe to be worthwhile considering.

Keywords: assembly job shop, future directions, manufacturing, scheduling

Procedia PDF Downloads 411

Authors: Yulong Jia, Xiang Zhang, Ziyuan Wu, Shiji Hu

Abstract:

The calculation of bilinear pairing is the core of the SM9 algorithm, which relies on the underlying prime domain algorithm and the quadratic extension domain algorithm. Among the field algorithms, modular multiplication operation is the most time-consuming part. Therefore, the underlying modular multiplication algorithm is optimized to maximize the operation speed of bilinear pairings. This paper uses a modular multiplication method based on non-least positive (NLP) combined with Karatsuba and schoolbook multiplication to improve the Montgomery algorithm. At the same time, according to the characteristics of multiplication operation in the quadratic extension domain, a quadratic extension domain FP2-NLP modular multiplication algorithm for bilinear pairings is proposed, which effectively reduces the operation time of modular multiplication in the quadratic extension domain. The sub-expanded domain Fp₂ -NLP modular multiplication algorithm effectively reduces the operation time of modular multiplication under the second-expanded domain. The multiplication unit in the quadratic extension domain is implemented using SMIC55nm process, and two different implementation architectures are designed to cope with different application scenarios. Compared with the existing related literature, The output latency of this design can reach a minimum of 15 cycles. The shortest time for calculating the (AB+CD)r⁻¹ mod form is 37.5ns, and the comprehensive area-time product (AT) is 11400. The final R-ate pairing algorithm hardware accelerator consumes 2670k equivalent logic gates and 1.8ms computing time in 55nm process.

Keywords: sm9, hardware, NLP, Montgomery

Procedia PDF Downloads 0