Results 231 to 240 of about 149,979,854 (294)

PQ-Neurolink: latency-aware post-quantum-ready secure communication for distributed brain-computer interfaces. [PDF]

Front Syst Neurosci
Qayyum T, Tariq A, Belkacem AN.
europepmc   +1 more source

Benchmarking Quantum Solvers in Noisy Digital Simulations for Financial Portfolio Optimization. [PDF]

Entropy (Basel)
Shen R, Hao Z, Lee CH.
europepmc   +1 more source

Dynamic beam-stabilized, additive-printed flexible antenna arrays with on-chip rapid insight generation. [PDF]

Nat Commun
Poolakkal S, Islam A, Rao A, Bansal S, Dabrowski T, Kwan K, Wang Z, Mishra AK, Navarro JA, Ren S, Williams JD, Shekhar S, Gupta S.   +12 more
europepmc   +1 more source

Real-Time Implementation and Comparative Analysis of FOC and FCS-MPCC-Based PMSM Drives for Electric Vehicles. [PDF]

Sensors (Basel)
Boyar A, Kabalcı E.
europepmc   +1 more source

LPA: A First Approach to the Loop Processor Architecture

, 2008
Current processors frequently run applications containing loop structures. However, traditional processor designs do not take into account the semantic information of the executed loops, failing to exploit an important opportunity. In this paper, we take our first step toward a loop-conscious processor architecture that has great potential to achieve ...
Alejandro García, Oliverio J. Santana, Enrique Fernández, Pedro Medina, Mateo Valero   +4 more
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

ON OPTIMAL LOOP UNROLLING IN TWO-PROCESSOR SCHEDULING

International Journal of Parallel, Emergent and Distributed Systems, 1995
In this paper, we study the problem of scheduling loop task graphs onto two processor systems to minimize the execution lime. We use the idea of loop unrolling to uncover dependence among different loop iterations in loop task graphs. The scheduling is divided into two stages: determining an optimal unrolling factor, and constructing an optimal ...
Hesham A Ali, Hesham El-Rewini
exaly   +2 more sources

Processor preallocation and load balancing of DOALL loops

Journal of Supercomputing, 1994
Load balance is important because it may affect the speedup attained through the concurrent execution of loop iterations on a parallel processor. We study loop load balance in the context of the well-known Perfect benchmarks. Several static and dynamic characteristics of the Perfect benchmark DOALL loops are observed and interpreted. Thelate arrival of
Sourav Bhattacharya
exaly   +2 more sources

Time and Parallel Processor Bounds for Fortran-Like Loops

IEEE Transactions on Computers, 1979
The main goal of this paper is to show that a large number of processors can be used effectively to speed up simple Fortran-like loops consisting of assignment statements. A practical method is given by which one can check whether or not a statement is dependent upon another. The dependence structure of the whole loop may be of different types.
Utpal Banerjee, Shyh-Ching Chen, David J. Kuck, Ross A. Towle   +3 more
exaly   +3 more sources

Open-loop versus closed-loop control of processor loading

Performance Evaluation, 1990
Abstract In many processing systems, the goodput (the number of succesfully completed tasks per time unit) may decrease as the offered load increases. Such systems need some form of overload control. We distinguish between open-loop control that limits the number of tasks in the system with a fixed maximum and closed-loop control that rejects new ...
exaly   +3 more sources