Results 51 to 60 of about 3,147,688 (366)

Porting Decision Tree Algorithms to Multicore using FastFlow [PDF]

, 2010
The whole computer hardware industry embraced multicores. For these machines, the extreme optimisation of sequential algorithms is no longer sufficient to squeeze the real machine power, which can be only exploited via thread-level parallelism.
A.C. Sodan, I. Park, J.E. Gehrke, J.R. Quinlan, K. Asanovic, M. Aldinucci, M. Cole, M. Coppola, M. Joshi, M. Vanneschi, M. Zaki, M.K. Sreenivas, R. Jin, R.D. Blumofe, S. Ruggieri, S. Ruggieri, T. Lim, W. Thies   +17 more
core   +5 more sources

GPU Acceleration of Melody Accurate Matching in Query-by-Humming

The Scientific World Journal, 2014
With the increasing scale of the melody database, the query-by-humming system faces the trade-offs between response speed and retrieval accuracy. Melody accurate matching is the key factor to restrict the response speed.
Limin Xiao, Yao Zheng, Wenqi Tang, Guangchao Yao, Li Ruan   +4 more
doaj   +1 more source

Reservation-Based Federated Scheduling for Parallel Real-Time Tasks

, 2017
This paper considers the scheduling of parallel real-time tasks with arbitrary-deadlines. Each job of a parallel task is described as a directed acyclic graph (DAG).
Agrawal, Kunal, Chen, Jian-Jia, Li, Jing, Ueter, Niklas, von der Brüggen, Georg   +4 more
core   +1 more source

Integrating Job Parallelism in Real-Time Scheduling Theory [PDF]

, 2008
We investigate the global scheduling of sporadic, implicit deadline, real-time task systems on multiprocessor platforms. We provide a task model which integrates job parallelism.
Baker, Baker, Chandra, Geist, Goossens, Gorlatch, Joël Goossens, Leiss, Liliana Cucu, Liu, Manimaran, Srinivasan, Sunderam, Sébastien Collette, Zomaya   +14 more
core   +6 more sources

A Scheduling Method of Moldable Parallel Tasks Considering Speedup and System Load on the Cloud

IEEE Access, 2019
The moldable parallel task (MPT) is a kind of parallel task that their sub-tasks hold the resources exclusively, which has been widely used in different areas. Our paper focuses on the scheduling of moldable tasks when every sub-task supports time-slice.
Jianmin Li, Ying Zhong, Xin Zhang
doaj   +1 more source

Scheduling parallel tasks with individual deadlines

Theoretical Computer Science, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kyung-Yong Chwa, Oh-Heum Kwon
openaire   +3 more sources

Timing Analysis for DAG-based and GFP Scheduled Tasks [PDF]

, 2014
Modern embedded systems have made the transition from single-core to multi-core architectures, providing performance improvement via parallelism rather than higher clock frequencies. DAGs are considered among the most generic task models in the real-time
Marinho, José, Petters, Stefan M.
core  

Quantifying the benefits of SPECint distant parallelism in simultaneous multithreading architectures [PDF]

, 1999
We exploit the existence of distant parallelism that future compilers could detect and characterise its performance under simultaneous multithreading architectures.
Ayguadé Parra, Eduard, Krishnan, Venkata, Martel Pérez, Iván, Ortega Fernández, Daniel, Valero Cortés, Mateo   +4 more
core   +1 more source

An Ultra‐Robust Memristor Based on Vertically Aligned Nanocomposite with Highly Defective Vertical Channels for Neuromorphic Computing

Advanced Functional Materials, EarlyView.
An ultra‐robust memristor based on SrTiO3‐CeO2 (S‐C) vertically aligned nanocomposite (VAN) achieving exceptional endurance of 1012 switching cycles via interface engineering. Artificial neural networks (ANNs) integrated with S‐C VAN memristors exhibit high training accuracy across multiple datasets.
Zedong Hu, Hongyi Dou, Jeremy B. Gan, Cun Li, Xuanyu Sheng, Juanjuan Lu, Abhijeet Choudhury, Jialong Huang, Yizhi Zhang, Zhongxia Shang, Ye Cao, Xinghang Zhang, Haiyan Wang   +12 more
wiley   +1 more source

A Pipeline-Based ODE Solving Framework

IEEE Access
The traditional parallel solving methods of ordinary differential equations (ODE) are mainly classified into task-parallelism, data-parallelism, and instruction-level parallelism.
Ruixia Cao, Shangjun Hou, Lin Ma
doaj   +1 more source