Search results for "Computer Science::Operating Systems"
showing 9 items of 29 documents
M9_Microfluidics_for_CNT
2018
The droplets in contact coalesce when exposed to DEP filed.
Neutrino beam flux prediction 2013
2013
This data release is superseded by the flux release in 2016. The files in the following archive file contain the neutrino beam flux predictions for the T2K ND280 (near) and Super-Kamiokande (far) detectors. The description of the flux predictions is published in Phys. Rev. D.87.012001. The provided flux predictions include no neutrino oscillations. This tar file contains the flux predictions as well as a README.pdf file with detailed information on the included files.
Two Job Cyclic Scheduling with Incompatibility Constraints
2001
The present paper deals with the problem of scheduling several repeated occurrences of two jobs over a finite or infinite time horizon in order to maximize the yielded profit. The constraints of the problem are the incompatibilities between some pairs of tasks which require a same resource.
An Evolution of the Non-Parameter Harris Affine Corner Detector: A Distributed Approach
2009
A parallel version of a new automatic Harris-based corner detector is presented. A scheduler to dynamically and homogeneously distribute high computational workload on heterogeneous parallel architectures such as Grid systems has been implemented to speedup the whole procedure. Experimental results show the robustness of the underlying scheduler, which can be easily exploited in various automatic image analysis systems.
Additional file 4 of Development and validation of prediction model to estimate 10-year risk of all-cause mortality using modern statistical learning…
2021
Additional file 4. Distributions of the variables at baseline before and after multiple imputations.
Data for: Decorous Combinatorial Lower Bounds for Row Layout Problems
2021
Files of the new randomly generated instancesnlengths of the departmentsmatrix with the transport weights THIS DATASET IS ARCHIVED AT DANS/EASY, BUT NOT ACCESSIBLE HERE. TO VIEW A LIST OF FILES AND ACCESS THE FILES IN THIS DATASET CLICK ON THE DOI-LINK ABOVE
Optimal Configuration for N-Dimensional Twin Torus Networks
2014
Torus topology is one of the most common topologies used in the current largest supercomputers. Although 3D torus is widely used, recently some supercomputers in the Top500 list have been built using networks with topologies of five or six dimensions. To obtain an nD torus, 2n ports per node are needed. These ports can be offered by a single or several cards per node. In the second case, there are multiple ways of assigning the dimension and direction of the card ports. In a previous work we proposed the 3D Twin (3DT) torus which uses two 4-port cards per node, and obtained the optimal port configuration. This paper extends and generalizes that work in order to obtain the optimal port confi…
Scheduling independent stochastic tasks under deadline and budget constraints
2018
This article discusses scheduling strategies for the problem of maximizing the expected number of tasks that can be executed on a cloud platform within a given budget and under a deadline constraint. The execution times of tasks follow independent and identically distributed probability laws. The main questions are how many processors to enroll and whether and when to interrupt tasks that have been executing for some time. We provide complexity results and an asymptotically optimal strategy for the problem instance with discrete probability distributions and without deadline. We extend the latter strategy for the general case with continuous distributions and a deadline and we design an ef…
Scheduling under the network of temporo-spatial proximity relationships
2017
We discuss and introduce to the schedulingeld a novel, qualitative optimization model - scheduling under the network of temporo-spatial proximity relationships.We introduce a half perimeter proximity measure as an objective of scheduling.We present and evaluate an incremental Sequence Pair neighborhood evaluation algorithm, applicable to both scheduling and rectangle packing problems in VLSI industry. In this paper, we discuss and introduce to the scheduling field a novel optimization objective - half perimeter proximity measure in scheduling under the network of temporo-spatial proximity relationships. The presented approach enables to qualitatively express various reasons of scheduling ce…