Search Results - Theory of computation → Online algorithms

Invited: Algorithms and Architectures for Accelerating Long Read Sequence Analysis by Gamaarachchi, Hasindu, Liyanage, Kisaru, Parameswaran, Sri

“… This paper introduces the necessity for one, optimization of existing algorithms; two, efficient utilization of existing heterogeneous systems…”
Get full text

Optimal Memory Allocation and Scheduling for DMA Data Transfers under the LET Paradigm by Pazzaglia, Paolo, Casini, Daniel, Biondi, Alessandro, Natale, Marco Di

“…The Logical Execution Time (LET) paradigm is increasingly used to achieve predictable communications in modern multicore automotive applications. Direct Memory…”
Get full text

A Universal Method for Task Allocation on FP-FPS Multiprocessor Systems with Spin Locks by Zhao, Shuai, Chen, Nan, Fang, Yinjie, Li, Zhao, Chang, Wanli

“…Many complex real-time systems, such as increasingly automated vehicles and 5G wireless base stations, contain a large amount of shared resources that must be…”
Get full text

BLESS: Bandwidth and Locality Enhanced SMEM Seeding Acceleration for DNA Sequencing by Han, Seunghee, Moon, Seungjae, Suh, Teokkyu, Heo, JaeHoon, Kim, Joo-Young

“…In an era marked by the pervasive spread of harmful viruses like COVID-19, the importance of DNA sequencing has grown significantly, given its crucial role in…”
Get full text

Online scheduling for multi-core shared reconfigurable fabric by Chen, Liang, Marconi, Thomas, Mitra, Tulika

“… In this paper, we propose an efficient online scheduling algorithm for multi-core shared reconfigurable fabric and show its effectiveness through experimental evaluation…”
Get full text

PertNAS: Architectural Perturbations for Memory-Efficient Neural Architecture Search by Ahmad, Afzal, Xie, Zhiyao, Zhang, Wei

“… This leads to GPU-memory bottlenecks that hamper the algorithm's scalability. To resolve these bottlenecks, we propose a perturbations-based evolutionary approach…”
Get full text

Meeting Job-Level Dependencies by Task Merging by Becker, Matthias

“… Job-level dependencies can be leveraged to specify a partial ordering on tasks' jobs already at early design phases, agnostic of the hardware platform or scheduling algorithm, and guarantee that end…”
Get full text

DuQTTA: Dual Quantized Tensor-Train Adaptation with Decoupling Magnitude-Direction for Efficient Fine-Tuning of LLMs by Dong, Haoyan, Chen, Hai-Bao, Chang, Jingjing, Yang, Yixin, Gao, Ziyang, Ji, Zhigang, Wang, Runsheng, Huang, Ru

“…Recent parameter-efficient fine-tuning (PEFT) techniques have enabled large language models (LLMs) to be efficiently fine-tuned for specific tasks, while…”
Get full text

On-line scheduling of target sensitive periodic tasks with the gravitational task model by Guerra, Raphael, Fohler, Gerhard

“… In this paper, we propose a scheduling algorithm for this task model to schedule periodic tasks…”
Get full text

Modulo scheduling with integrated register spilling for clustered VLIW architectures by Zalamea, Javier, Llosa, Josep, Ayguadé, Eduard, Valero, Mateo

“… communication in a single step. The algorithm uses limited backtracking to reconsider previously taken decisions…”
Get full text

Reinforcement Learning-Assisted Cache Cleaning to Mitigate Long-Tail Latency in DM-SMR by Pan, Yungang, Jia, Zhiping, Shen, Zhaoyan, Li, Bingzhe, Chang, Wanli, Shao, Zili

“…DM-SMR adopts Persistent Cache (PC) to accommodate non-sequential write operations. However, the PC cleaning process induces severe long-tail latency. In this…”
Get full text

Dynamic Algorithm Selection for SMT by Pimpalkhare, Nikhil

“…We describe an online approach to SMT solver selection using nearest neighbor classification and runtime estimation…”
Get full text

Dynamic Scheduling of Parallel Jobs with QoS Demands in Multiclusters and Grids by He, Ligang, Jarvis, Stephen A., Spooner, Daniel P., Chen, Xinuo, Nudd, Graham R.

“…This paper addresses the dynamic scheduling of parallel jobs with QoS demands (soft-deadlines) in multi-clusters and grids. Three metrics (over-deadline,…”
Get full text

A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multiprocessors by Satish, Nadathur, Ravindran, Kaushik, Keutzer, Kurt

“…We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders…”
Get full text

Reducing Delay Penalty of Multiple Concurrent Software Projects based on Overtime Planning by Zhang, Wei, Yang, Yun, Liu, Xiao

“…For software projects, significant delays can result in heavy penalty which may end up with project costs exceeding their budgets. As a consequence, employees,…”
Get full text

Cache-Conscious Wavefront Scheduling by Rogers, Timothy G., O'Connor, Mike, Aamodt, Tor M.

“…This paper studies the effects of hardware thread scheduling on cache management in GPUs. We propose Cache-Conscious Wave front Scheduling (CCWS), an adaptive…”
Get full text

A Divide and Conquer Algorithm for DAG Scheduling under Power Constraints by Demirci, Gokalp, Marincic, Ivana, Hoffmann, Henry

“…We consider the problem of scheduling a parallel computation-represented as a directed acyclic graph (DAG…”
Get full text

Graph-partitioning based instruction scheduling for clustered processors by Aletà, Alex, Codina, Josep M., Sánchez, Jesús, González, Antonio

“…This work presents a novel scheme to schedule loops for clustered microarchitectures. The scheme is based on a preliminary cluster assignment phase implemented…”
Get full text

Feedback Dynamic Algorithms for Preemptable Job Scheduling in Cloud Systems by Li, Jiayin, Qiu, Meikang, Niu, Jianwei, Gao, Wenzhong, Zong, Ziliang, Qin, Xiao

“… In this paper, we present a preemptable job scheduling mechanism in cloud system. We propose two feedback dynamic scheduling algorithms for this scheduling mechanism…”
Get full text

Integrating dynamic pricing of electricity into energy aware scheduling for HPC systems by Yang, Xu, Zhou, Zhou, Wallace, Sean, Lan, Zhiling, Tang, Wei, Coghlan, Susan, Papka, Michael E.

“… Our preliminary results show that our power aware algorithm can reduce electricity bill of HPC systems as much as 23%…”
Get full text