A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
An Iterative Optimization Framework for Adaptive Workflow Management in Computational Clouds
2013
2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications
model, workflow scheduler, and iteration controls to optimize the data processing via iterative workflow tasks. ...
The iterative workflow tasks can be bursty bags of tasks to be executed repetitively for data processing. ...
Since the bin packing problem is a combinatorial NP-hard problem, it is impossible to obtain optimal solutions especially for large-scale workflows with thousands or millions of tasks. ...
doi:10.1109/trustcom.2013.128
dblp:conf/trustcom/WangDLLHCB13
fatcat:fvv3ae6g75crxe76jsfknu5aua
Online multi-resource scheduling for minimum task completion time in cloud servers
2014
2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
We design a simple and efficient online scheme for scheduling cloud tasks requesting multiple resources, such as CPU and memory. ...
The proposed scheme reduces the queuing delay of the cloud tasks by accounting for their execution time lengths. ...
Vector bin packing problem is then more suitable to our scheduling problem, which is a generalization of classic bin packing problem to allow items to have multiple values. ...
doi:10.1109/infcomw.2014.6849261
dblp:conf/infocom/NoroozOliaeeHGG14
fatcat:mso6p7fc45bpxduatsgddcznle
A Neural Approach to Generation of Constructive Heuristics
2021
2021 IEEE Congress on Evolutionary Computation (CEC)
w.r.t. both Falkenauer's performance metric and the number of bins used. ...
We consider streaming instances of binpacking problems in a continual stream that must be packed immediately in strict order and using a limited number of resources. ...
CONCLUSION We proposed a novel neural approach to generating constructive heuristics for dealing with streaming bin-packing problem that directly output decisions to pack items accounting for current bin ...
doi:10.1109/cec45853.2021.9504989
fatcat:ci4bswkya5htlgq6uxxuzv5ka4
Optimization Heuristics for Cost-Efficient Long-Term Cloud Portfolio Allocations Under Uncertainty
[article]
2022
arXiv
pre-print
We present two distinct cost optimization heuristics for this stochastic temporal bin packing problem, one taking a naive first fit strategy, while the other is built on the concepts of genetic algorithms ...
Thus, selecting the right server instances for a given set of applications such that the allocations are cost efficient is a non-trivial task. ...
Encoding Scheme: For bin packing problems the grouping of items and their respective bins is an essential piece of information, which is also relevant to the individual genetic [27] . ...
arXiv:2206.07092v1
fatcat:e5p5lyx35vdyjhdg7zpvqff3ke
Multi-dimensional scheduling in cloud storage systems
2015
2015 IEEE International Conference on Communications (ICC)
The volume placement process is based on an APX-hard multi-dimensional Vector Bin Packing (V BP d ) algorithm. ...
In this paper, we present the design and implementation of a new scheduling algorithm for block storage systems that has the following advantages over the currently implemented scheduler in OpenStack. ...
ACKNOWLEDGMENT The authors would like to thank Ben Swartzlander, architect at NetApp, for his useful feedback. ...
doi:10.1109/icc.2015.7248353
dblp:conf/icc/YaoPC15
fatcat:jt7knffhovd2tka7ipjedztxre
A hyper heuristic algorithm for scheduling of fog networks
2017
2017 21st Conference of Open Innovations Association (FRUCT)
Classical algorithms are suitable for small scheduling problems, but the problem emerges in big scheduling problems. ...
To improve the performance of the scheduling problem, heuristic algorithms are used. In this paper, we used the test and select technique to introduce a hyperheuristic algorithm. ...
[37] , provides a multi-objective framework for making selections hyper-heuristics to solve the problem of two-dimensional bin packing. ...
doi:10.23919/fruct.2017.8250177
dblp:conf/fruct/KabirzadehRN17
fatcat:of752nydkvb37bwgiazb2mqili
Analyzing Meta-Heuristic Algorithms for Task Scheduling in a Fog-Based IoT Application
2022
Algorithms
The allocation of processing elements (PEs) to modules is a scheduling problem. ...
HHS allocates PEs to modules by low-level heuristics in the training and testing phases of the input workflow. ...
Conflicts of Interest: The author declares no conflict of interest. ...
doi:10.3390/a15110397
fatcat:7ebhwxxrcbaftiicazz32hc62i
Identifying Hyper-Heuristic Trends through a Text Mining Approach on the Current Literature
2022
Applied Sciences
They have proven helpful for dealing with complex problems, particularly those related to combinatorial optimization. ...
The vast amount of data available that we find opens up a new opportunity for researchers to analyze the status of hyper-heuristics and help create strategic plans regarding the scope of hyper-heuristics ...
Conflicts of Interest: The authors declare no conflict of interest. ...
doi:10.3390/app122010576
fatcat:4zivn7457nedxoorep4wzyh7xm
Energy Aware Parallel Scheduling Techniques for Network-on-Chip Based Systems
2021
IEEE Access
Scheduling large scientific workflows consisting hundreds and thousands of tasks consume significant amount of time and resources. ...
With the increase in computing capabilities of computing hardware, application requirements have increased many folds, particularly for real world scientific applications. ...
Since bin packing problem is NP-hard [40] , [41] , the task scheduling problem at hand is also NP-hard for the general case [40] , [42] , [43] . ...
doi:10.1109/access.2021.3063901
fatcat:fqfeharhojdx5avzeb56rgyole
Review of Energy Reduction Techniques for Green Cloud Computing
2016
International Journal of Advanced Computer Science and Applications
The GCC is a broad and exciting field for research. ...
The growth of cloud computing has led to uneconomical energy consumption in data processing, storage, and communications. This is unfriendly to the environment, because of the carbon emissions. ...
They modeled the VM placement problem as a bin packing problem with variable bin sizes and prices; bin sizes are the available processor capacities of the nodes; and prices correspond to the power consumption ...
doi:10.14569/ijacsa.2016.070127
fatcat:5vhpsecxxve3rggiurrkoiskce
Adaptive Event Dispatching in Serverless Computing Infrastructures
[article]
2019
arXiv
pre-print
The term "serverless" has become a synonym for the entirely resource-transparent deployment model of cloud-based event-driven distributed applications. ...
This work investigates how adaptive event dispatching can improve serverless platform resource efficiency and contributes a novel approach that allows for better scaling and fitting of the platform's resource ...
Online Bin Packing The serverless scheduling problem can be regarded an online bin packing problem that assigns each event to a worker (bin) with sufficient residual compute capacity. ...
arXiv:1901.03086v1
fatcat:wzgif4fsdnhfvhetxxhritsl2m
Resource Request Mapping Techniques for OFDMA Networks
[chapter]
2014
Resource Management in Mobile Computing Environments
Subsequently in the following sections are presented analysis and design of various Bin packing algorithms developed in our simulator. ...
The IEEE 802.16e Mobile WiMAX standard uses Orthogonally Frequency Division Multiple Access (OFDMA) schema for frame structure. ...
They propose a low complexity heuristic algorithm to solve the length/width variable of the two-dimensional packing problem. ...
doi:10.1007/978-3-319-06704-9_7
fatcat:n33jy6yoq5h3rlmvkp5tp57j4i
Multi Scheduling Reactive Resource Sharing for Dynamic Dataflow in Cloud Environment
2016
Bonfring International Journal of Data Mining
This proposes a Meta scheduling algorithm which exploits the heterogeneous nature of Cloud to achieve reduction in energy consumption. ...
The problem can be addressed by replacing with more energy efficient infrastructures, but the process of switching to new infrastructure is not only costly but also time consuming. ...
The greedy heuristics, centralized and shared, based on the variable-sized bin packing algorithm and compare against a Genetic Algorithm (GA) based heuristic that gives a nearoptimal solution. ...
doi:10.9756/bijdm.8307
fatcat:rxw5tqleircvvdg5teoqc6d5z4
Scalable Epidemiological Workflows to Support COVID-19 Planning and Response
2021
2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
computational problem. ...
In this work, we present scalable high performance computing-enabled workflows for COVID-19 pandemic planning and response. ...
ACKNOWLEDGMENT We thank the anonymous reviewers for their valuable suggestions. ...
doi:10.1109/ipdps49936.2021.00072
fatcat:qwr5kqmbyfgdfapeofmwebz6gi
Resource-Aware Scheduling of Distributed Ontological Reasoning Tasks in Wireless Sensor Networks
2010
2010 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing
By means of simulation, we evaluate several developed scheduling heuristics and compare the results to an optimal solution of the same WSN task scheduling problem, obtained using ILP. ...
As the number of wireless sensor network applications continues to grow, the need for specialized task scheduling mechanisms, aware of the sensor devices' capabilities and realtime resource availability ...
Stijn Verstichel would like to thank the IWT (Institute for the Promotion of Innovation through Science and Technology in Flanders) for financial support through his Ph.D. grant. ...
doi:10.1109/sutc.2010.10
dblp:conf/sutc/PauwVVTO10
fatcat:ckxydd4bcfdolnzgaiaasntrfm
« Previous
Showing results 1 — 15 out of 657 results