Wyszukiwarka
Wyniki wyszukiwania dla: SCHEDULER
-
SDL i prosty scheduler - zastosowania.
PublikacjaRozdział przedstawia uzupełnienia, usprawnienia i zastosowania prostego schedulera zaproponowanego w [1]. Podstawowym uzupełnieniem jest powiązanie funkcji schedulera z językiem specyfikacji protokołów telekomunikacyjnych SDL [2]. Pokazano na czym polega problem w odmierzaniu czasu w ''procesach'' obsługiwanych przez scheduler oraz istotne ograniczenia mechanizmu odmierzania czasu w systemach warstwowych. Zaproponowano rozwiązania...
-
Volunteer Computing System Comcute with Smart Scheduler
PublikacjaIn this paper, a volunteer grid called Comcute is studied. Moreover, the harmony search scheduler is proposed. This scheduler has been designed for efficient using some resources of volunteer grid. The harmony search scheduler optimizes both a workload of a bottleneck computer and the cost of grid. Finally, some experiment outcomes have been discussed.
-
REALIZACJA APLIKACJI SCHEDULER DLA STEROWANIA SIECIĄ TRANSPORTOWĄ
PublikacjaW artykule przedstawiono wykorzystanie koncepcji SDN z protokołem OpenFlow do sterowania siecią transportową z komutacją pakietów. W tym celu zrealizowana została aplikacja sterująca połączeniami w sieci telekomunikacyjnej. Podstawą jej działania jest planowany przez administratora sieci harmonogram połączeń, zawierający wszystkie niezbędne parametry konieczne dla przeprowadzenia sterowania.
-
Performance analysis and optimization of the MAC-d scheduler in UMTS.
PublikacjaArtykuł prezentuje wyniki analizy efektywności pracy schedulera obsługującego dedykowane kanały logiczne podwarstwy MAC-d systemu UMTS. Zbadano wpływ różnych opcji konfiguracyjnych, parametrów i dyscyplin obsługi implementowanych w podwarstwie MAC. Dokonano weryfikacji symulacyjnej. W oparciu o uzyskane wyniki zaproponowano optymalną konfigurację schedulera MAC-d oraz zasady multipleksji kanałów logicznych i selekcji TFC.
-
An efficient algorithm for finding ideal schedules
PublikacjaPodejmujemy problem szeregowania zadań jednostkowych z zadanymi czasamy przybycia i zależnościami kolejnościowymi. Uszeregowanie jest idealne jeśli jednocześnie minimalizuje maksymalny oraz średni czas zakończenia zadania. Podajemy przyklad pokazujący, że uszeregowania idealne nie istnieją dla relacji zależności zadań będącej drzewem, gdy dopuścimy możliwość wystąpienia przerwań. Z drugiej strony podajemy algorytm o złożoności...
-
Elimination of dominated partial schedules in scheduling deteriorating jobs
Publikacjaw artykule rozważany jest problem szeregowania zadań uwarunkowanych czasowo, w notacji trójpolowej opisywany przez 1 | pi = a + bisi | ?ci. wprowadzona jest koncepcja zdominowanych częściowych harmonogramów oraz przedstawiony jest niewielomianowy algorytm dla problemu, który bazuje na eliminacji zdominowanych częściowych harmonogramów. przedstawione są wyniki eksperymentów obliczeniowych, porównujących zaprezentowany algorytm oraz...
-
Integrating SHECS-based critical sections with hardware SMP scheduler in TLP-CMPs
PublikacjaArtykuł prezentuje koncepcje zintegrowania sekcji krytycznych opartych o układ SHECS (współdzielony jawny cache system) ze sprzętowym menadżerem zadań SMP w zintegrowanych architekturach wieloprocesorowych z wielowątkowością sprzętową (TLP-CMPs). Przedstawione jest porównanie wydajności zintegrowania sekcji krytycznych SHECS z programowym menadżerem zadań SMP względem użycia sprzętowego menadżera zadań SMP. Środowiskiem wykonania...
-
Big Data Paradigm Developed in Volunteer Grid System with Genetic Programming Scheduler
PublikacjaArtificial intelligence techniques are capable to handle a large amount of information collected over the web. In this paper, big data paradigm has been studied in volunteer and grid system called Comcute that is optimized by a genetic programming scheduler. This scheduler can optimize load balancing and resource cost. Genetic programming optimizer has been applied for finding the Pareto solu-tions. Finally, some results from numerical...
-
Linux scheduler improvement for time demanding network applications, running on Communication Platform Systems
PublikacjaCommunication Platform Systems as ex. ATCA standard blades located in standardized chassis provides high level communication services between system peripherals. Each ATCA blade brings dedicated functionality to the system but can as well exist as separated host responsible for servicing set of task. According to platform philosophy these parts of system can be quite independent against another solutions provided by competitors....
-
Fuzzy decision support system for the control of budget and schedule in SPM
PublikacjaObiektem rozważań jest komputerowy system wspierania decyzji kierowniczych w zakresie zarządzania budżetem i harmonogramem przy realizacji projektów informatycznych. Omawiany system opary jest na dynamicznych modelach rozmytych podlegających bieżącemu dostrajaniu na podstawie danych z obserwacji zarządzanego procesu. Wstępny projekt modeli rozmytych oparty został na danych zarządczych pochodzących z realizacji dwu projektów informatycznych....
-
Modelling of network schedule including priority of selected technical resources
PublikacjaThe paper presents a method of network planning CPM – Critical Path Method. The author compares models of optimal solutions to design deadlines for individual works, taking various leading technical resources such as is labor and a tower crane into account.
-
Practical Approach to IP Scheduled Throughput Measurements in Dual Connectivity Systems
PublikacjaIP scheduled throughput defined according to 3GPP TS 36.314 reflects user throughput regardless of traffic characteristics, and therefore has become one of the most important indicators for monitoring Quality of Service (QoS) of the end user in Evolved Universal Terrestrial Radio Access Network (E-UTRAN). However, networks built on a distributed architecture make the above definition impossible to be applied directly due to the...
-
Partial dominated schedules and minimizing the total completion time of deteriorating jobs
PublikacjaA problem of scheduling deteriorating jobs on a single processor is considered. The processing time of a job is given by a function pi=ai+bisi, where si is the starting time of the job, ai>=0, bi>=0, for i=1,...,n. Jobs are non-preemptive and independent and there are neither ready times nor deadlines. The goal is to minimize the total weighted completion time. We show how to employ the concept of non-dominated schedules to construct...
-
Optimization of Train Energy Cooperation Using Scheduled Service Time Reserve
PublikacjaThe main aim of the paper was to develop an innovative approach to the preliminary estimation possibility of train energy cooperation based on data from timetables, without traction calculations. The article points out the need to strive for sustainable and environmentally friendly transport. It was pointed out that rail transport using electric traction is one of the more ecological branches of transport. It also offers a number...
-
Influence of YARN Schedulers on Power Consumption and Processing Time for Various Big Data Benchmarks
PublikacjaClimate change caused by human activities can influence the lives of everybody onthe planet. The environmental concerns must be taken into consideration by all fields of studyincludingICT. Green Computing aims to reduce negative effects of IT on the environment while,at the same time, maintaining all of the possible benefits it provides. Several Big Data platformslike Apache Spark orYARNhave become widely used in analytics and...
-
Inter-rater reliability of the Brief Psychiatric Rating Scale and the Groningen Social Disabilities Schedule in a European multi-site randomized controlled trial on the effectiveness of acute psychiatric day hospitals
Publikacja -
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines
PublikacjaIn this paper we consider a problem of job scheduling on parallel machines with a presence of incompatibilities between jobs. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. Our research stems from the works of Bodlaender, Jansen, and Woeginger (1994) and Bodlaender and Jansen (1993). In particular, we pursue the...
-
System load impact on VRRP advertisements delay
PublikacjaThe aim of the paper is to show how system load can affect network tasks (especially VRRP advertising depending on factors such as kernel schedu-ler [3] version, kernel settings and load priority. Two versions of the Linux kernel will be used: 2.6.22 (with "O(1) scheduler) and 2.6.23 (with "CFS" scheduler). "vrrpd" version 0.4 is used as an VRRP protocol implementation.
-
Comparison of selected algorithms for scheduling workflow applications with dynamically changing service availability
PublikacjaThis paper compares the quality and execution times of several algorithms for scheduling service based workflow applications with changeable service availability and parameters. A workflow is defined as an acyclic directed graph with nodes corresponding to tasks and edges to dependencies between tasks. For each task, one out of several available services needs to be chosen and scheduled to minimize the workflow execution time and...
-
The influence of the drying process on the deformation of the beech and oak wood samples
PublikacjaThe influence of the drying process conditions on the deformation of the beech and oak wood. The results of the deformation of beech wood (Fagus sylvatica L.) and oak wood (Quercus robur) after drying process are presented. The drying process was carried out in the same drying schedule for each wood species. During each of schedules 40 pieces of wood were dried. The samples were divided into two groups. The first group of tested...
-
Genetic Programming for Interaction Efficient Supporting in Volunteer Computing Systems
PublikacjaVolunteer computing systems provide a middleware for interaction between project owners and great number volunteers. In this chapter, a genetic programming paradigm has been proposed to a multi-objective scheduler design for efficient using some resources of volunteer computers via the web. In a studied problem, genetic scheduler can optimize both a workload of a bottleneck computer and cost of system. Genetic programming has been...
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines: Complexity and Algorithms
PublikacjaIn this paper, the problem of scheduling on parallel machines with a presence of incompatibilities between jobs is considered. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. The paper provides several results concerning schedules, optimal or approximate with respect to the two most popular criteria of optimality:...
-
Scheduling on Uniform and Unrelated Machines with Bipartite Incompatibility Graphs
PublikacjaThe problem of scheduling jobs on parallel machines under an incompatibility relation is considered in this paper. In this model, a binary relation between jobs is given and no two jobs that are in the relation can be scheduled on the same machine. We consider job scheduling under the incompatibility relation modeled by a bipartite graph, under the makespan optimality criterion, on uniform and unrelated machines. Unrelated machines...
-
Jan Daciuk dr hab. inż.
OsobyJan Daciuk uzyskał tytuł zawodowy magistra na Wydziale Elektroniki Politechniki Gdańskiej w 1986 roku, a doktorat na wydziale Elektroniki, Telekomunikacji i Informatyki PG w 1999. Pracuje na Wydziale od 1988 roku. Jego zainteresowania naukowe obejmują zastosowania automatów skończonych w przetwarzaniu języka naturalnego i przetwarzaniu mowy. Spędził ponad cztery lata w europejskich uniwersytetach i instytutach naukowych, takich...
-
Machine Learning Assisted Interactive Multi-objectives Optimization Framework: A Proposed Formulation and Method for Overtime Planning in Software Development Projects
PublikacjaMachine Learning Assisted Interactive Multi-objectives Optimization Framework: A Proposed Formulation and Method for Overtime Planning in Software Development Projects Hammed A. Mojeed & Rafal Szlapczynski Conference paper First Online: 14 September 2023 161 Accesses Part of the Lecture Notes in Computer Science book series (LNAI,volume 14125) Abstract Software development project requires proper planning to mitigate risk and...
-
Scheduling jobs to contain a natural disaster: a model and complexity
Publikacjathis paper is devoted to the problem of scheduling suppression units so that a natural disaster is dealt with as efficient as possible. the concept of deteriorating jobs is adopted, that is, the formal model of scheduling represents linearly increasing value loss as the disaster remains unsuppressed and increasing time for its suppression. more precisely, two different goals are considered: finding a suppression schedule of minimal...
-
Shared multi-processor scheduling
PublikacjaWe study shared multi-processor scheduling problem where each job can be executed on its private processor and simultaneously on one of many processors shared by all jobs in order to reduce the job’s completion time due to processing time overlap. The total weighted overlap of all jobs is to be maximized. The problem models subcontracting scheduling in supply chains and divisible load scheduling in computing. We show that synchronized...
-
Restricted open shop scheduling
PublikacjaIn the real applications the open shop scheduling models often require some additional constraints and adequate models. We concern the restrictions in the open shop scheduling related to an instance of the problem and to a feasible solution. Precisely, we require that each jobs consists of the bounded number of operations and each machine has a bounded load (i.e., the total number of operations executed on this machine in a schedule)....
-
The Optical Transport Network Control Based on SDN Architecture
PublikacjaThe aim of this publication is to present research results on the usability of the Software-Defined Networking concept to control transport networks. For this purpose, an easy-to-use connection scheduler was developed capable of controlling connections in optical transport networks. The authors would like to present this solution and details of constructed SDN architecture implemented for modern optical transport solutions based...
-
Optimization of the efficiency of braking energy recovery in rail transport by changing arrival time
PublikacjaThe article refers to the previous work of the authors, in which the model of traffic organization of cooperating trains including the optimization of the use of energy returned to the catenary was presented. In the presented article, the model was modified by changing the main control variable, which affects the efficient use of energy. Departure time was changed for the arrival time of the train to the stop or station. The optimization...
-
Miasto nocą: zaburzenia snu a praca zmianowa i stres zawodowy wśród policjantów
PublikacjaStreszczenie. Jedną z miar subiektywnej jakości życia jest dobry sen. Cebulowa teoria szczęścia postuluje zależność pomiędzy dobrostanami cząstkowymi. Celem studium była ocena zaburzeń snu wśród policjantów z miejskich komisariatów Policji w zależności od cech pracy (stres zawodowy) i jej organizacji (zmianowość). Rezultaty pokazały, że większe problemy ze snem mieli policjanci pracujący wyłącznie na zmianach dziennych niż pracujący...
-
Mobile Activity Plan Applications for Behavioral Therapy of Autistic Children
PublikacjaThis paper concerns technological support for behavioral therapy of autistic children. A family of tools dedicated for mobile devices is presented, that allows to design and perform an activity schedule in behavioral therapy. The paper describes the main challenges, that were encountered, especially in meeting the non-functional requirements of the application: simplicity, repeatability, robustness, personalization, re-usability...
-
Scheduling for Industrial Control Traffic Using Massive MIMO and Large Intelligent Surfaces
PublikacjaIndustry 4.0, with its focus on flexibility and customizability, is pushing in the direction of wireless communication in future smart factories, in particular massive multiple-input multiple-output (MIMO), and its future evolution Large Intelligent Surfaces (LIS), which provide more reliable channel quality than previous technologies. As such, there arises the need to perform efficient scheduling of industrial control traffic...
-
Data Plane Performance Issues Concerning MBMS in UMTS Release 6
PublikacjaPrzedstawiono funkcjonowanie mechanizmu MBMS w wersji 6 systemu UMTS. MBMS, będący następcą mechanizmu CBS funkcjonującego w sieciach 2G i 2.5G, umożliwia efektywne rozgłaszanie danych o wysokich wymaganiach na pasmo oraz jakość usług (QoS), takich jak danych multimedialnych. W artykule przedyskutowano możliwość zapewnienia odpowiedniego poziomu QoS przez MBMS oraz zaproponowano nowy, dwuetapowy scheduler w warstwie MAC-c/sh/m,...
-
Techno-economic evaluation of combined cycle gas turbine and a diabatic compressed air energy storage integration concept
PublikacjaMore and more operational flexibility is required from conventional power plants due to the increasing share of weather-dependent renewable energy sources (RES) generation in the power system. One way to increase power plant’s flexibility is integrating it with energy storage. The energy storage facility can be used to minimize ramping or shutdowns and therefore should lower overall generating costs and CO2 emissions. In this article,...
-
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
PublikacjaWe consider the problem of scheduling n identical jobs on 3 uniform machines with speeds s1, s2, and s3 to minimize the schedule length. We assume that jobs are subject to some kind of mutual exclusion constraints, modeled by a cubic incompatibility graph. We how that if the graph is 2-chromatic then the problem can be solved in O(n^2) time. If the graph is 3-chromatic, the problem becomes NP-hard even if s1>s2=s3.
-
Construction Management, WILIS, Civil Engineering, sem. I, 2022/2023
Kursy OnlineTechniques and methods of organization and planning in construction projects - review. Analysis of construction schedule. Ms Project as a construction planning tool.
-
Construction Management, WILIS, Civil Engineering, sem. I, 2023/2024
Kursy OnlineTechniques and methods of organization and planning in construction projects - review. Analysis of construction schedule. Ms Project as a construction planning tool.
-
Shared processor scheduling of multiprocessor jobs
PublikacjaWe study a problem of shared processor scheduling of multiprocessor weighted jobs. Each job can be executed on its private processor and simultaneously on possibly many processors shared by all jobs. This simultaneous execution reduces their completion times due to the processing time overlap. Each of the m shared processors may charge a different fee but otherwise the processors are identical. The goal is to maximize the total...
-
Optymalizacja efektywności hamowania odzyskowego w transporcie szynowym przez sterowanie czasem przyjazdu na stację
PublikacjaArtykuł nawiązuje do poprzednich prac autorów, w których przedstawiono model organizacji ruchu kooperujących pociągów z uwzględnieniem optymalizacji wykorzystania energii zwracanej do sieci jezdnej. W przedstawionej pracy zmodyfikowano model zmieniając główną zmienną sterującą, mającą wpływ na efektywne wykorzystanie energii, z czasu odjazdu na czas przyjazdu pociągu na stację lub przystanek. Optymalizacja dokonywana jest przez...
-
Computational intelligence methods in production management
PublikacjaThis chapter presents a survey of selected computational intelligence methods used in production management. This group of methods includes, among others, approaches based on the artificial neural networks, the evolutionary algorithms, the fuzzy logic systems and the particle swarm optimization mechanisms. From the abovementioned methods particularly noteworthy are the evolutionary and the particle swarm algorithms, which are successfully...
-
Evaluating Performance and Accuracy Improvements for Attention-OCR
PublikacjaIn this paper we evaluated a set of potential improvements to the successful Attention-OCR architecture, designed to predict multiline text from unconstrained scenes in real-world images. We investigated the impact of several optimizations on model’s accuracy, including employing dynamic RNNs (Recurrent Neural Networks), scheduled sampling, BiLSTM (Bidirectional Long Short-Term Memory) and a modified attention model. BiLSTM was...
-
O symbolicznej pregnancji
PublikacjaThe aim of the article is to introduce and demonstrate the specificity of Cassirer ̓s concept of symbolic pregnancy. This concept is considered by many scholars to be the most important, root concept of his entire philosophy of symbolic forms. It constitutes the originality of his phenomenology in comparison with that of Husserl, Brentano, Scheler or Heidegger.
-
“Project-factor-decision”. Decisive factors in IT projects and their impact on its success
PublikacjaThe aim of this article is to indicate the need for a deepening, systematizing and codifying of the theoretical and practical knowledge on IT project management, in the area of management decision-making processes. The scope of decisions made by managers is constantly on the increase. Project managers make decisions not only within the classic triangle of constraints, which consists of a schedule, a budget and the project scope,...
-
The Pomerania Design Faktory as an Example of 50+ Entrepreneurship Promotion
PublikacjaThe article presents one of the programmes carried out by The Gdańsk Entrepreneurs' Foundation and The Gdansk Labor Office in 2013/14, dedicated to seniors. It is a great example of an innovative project aimed at the activation of individuals aged 50+ by using their own talents and interests in business. It also shows the results of intergenerational cooperation because the trainers — especially the designers — were much younger...
-
Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines
PublikacjaThe problem of scheduling n identical jobs on 4 uniform machines with speeds s1>=s2>=s3>=s4 is considered.The aim is to find a schedule with minimum possible length. We assume that jobs are subject to mutual exclusion constraints modeled by a bipartite incompatibility graph of degree delta. We show that the general problem is NP-hard even if s1=s2=s3. If, however, delta<5 and s1>12s2 s2=s3=s4, then the problem can be solved to...
-
The project of pull system for storehouse and production line in a company provides electronics
PublikacjaThe chapter below presents how to reduced delivery of the material to production by using a "Kanban schedule board" and related tools from 48 hours and 59 minutes to 41 minutes in a company provides electronics. The solution was found through analysis of the current way of supplying stands and using Just In Time idea, the reduction of ''muda''. To solve the problem was used Kanban card", which has the shape of two triangles joined...
-
ANALYSIS OF THE INCREASE OF CONSTRUCTION COSTS IN URBAN REGENERATION PROJECTS
PublikacjaThe subject of this paper is the analysis and evaluation of the reasons for construction costs increases in urban regeneration projects. The analysis considers major refurbishments of real estates’, as well as heavy repair and modernization of the road system. For the period mentioned, the costs from works and expenditure schedules were compared with the costs of additional works, which shows the percentage cost increase in relation...
-
Scheduling of identical jobs with bipartite incompatibility graphs on uniform machines. Computational experiments
PublikacjaWe consider the problem of scheduling unit-length jobs on three or four uniform parallel machines to minimize the schedule length or total completion time. We assume that the jobs are subject to some types of mutual exclusion constraints, modeled by a bipartite graph of a bounded degree. The edges of the graph correspond to the pairs of jobs that cannot be processed on the same machine. Although the problem is generally NP-hard,...
-
Elżbieta Marczak dr inż. arch.
OsobyElżbieta Marczak (dr inż. arch.) - adiunkt na Wydziale Architektury Politechniki Gdańskiej, zatrudniona Katedrze Architektury Miejskiej i Przestrzeni Nadwodnych (dawniej Katedra Architektury Morskiej i Przemysłowej, od roku 1997). Studia na Wydziale Architektury PG ukończyła w roku 1995. Stopień naukowy doktora uzyskała w 2006 r. przedstawiając pracę p.t. Architektura statków na tle rozwoju transportu morskiego. Jej badania naukowe...