Self-optimizing and self-programming computing systems: A combined compiler, complex networks, and machine learning approach
There exists an urgent need for determining the right amount and type of specialization
while making a heterogeneous system as programmable and flexible as possible …
while making a heterogeneous system as programmable and flexible as possible …
A cyber-physical systems approach to personalized medicine: challenges and opportunities for noc-based multicore platforms
P Bogdan - 2015 Design, Automation & Test in Europe …, 2015 - ieeexplore.ieee.org
This paper describes a few fundamental challenges concerning the design of Network-on-
Chip (NoC) based multicores as the backbone of cyber-physical systems (CPS) for …
Chip (NoC) based multicores as the backbone of cyber-physical systems (CPS) for …
Hashing, load balancing and multiple choice
U Wieder - … and Trends® in Theoretical Computer Science, 2017 - nowpublishers.com
Many tasks in computer systems could be abstracted as distributing items into buckets, so
that the allocation of items across buckets is as balanced as possible, and furthermore …
that the allocation of items across buckets is as balanced as possible, and furthermore …
Enhancing energy efficiency of multimedia applications in heterogeneous mobile multi-core processors
Recent smart devices have adopted heterogeneous multi-core processors which have high-
performance big cores and low-power small cores. Unfortunately, the conventional task …
performance big cores and low-power small cores. Unfortunately, the conventional task …
A randomized algorithm for load balancing in containerized cloud
Cloud computing is one of the highly discussed topics in the field of Internet and
communication technology. It is responsible for the on-demand provision of computing …
communication technology. It is responsible for the on-demand provision of computing …
Balanced Allocation on Hypergraphs
We consider a variation of balls-into-bins which randomly allocates $ m $ balls into $ n $
bins. Following Godfrey's model (SODA, 2008), we assume that each ball $ t $, $1\le t\le m …
bins. Following Godfrey's model (SODA, 2008), we assume that each ball $ t $, $1\le t\le m …
Balanced allocation on graphs: A random walk approach
A Pourmiri - Random Structures & Algorithms, 2019 - Wiley Online Library
We propose algorithms for allocating n sequential balls into n bins that are interconnected
as ad‐regular n‐vertex graph G, where d≥ 3 can be any integer. In general, the algorithms …
as ad‐regular n‐vertex graph G, where d≥ 3 can be any integer. In general, the algorithms …
Balls into bins via local search: cover time and maximum load
K Bringmann, T Sauerwald, A Stauffer… - Random Structures & …, 2016 - Wiley Online Library
We study a natural process for allocating balls into bins that are organized as the vertices of
an undirected graph. Balls arrive one at a time. When a ball arrives, it first chooses a vertex …
an undirected graph. Balls arrive one at a time. When a ball arrives, it first chooses a vertex …
Balanced allocation on hypergraphs
We consider a variation of balls-into-bins which randomly allocates m balls into n bins.
Following Godfrey's model (SODA, 2008), we assume that each ball t, 1⩽ t⩽ m, comes with a …
Following Godfrey's model (SODA, 2008), we assume that each ball t, 1⩽ t⩽ m, comes with a …
Self-optimizing and self-programming computing systems: a combined compiler, complex networks, and machine learning approach
(57) ABSTRACT A self-optimizing and self-programming computing system (SOSPCS)
design framework that achieves both program mability and flexibility and exploits computing …
design framework that achieves both program mability and flexibility and exploits computing …