scholarly journals Research and Development of an Algorithm for the Response Time Estimation in Multiprocessor Systems Under the Interval Uncertainty of the Tasks Execution Times

2020 ◽  
Vol 27 (2) ◽  
pp. 218-233
Author(s):  
Mark G. Gonopolskiy ◽  
Alevtina B. Glonina
Keyword(s):  
Response Time ◽  
Execution Time ◽  
Interval Uncertainty ◽  
Time Interval ◽  
Multiprocessor Systems ◽  
Brute Force ◽  
Worst Case ◽  
Force Method ◽  
Brute Force Method ◽  
Execution Times

The paper presents an algorithm for the worst case response time (WCRT) estimation for multiprocessor systems with fixed-priority preemptive schedulers and the interval uncertainty of tasks execution times. Each task has a unique priority within its processor, a period, an execution time interval [BCET, WCET] and can have data dependency on other tasks. If a decrease in the execution time of the task A can lead to an increase in the response time of the another task B, then task A is called an anomalous task for task B. According to the chosen approach, in order to estimate a task’s WCRT, two steps should be performed. The first one is to construct a set of anomalous tasks using the proposed algorithm for the given task. The paper provides the algorithm and the proof of its correctness. The second one is to find the WCRT estimation using a genetic algorithm. The proposed approach has been implemented software as a program in Python3. A set of experiments have been carried out in order to compare the proposed method in terms of precision and speed with two well-known WCRT estimating methods: the method that does not take into account interval uncertainty (assuming that the execution time of a given task is equal to WCET) and the brute force method. The results of the experiments have shown that, in contrast to the brute force method, the proposed method is applicable to the analysis of the real scale computing systems and also allows to achieve greater precision than the method that does not take into account interval uncertainty.

scholarly journals Application of Genetic Algorithm for More Efficient Multi-Layer Thickness Optimization in Solar Cells

Energies ◽  
2020 ◽  
Vol 13 (7) ◽  
pp. 1726
Author(s):  
Premkumar Vincent ◽  
Gwenaelle Cunha Sergio ◽  
Jaewon Jang ◽  
In Man Kang ◽  
Jaehoon Park ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Solar Cells ◽  
Heuristic Method ◽  
Brute Force ◽  
Force Parameter ◽  
Thickness Optimization ◽  
Sweep Method ◽  
Case Scenario ◽  
Force Method ◽  
Brute Force Method

Thin-film solar cells are predominately designed similar to a stacked structure. Optimizing the layer thicknesses in this stack structure is crucial to extract the best efficiency of the solar cell. The commonplace method used in optimization simulations, such as for optimizing the optical spacer layers’ thicknesses, is the parameter sweep. Our simulation study shows that the implementation of a meta-heuristic method like the genetic algorithm results in a significantly faster and accurate search method when compared to the brute-force parameter sweep method in both single and multi-layer optimization. While other sweep methods can also outperform the brute-force method, they do not consistently exhibit 100% accuracy in the optimized results like our genetic algorithm. We have used a well-studied P3HT-based structure to test our algorithm. Our best-case scenario was observed to use 60.84% fewer simulations than the brute-force method.

Nuclear orientation of thermally prepared114mInCu by the brute-force method

1983 ◽  
Vol 13 (1-3) ◽  
pp. 249-255 ◽  
Author(s):  
J. Boysen ◽  
W. D. Brewer ◽  
A. Kettschau
Keyword(s):  
Nuclear Orientation ◽  
Brute Force ◽  
Force Method ◽  
Brute Force Method

scholarly journals Nuclear spin imaging with hyperpolarized nuclei created by brute force method

2011 ◽  
Vol 295 ◽  
pp. 012167 ◽  
Author(s):  
Masayoshi Tanaka ◽  
Takayuki Kunimatsu ◽  
Mamoru Fujiwara ◽  
Hideki Kohri ◽  
Takeshi Ohta ◽  
...  
Keyword(s):  
Nuclear Spin ◽  
Brute Force ◽  
Force Method ◽  
Brute Force Method

scholarly journals PENGEMBANGAN APLIKASI MOBILE PADA PELAYANAN PEMERINTAH KOTA YOGYAKARTA DALAM RANGKA TANGGAP RESPON INFORMASI DAN KELUHAN DARI MASYARAKAT

Telematika ◽  
2017 ◽  
Vol 14 (2) ◽  
pp. 139
Author(s):  
Bambang Yuwono ◽  
Oliver Samuel Simanjuntak ◽  
Danny Wijaksono
Keyword(s):  
Object Oriented ◽  
Community Response ◽  
City Government ◽  
Brute Force ◽  
The Public ◽  
Java Programming ◽  
Force Method ◽  
Brute Force Method ◽  
Application Engineering ◽  
Yogyakarta City

AbstractUnit Pelayanan Informasi dan Keluhan (UPIK) is an e-government application built by the Yogyakarta City Government in order. UPIK becomes a container of input information in the form of complaints, questions, information, suggestions, and suggestions from the community, as well as providing solutions response to information that entered the Yogyakarta City government. The goal is to accelerate the service of information and complaints to be conveyed by the public without the need for a convoluted procedure. In its implementation, UPIK has several limitations, such as: updating of news which is not fast, lack of responsiveness of community response or complaint, no coordinate location where community reporting, and delivery of complaints and suggestions from the public through opertator and to the office implemented manually. The methodology used in this study is GRAPPLE (Guidelines for Rapid APPlication Engineering) which is a method commonly used for the development of object-oriented applications. This Android-based application is built using java programming language by utilizing Brute Force method on the system, so that users easier to report complaints to the relevant offices. With this application can help the performance of related agencies responsible for making corrections of complaints that come in the Application Information Services and Complaints Yogyakarta-based mobile community.Keywords: Complaint, Community, Brute Force, Office, Response, Android.AbstrakUnit Pelayanan Informasi dan Keluhan (UPIK) adalah sebuah penerapan e-government yang dibangun oleh Pemerintah Kota Yogyakarta dalam rangka . UPIK menjadi wadah informasi masukan berupa keluhan, pertanyaan, informasi, usul, dan saran dari masyarakat, serta memberikan solusi respon atas informasi yang masuk kepemerintah Kota Yogyakarta. Tujuannya adalah untuk mempercepat pelayanan informasi dan keluhan yang ingin disampaikan masyarakat tanpa perlu prosedur yang berbelit belit. Dalam pelaksanaanya, UPIK memiliki beberapa keterbatasan, diantaranya adalah: pemutahiran berita yang tidak cepat, kurang tanggap penyelesaian tanggapan atau pengaduan masyarakat, tidak ada lokasi koordinat tempat pelaporan masyarakat, dan penyampaian keluhan dan saran dari masyarakat melalui opertator dan kepada  dinas dilaksanakan secara manual. Metodologi yang digunakan dalam penelitian ini adalah GRAPPLE (Guidelines for Rapid APPlication Engineering) yaitu suatu metode yang lazim digunakan untuk pengembangan aplikasi berorientasi objek. Aplikasi berbasis Android ini dibangun menggunakan bahasa pemprograman java dengan memanfaatkan metode Brute Force pada sistem, agar pengguna lebih mudah untuk melaporkan keluhan ke dinas yang terkait. Dengan aplikasi ini dapat membantu kinerja dinas-dinas terkait yang bertanggung jawab untuk melakukan pembenahan keluhan yang masuk di Aplikasi Pelayanan Informasi dan Pengaduan masyarakat Kota Yogyakarta berbasis mobile.Kata kunci: Keluhan, Masyarakat, Brute Force, Dinas, Respon, Android.

scholarly journals Pulse Pattern Optimization Based on Brute Force Method for Medium-Voltage Three-Level NPC Converter with Active Front End

Electronics ◽  
2020 ◽  
Vol 9 (10) ◽  
pp. 1685
Author(s):  
Dominik Cikač ◽  
Nikola Turk ◽  
Neven Bulić ◽  
Stefano Barbanti
Keyword(s):  
Power Supply ◽  
Pulse Width Modulation ◽  
Null Space ◽  
Solution Space ◽  
Brute Force ◽  
Medium Voltage ◽  
Force Method ◽  
Precise Calculation ◽  
Brute Force Method ◽  
Additional Constraints

Nowadays, regulation standards regarding the injection of harmonics in the grid power supply are becoming stricter. These standards have a direct impact on the design and control of converters, especially in medium-voltage drives. To fulfil these standards, converters are designed to work with the power factor as close to unity as possible and to correct the harmonics spectrum in case of a grid power supply with multiple resonances. The preferred modulation technique for medium-voltage drives is usually selective harmonic elimination pulse width modulation. This approach requires a precise calculation of pulse patterns (switching angle vs. modulation index) with additional constraints. This research presents a new approach for the determination of optimal pulse patterns. The technique ensures the elimination of low-order harmonics and minimization of some high-order ones. The proposed technique incorporates the additional constraints regarding minimum on/off switching time (pulse duration) and ensures the continuity of pulse patterns. Optimal pulse patterns are determined with the brute force method which searches the feasible solution space by use of the Jacobian matrix null space. Determined pulse patterns are verified by the simulation and experimental measurements.

A Range Query Parallel Algorithm in High-Dimensional Space

2012 ◽  
Vol 263-266 ◽  
pp. 2308-2313
Author(s):  
Hong Bo Xu ◽  
Nian Min Yao
Keyword(s):  
Dimensional Space ◽  
Range Query ◽  
High Dimensional ◽  
Brute Force ◽  
Slave Node ◽  
High Dimensional Space ◽  
Force Method ◽  
Spatial Range ◽  
Brute Force Method ◽  
Method R

The performance of the spatial range query algorithms based on Brute-Force method, R-tree, VA-file and NB-tree suffers greatly in high-dimensional space. So the reduction of the dimensionality is the key to the spatial range query in high-dimensional space. The paper uses the parallel technique to present a spatial range query parallel algorithm in high-dimensional space. The algorithm transforms d-dimensional spatial range query to the linear space on d slave node processors. The d slave node processors run parallel. The master node processor only need calculate the union of d results which d slave node processors return. The experimental results indicate that its performance is better than that of the spatial range query algorithms based on Brute-Force method, R-tree, VA-file, NB-tree.

Sign in / Sign up

Export Citation Format

Share Document