Models of Computer Calculations by Valerii Zadiraka, Oleksandr Khimich, Inna Shvidchenko

“…The complexity estimates of computational algorithms of the listed classes of problems for single-processor, multiprocessor and quantum computing models are given. …”
Get full text

Adaptive routing on mesh networks by Jing, Wenge

“…In this research, we analyze routing strategies in multiprocessor networks and their performance. In specific, we focus on the routing strategies of systems whose interconnection topologies can be enumerated via a set of rules. …”
Get full text

Limitless Directories: A Scalable Cache Coherence Scheme by Chaiken, David, Kubiatowicz, John, Agarwal, Anant

“…Caches enhance the performance of multiprocessors by reducing network traffic and average memory access latency. …”
Get full text

A RECURSIVE ALGORITHM SUITABLE FOR REAL-TIME MEASUREMENT by Giovanni Bucci, Antonietta Germano, Carmine Landi

“…To cope with time constraints a parallel formulation of it, suitable to be implemented on multiprocessor systems, is presented. The adopted concurrent implementation is based on factorization techniques. …”
Get full text

On Locating-Dominating Codes in Binary Hamming Spaces by Iiro Honkala, Tero Laihonen, Sanna Ranto

“…Locating faulty processors in a multiprocessor system gives the motivation for locating-dominating codes. …”
Get full text

Hardware Accelerators for Elliptic Curve Cryptography by C. Puttmann, J. Shokrollahi, M. Porrmann, U. Rückert

“…Furthermore, we present a hierarchical multiprocessor system-on-chip (MPSoC) platform that can be used for fast integration and evaluation of novel hardware accelerators. …”
Get full text

Distribution of Computational Load between Processors in an Exact Solution of the Knapsack Problem with Exhaustive Search by Georgii Ivanovich Borzunov, Mikhail Andreevich Kupriyashin

“…The proposed approach provides a more even distribution of computational load on multiprocessor systems when trying to find the solution of the knapsack problem that enhances the efficiency of distributed computing.…”
Get full text

Fault Tolerant Addressing Scheme for Oxide Interconnection Networks by Asim Nadeem, Agha Kashif, Sohail Zafar, Amer Aljaedi, Oluwatobi Akanbi

“…The symmetry of an interconnection network plays a key role in defining the functioning of a system involving multiprocessors where thousands of processor-memory pairs known as processing nodes are connected. …”
Get full text

نمذجة خوارزميات الجدولة للمهام الدورية وتحليل أدائها في أنظمة الزمن الحقيقي متعددة المعالجات by محمد حجازية, رلى مريشة

“…The research presents molding and analytical study of several scheduling algorithms types in real-time multiprocessor systems. The performance of three scheduling algorithms have been analyzed : Earliest Deadline First Scheduling (EDF) , Least Laxity First Scheduling (LLF), and Earliest Deadline First until Zero Laxity Scheduling (EDZL). …”
Get full text

Federated Scheduling Optimization Scheme for Typed Tasks With Power Constraints in Heterogeneous Multicore Processor Architectures by Xiaohong Wen, Guojin Liu, Dejian Li, Yantao Yu, Haisen Zhao, Tiancong Huang

“…For non-real-time tasks, we propose a dichotomous search-based scheduling algorithm to minimize the average response time of non-real-time tasks under strong preemption constraints on real-time tasks, providing a theoretical analysis proof of the optimal processor speed configurations for heterogeneous multiprocessor systems under power constraints. Simulation results demonstrate that factors such as processor size, system capacity, available power, and task arrival rate have a significant impact on the system performance, and that the proposed scheme enables optimal load distribution for typed tasks with power constraints in multiprocessor queueing systems.…”
Get full text

LEARNING DECISION RULES USING A DISTRIBUTED EVOLUTIONARY ALGORITHM by WOJCIECH KWEDLO, MAREK KRĘTOWSKI

“…We describe an implementation of EDRL-MD system in the cluster of multiprocessor machines connected by Fast Ethernet. Our approach consists in a distribution of the learning set into processors of the cluster. …”
Get full text

Accuracy control for fast circuit simulation by A. B. Korchak

“…The algorithm provides an ability of parallel numerical experiments in multiprocessor computational environment. There is computation speed up by means of block-matrix and structural (DCCC) decompositions application. …”
Get full text

Development of the parallel algorithm for dynamic control system of a manipulation robot by A A Vnukov, M V Semikov, D A Trenin

“…To accelerate the task computation the heuristic multiprocessor system model was proposed. Parallel algorithms and processor structures were integrated in the decision model of direct and reverse dynamics tasks which has the common memory blocks. …”
Get full text

Task Scheduling in the Control Robotics Environment by Mok, Aloysius Ka-Lau

“…The capability of a multiprocessor system to handle tasks with hard, real-time deadlines is investigated according to whether complete or partial a priori knowledge of the deadlines, computation times and frequencies of occurence of individual tasks is available. …”
Get full text

The Supercomputer Toolkit and Its Applications by Abelson, Harold, Berlin, Andrew A., Katzenelson, Jacob, McAllister, William H., Rozas, Guillermo J., Sussman, Gerald Jay

“…Using the Toolkit, a scientist or an engineer, starting with a suitable computational problem, will be able to readily configure a special purpose multiprocessor that attains supercomputer-class performance on that problem, at a fraction of the cost of a general purpose supercomputer. …”
Get full text

Message-Driven Processor Architecture: Verson 11 by Dally, William, Chien, Andrew, Fiske, Stuart, Horwat, Waldemar, Keen, John, Nuth, Peter, Larivee, Jerry, Totty, Brian

“…The Message-Driven Processor is a node of a large-scale multiprocessor being developed by the Concurrent VLSI Architecture Group. …”
Get full text

Fat-Tree Routing for Transit by DeHon, Andre

“…The Transit network provides high-speed, low-latency, fault-tolerant interconnect for high-performance, multiprocessor computers. The basic connection scheme for Transit uses bidelta style, multistage networks to support up to 256 processors. …”
Get full text

Counter abstraction in the CSP/FDR setting by Mazur, T, Lowe, G

“…We illustrate the method on an example based on a multiprocessor operating system.</p>…”

Counter Abstraction in the CSP/FDR setting by Mazur, T, Lowe, G

“…We illustrate the method on an example based on a multiprocessor operating system.…”

Parallelized A Posteriori Multiobjective Optimization in RF Design by Jan Míchal, Josef Dobeš

“…A posteriori multiobjective optimization relies on a series of mutually independent single-objective optimization subproblems, which can be run in parallel, thus making full use of a multiprocessor (or multicore) computer. This paper presents a parallel process launching scheme, such that practically no computing capacity gets wasted. …”
Get full text