Wyszukiwarka
Filtry
wszystkich: 3845
-
Katalog
- Publikacje 3153 wyników po odfiltrowaniu
- Czasopisma 195 wyników po odfiltrowaniu
- Konferencje 7 wyników po odfiltrowaniu
- Osoby 112 wyników po odfiltrowaniu
- Projekty 18 wyników po odfiltrowaniu
- Kursy Online 178 wyników po odfiltrowaniu
- Wydarzenia 6 wyników po odfiltrowaniu
- Dane Badawcze 176 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: energy-aware scheduling
-
Energy-Aware Scheduling for High-Performance Computing Systems: A Survey
PublikacjaHigh-performance computing (HPC), according to its name, is traditionally oriented toward performance, especially the execution time and scalability of the computations. However, due to the high cost and environmental issues, energy consumption has already become a very important factor that needs to be considered. The paper presents a survey of energy-aware scheduling methods used in a modern HPC environment, starting with the...
-
Energy-Aware High-Performance Computing: Survey of State-of-the-Art Tools, Techniques, and Environments
PublikacjaThe paper presents state of the art of energy-aware high-performance computing (HPC), in particular identification and classification of approaches by system and device types, optimization metrics, and energy/power control methods. System types include single device, clusters, grids, and clouds while considered device types include CPUs, GPUs, multiprocessor, and hybrid systems. Optimization goals include various combinations of...
-
Performance/energy aware optimization of parallel applications on GPUs under power capping
PublikacjaIn the paper we present an approach and results from application of the modern power capping mechanism available for NVIDIA GPUs to the bench- marks such as NAS Parallel Benchmarks BT, SP and LU as well as cublasgemm- benchmark which are widely used for assessment of high performance computing systems’ performance. Specifically, depending on the benchmarks, various power cap configurations are best for desired trade-off of performance...
-
Performance and Energy Aware Training of a Deep Neural Network in a Multi-GPU Environment with Power Capping
PublikacjaIn this paper we demonstrate that it is possible to obtain considerable improvement of performance and energy aware metrics for training of deep neural networks using a modern parallel multi-GPU system, by enforcing selected, non-default power caps on the GPUs. We measure the power and energy consumption of the whole node using a professional, certified hardware power meter. For a high performance workstation with 8 GPUs, we were...
-
Network-aware Data Prefetching Optimization of Computations in a Heterogeneous HPC Framework
PublikacjaRapid development of diverse computer architectures and hardware accelerators caused that designing parallel systems faces new problems resulting from their heterogeneity. Our implementation of a parallel system called KernelHive allows to efficiently run applications in a heterogeneous environment consisting of multiple collections of nodes with different types of computing devices. The execution engine of the system is open for...
-
Józef Woźniak prof. dr hab. inż.
OsobyProf. dr hab. inż. Józef Woźniak prof. zw. Politechniki Gdańskiej ukończył studia na Wydziale Elektroniki Politechniki Gdańskiej w 1971 r. W 1976 r. uzyskał stopień doktora nauk technicznych, a w 1991 r. stopień doktora habilitowanego w dyscyplinie telekomunikacja i specjalności teleinformatyka. W styczniu roku 2002 otrzymał tytuł profesora nauk technicznych. W 1994 r. został mianowany na stanowisko profesora nadzwyczajnego w Politechnice...
-
Shared processor scheduling
PublikacjaWe study the shared processor scheduling problem with a single shared processor to maximize total weighted overlap, where an overlap for a job is the amount of time it is processed on its private and shared processor in parallel. A polynomial-time optimization algorithm has been given for the problem with equal weights in the literature. This paper extends that result by showing an (log)-time optimization algorithm for a class...
-
ENERGY
Czasopisma -
Normal-form preemption sequences for an open problem in scheduling theory
PublikacjaStructural properties of optimal preemptive schedules have been studied in a number of recent papers with a primary focus on two structural parameters: the minimum number of preemptions necessary, and a tight lower bound on shifts, i.e., the sizes of intervals bounded by the times created by preemptions, job starts, or completions. These two parameters have been investigated for a large class of preemptive scheduling problems,...
-
Affect aware video games
PublikacjaIn this chapter a problem of affect aware video games is described, including such issue as: emotional model of the player, design, development and UX testing of affect-aware video games, multimodal emotion recognition and a featured review of affect-aware video games.
-
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)....
-
ELECTIVE PROJECT II Waterfront Pavilion – Story for the Shipyard
Kursy OnlineThe topic of the course – Waterfront Pavilion – Story for the Shipyard, is describing the task for architectural space located in the post-industrial area of the Shipyard in Gdansk.. The goal of the task is to design the space oriented on the goals of the Sustainable Development and the problems related to the Climate Changes. The idea is to use green and blue solutions, to think about energy and recycled materials, to be close...
-
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...
-
JOURNAL OF SCHEDULING
Czasopisma -
Modeling emotions for affect-aware applications
PublikacjaThe chapter concerns emotional states representation and modeling for software systems, that deal with human affect. A review of emotion representation models is provided, including discrete, dimensional and componential models. The paper provides also analysis of emotion models used in diverse types of affect-aware applications: games, mood trackers or tutoring systems. The analysis is supported with two design cases. The study...
-
Design Elements of Affect Aware Video Games
PublikacjaIn this paper issues of design and development process of affect-aware video games are presented. Several important design aspects of such games are pointed out. A concept of a middleware framework is proposed that separates the development of affect-aware video games from emotion recognition algorithms and support from input sensors. Finally, two prototype affect-aware video games are presented that conform to the presented architecture...
-
Emotion Recognition for Affect Aware Video Games
PublikacjaIn this paper the idea of affect aware video games is presented. A brief review of automatic multimodal affect recognition of facial expressions and emotions is given. The first result of emotions recognition using depth data as well as prototype affect aware video game are presented
-
Scheduling of compatible jobs on parallel machines
PublikacjaThe dissertation discusses the problems of scheduling compatible jobs on parallel machines. Some jobs are incompatible, which is modeled as a binary relation on the set of jobs; the relation is often modeled by an incompatibility graph. We consider two models of machines. The first model, more emphasized in the thesis, is a classical model of scheduling, where each machine does one job at time. The second one is a model of p-batching...
-
Task Scheduling – Review of Algorithms and Analysis of Potential Use in a Biological Wastewater Treatment Plant
PublikacjaThe idea of task scheduling is to increase the efficiency of a system by minimising wasted time, evenly loading machines, or maximising the throughput of machines. Moreover, the use of appropriate scheduling algorithms often leads to a reduction in the energy costs of the process. Task scheduling problems are found in a variety of industrial areas, and their scale changes significantly depending on the problem. This review shows...
-
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...
-
On-Line Partitioning for On-Line Scheduling with Resource Conflicts
PublikacjaWithin this paper, we consider the problem of on-line partitioning the sequence of jobs which are competing for non-sharable resources. As a result of partitioning we get the subsets of jobs that form separate instances of the on-line scheduling problem. The objective is to generate a partition into the minimum number of instances such that the response time of any job in each instance is bounded by a given constant. Our research...
-
Dedicated scheduling of tasks to minimize mean flow time
PublikacjaThis paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard, we assume some restrictions on task lengths and the structure of associated scheduling graphs. Of particular interest are acyclic graphs. In this way we identify a borderline between NP-hard and polynomially solvable special cases.
-
Total Completion Time Minimization for Scheduling with Incompatibility Cliques
PublikacjaThis paper considers parallel machine scheduling with incompatibilities between jobs. The jobs form a graph equivalent to a collection of disjoint cliques. No two jobs in a clique are allowed to be assigned to the same machine. Scheduling with incompatibilities between jobs represents a well-established line of research in scheduling theory and the case of disjoint cliques has received increasing attention in recent...
-
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...
-
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...
-
The excitation controller with gain scheduling mechanism for synchronous generator control
PublikacjaThe power systems, including the synchronous generators and power systems networks, are complex nonlinear systems with configuration and parameters which change through time. That leads to electromechanical oscillations occurring in that system. Thus synchronous generator excitation controller must be capable of providing appropriate stabilization signal over broad range of operating conditions and disturbances. In this paper,...
-
Using Different Information Channels for Affect-Aware Video Games - A Case Study
PublikacjaThis paper presents the problem of creating affect-aware video games that use different information channels, such as image, video, physiological signals, input devices, and player’s behaviour, for emotion recognition. Presented case studies of three affect-aware games show certain conditions and limitations for using specific signals to recognize emotions and lead to interesting conclusions.
-
Evaluation of affective intervention process in development of affect-aware educational video games
PublikacjaIn this paper initial experiences are presented on implementing specific methodology of affective intervention design (AFFINT) for development of affect-aware educational video games. In the described experiment, 10 student teams are to develop affect-aware educational video games using AFFINT to formalize the whole process. Although all projects are still in progress, first observations and conclusions may already be presented.
-
Positively aware : the monthly journal of the Test Positive Aware Network
Czasopisma -
Design and Configuration of Context-aware VoIP Telephony Systems
PublikacjaVoice over IP is a widely used concept with regard to a realization technology of different types of telephony systems, including those that are used in enterprises. Such systems of a call procesing component and a set of desk endpoints that are pervasove from a user perspective. Those andpoints are usually not mobile, but in result can deliver a much greater set of functions needed in an everyday office work. Those functions also...
-
Collision‐Aware Routing Using Multi‐Objective Seagull Optimization Algorithm for WSN‐Based IoT
PublikacjaIn recent trends, wireless sensor networks (WSNs) have become popular because of their cost, simple structure, reliability, and developments in the communication field. The Internet of Things (IoT) refers to the interconnection of everyday objects and sharing of information through the Internet. Congestion in networks leads to transmission delays and packet loss and causes wastage of time and energy on recovery. The routing protocols...
-
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
PublikacjaWe address a generalization of the classical 1- and 2-processor unit execution time scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these stipulations we show that the problem...
-
Study of data scheduling methods in the WiMAX Mobile metropolitan area networks
PublikacjaThe paper discusses basic assumptions of the WiMAX Mobile system. It also presents and analyses the results of simulation tests run for selected data scheduling methods and subcarrier allocation. Based on the test results, the authors have prepared a comparative analysis of two popular data scheduling methods, i.e. WRR and PF, and their own method CDFQ which uses information about the current channel situation for the queuing processes...
-
Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
PublikacjaArtykuł podejmuje problem szeregowania zadań przy założeniu podziału czasu na sloty jednakowej długości, gdzie każde z zadań ma ustaloną długość oraz czas jego zakończenia, który jest relatywny do końca slotu. Problem znalezienia uszeregowania polega na dokonaniu przydziału zadań do poszczególnych slotów, przy czym w ogólności długość zadania może wymuszać sytuację, w której zadańie jest realizowane nie tylko w slocie, w którym...
-
EvOLAP Graph – Evolution and OLAP-Aware Graph Data Model
PublikacjaThe objective of this paper is to propose a graph model that would be suitable for providing OLAP features on graph databases. The included features allow for a multidimensional and multilevel view on data and support analytical queries on operational and historical graph data. In contrast to many existing approaches tailored for static graphs, the paper addresses the issue for the changing graph schema. The model, named Evolution...
-
Ewa Klugmann-Radziemska prof. dr hab.
OsobyEwa Klugmann-Radziemska ukończyła studia wyższe na kierunku fizyka na Uniwersytecie Gdańskim. Od roku 1996 związana jest z Politechniką Gdańską, kiedy to rozpoczęła studia doktoranckie. Obecnie jest profesorem na Wydziale Chemicznym Politechniki Gdańskiej, od roku 2006 kierownikiem Katedry Konwersji i Magazynowania Energii. W latach 2008–2016 pełniła funkcję Prodziekana ds. współpracy i rozwoju, w latach 2016-2019 była Pełnomocnikiem...
-
The assessment of renewable energy in Poland on the background of the world renewable energy sector
PublikacjaThe issues of the article are associated with the development of the renewable energy source (RES) sector in the world and in Poland. The subject is undoubtedly connected with the problem of the energy transformation taking place in most countries nowadays. Energy transformation processes are mainly associated with an increase in the share of energy production from RES and increased awareness of energy use by end consumers. This...
-
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:...
-
The regional energy transformation in the context of renewable energy sources potential
PublikacjaThe topics addressed in the article concern the problem of exploiting the potential of renewable energy sources (RES) at the regional level and the problem of the course of regional energy transition processes. Throughout the world, energy transition proceeds in a specific way for each country, due to the different potential of the selected RES and political, institutional and socio-economic conditions. Energy transition processes...
-
A new optimal algorithm for a time-dependent scheduling problem
PublikacjaIn this article a single machine time-dependent scheduling problem with total completion time criterion is considered. There are n given jobs j_1, ..., j_n and the processing time pi of the i-th job is given by p_i = 1 + b_is_i, where si is the starting time of the i-th job, i = 1, ..., n. If all jobs have different and non-zero deterioration rates and bi > bj => bi >= (b_min+1)/(b_min) b_j + 1/b_min, where b_min = min{b_i}, then...
-
Heuristic scheduling algorithms for uniform load of computer system
PublikacjaW pracy zaprezentowano opracowany heurystyczny algorytm szeregowania zadań UNILO (ang. UNIform LOad - jednakowe obciążenie), umożliwiający redukcję całkowitego zapotrzebowania na moc obliczeniową systemu komputerowego bez pogarszania jego wydajności. Algorytm ten realizuje takie przydzielenie zadań obliczeniowych do poszczególnych jednostek (procesorów), aby zapewnić ich jednakowe obciążenie. Opracowany algorytm został zweryfikowany...
-
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,...
-
Multi-domain and Context-Aware Recommendations Using Contextual Ontological User Profile
PublikacjaRecommender Systems (RS) became popular tools in many Web services like Netflix, Amazon, or YouTube, because they help a~user to avoid an information overload problem. One of the types of RS are Context-Aware RS (CARS) which exploit contextual information to provide more adequate recommendations. Cross-Domain RS (CDRS) were created as a response to the data sparsity problem which occurs when only few users can provide reviews or...
-
A Task-Scheduling Approach for Efficient Sparse Symmetric Matrix-Vector Multiplication on a GPU
PublikacjaIn this paper, a task-scheduling approach to efficiently calculating sparse symmetric matrix-vector products and designed to run on Graphics Processing Units (GPUs) is presented. The main premise is that, for many sparse symmetric matrices occurring in common applications, it is possible to obtain significant reductions in memory usage and improvements in performance when the matrix is prepared in certain ways prior to computation....
-
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
PublikacjaWe study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size...
-
Approximation algorithms for job scheduling with block-type conflict graphs
PublikacjaThe problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relation (equivalently in the same block) may be scheduled on the same machine in this model. The presented model stems from a well-established line of research combining scheduling theory...
-
No-Wait & No-Idle Open Shop Minimum Makespan Scheduling with Bioperational Jobs
PublikacjaIn the open shop scheduling with bioperational jobs each job consists of two unit operations with a delay between the end of the first operation and the beginning of the second one. No-wait requirement enforces that the delay between operations is equal to 0. No-idle means that there is no idle time on any machine. We model this problem by the interval incidentor (1, 1)-coloring (IIR(1, 1)-coloring) of a graph with the minimum...
-
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...
-
APPLIED ENERGY
Czasopisma -
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
PublikacjaIn the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP- complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize...