scholarly journals Semi-on-line multiprocessor scheduling with given total processing time

2005 ◽  
Vol 337 (1-3) ◽  
pp. 134-146 ◽  
Author(s):  
T.C. Edwin Cheng ◽  
Hans Kellerer ◽  
Vladimir Kotov
Keyword(s):  
Processing Time ◽  
Multiprocessor Scheduling ◽  
Total Processing Time ◽  
On Line

An efficient algorithm for semi-online multiprocessor scheduling with given total processing time

2015 ◽  
Vol 18 (6) ◽  
pp. 623-630 ◽  
Author(s):  
Hans Kellerer ◽  
Vladimir Kotov ◽  
Michaël Gabay
Keyword(s):  
Efficient Algorithm ◽  
Processing Time ◽  
Multiprocessor Scheduling ◽  
Total Processing Time

Cell Block Optimization: A Comparative Study of Quality Variables in 4 Different Cell Block Methods

2021 ◽  
pp. 1-7
Author(s):  
Marsali Newman ◽  
Matthew Walsh ◽  
Rosemary Jeffrey ◽  
Richard Hiscock
Keyword(s):  
Comparative Study ◽  
Processing Time ◽  
Morphological Features ◽  
Cell Block ◽  
Total Processing Time ◽  
Block Methods ◽  
Molecular Studies ◽  
Agar Method ◽  
Md Anderson ◽  
Ancillary Studies

<b><i>Objective:</i></b> The cell block (CB) is an important adjunct to cytological preparations in diagnostic cytopathology. Optimizing cellular material in the CB is essential to the success of ancillary studies such as immunohistochemistry (IHC) and molecular studies (MS). Our aim was to identify which CB method was most suitable in a variety of specimen types and levels of cellularity. <b><i>Study Design:</i></b> We assessed 4 different CB methods, thrombin clot method (TCM), MD Anderson method (MDAM), gelatin foam method (GFM), and agar method (AM), with descriptive observations and ranking of the methods based on quantity of cells and morphological features. <b><i>Results:</i></b> TCM performed best in ranking for both quantity of cells and morphological features, followed by MDAM, GFM, and AM. Lack of adjuvant in the MDAM resulted in some unique morphological advantages which, however, also resulted in inconsistent performance. In low cellularity cases insufficient cells were frequently identified on slides from MDAM and AM CBs. Technique touch time was similar for all methods, with total processing time being shortest for TCM followed by MDAM, GFM, and AM. <b><i>Conclusions:</i></b> TCM was the most robust CB technique, retaining high scores for ranking of quantity and morphology in a variety of specimen cellularities and specimen types.

scholarly journals Semi-Online Scheduling on Two Machines withGoSLevels and Partial Information of Processing Time

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Taibo Luo ◽  
Yinfeng Xu
Keyword(s):  
Processing Time ◽  
Parallel Machines ◽  
Partial Information ◽  
Online Scheduling ◽  
Scheduling Problems ◽  
Total Processing Time ◽  
Grade Of Service ◽  
Two Machines

This paper investigates semi-online scheduling problems on two parallel machines under a grade of service (GoS) provision subject to minimize the makespan. We consider three different semi-online versions with knowing the total processing time of the jobs with higherGoSlevel, knowing the total processing time of the jobs with lowerGoSlevel, or knowing both in advance. Respectively, for the three semi-online versions, we develop algorithms with competitive ratios of3/2,20/13, and4/3which are shown to be optimal.

Scalable Algorithms for Server Allocation in Infostations

2010 ◽  
pp. 645-656
Author(s):  
Alan A. Bertossi ◽  
M. Cristina Pinotti ◽  
Phalguni Gupta
Keyword(s):  
Bin Packing ◽  
Multiprocessor Scheduling ◽  
Interval Graph ◽  
Scalable Algorithms ◽  
Coverage Area ◽  
Special Cases ◽  
Minimum Number ◽  
Server Allocation ◽  
On Line ◽  
Web Surfing

The server allocation problem arises in isolated infostations, where mobile users going through the coverage area require immediate high-bit rate communications such as web surfing, file transferring, voice messaging, email and fax. Given a set of service requests, each characterized by a temporal interval and a category, an integer k, and an integer hc for each category c, the problem consists in assigning a server to each request in such a way that at most k mutually simultaneous requests are assigned to the same server at the same time, out of which at most hc are of category c, and the minimum number of servers is used. Since this problem is computationally intractable, a scalable 2-approximation online algorithm is exhibited. Generalizations of the problem are considered, which contain bin-packing, multiprocessor scheduling, and interval graph coloring as special cases, and admit scalable on-line algorithms providing constant approximations.

Restructured Pork From Hot Processed Sow Meat: Effect of Mechanical Tenderization and Liquid Smoke

1986 ◽  
Vol 49 (8) ◽  
pp. 639-642 ◽  
Author(s):  
JOSEPH C. CORDRAY ◽  
DALE L. HUFFMAN ◽  
WILLIAM R. JONES
Keyword(s):  
Connective Tissue ◽  
Factorial Design ◽  
Fat Mass ◽  
Processing Time ◽  
Total Processing Time ◽  
Treatment Groups ◽  
Liquid Smoke ◽  
Fresh Frozen ◽  
Fully Cooked ◽  
Restructured Pork

A 2 × 2 factorial design was used to study the effect of tenderization and liquid smoke on sensory and physical attribution of a fully cooked restructured pork item. The lean and fat mass was removed intact within 30 min postmortem from sow carcasses and assigned to a tenderized or non-tenderized treatment with and without liquid smoke. The four treatment groups were: non-tenderized, no liquid smoke (NTNS); non-tenderized with liquid smoke (NTS); tenderized, no liquid smoke (TNS); and tenderized with liquid smoke (TS). Mechanical tenderization was accomplished 1 h postmortem and the two original portions were subdivided for a 1% acid-neutralized liquid smoke treatment. Total processing time from exsanguination to a fully cooked product was 8 h. There were no differences (P&gt;0.05) among any of the treatments for cohesiveness, juiciness, flavor or connective tissue scores or cooking loss. The TNS treatment had higher (P&lt;0.06) tension values as determined by Instron measurements than the NTNS treatment. There were initially no practical differences between TBA values for fresh-frozen and cooked-frozen restructured pork. However, after 30 d of storage (−23°C), the cooked-frozen product had significantly higher TBA values than fresh-frozen product.

scholarly journals Managing Energy Plus Performance in Data Centers and Battery-Based Devices Using an Online Non-Clairvoyant Speed-Bounded Multiprocessor Scheduling

2020 ◽  
Vol 10 (7) ◽  
pp. 2459 ◽  
Author(s):  
Pawan Singh ◽  
Baseem Khan ◽  
Om Prakash Mahela ◽  
Hassan Haes Alhelou ◽  
Ghassan Hayek
Keyword(s):  
Energy Management ◽  
Completion Time ◽  
Processing Time ◽  
Data Centers ◽  
Function Analysis ◽  
Multiprocessor Scheduling ◽  
Flow Time ◽  
Service Cost ◽  
Energy Plus ◽  
Time Required

An efficient scheduling reduces the time required to process the jobs, and energy management decreases the service cost as well as increases the lifetime of a battery. A balanced trade-off between the energy consumed and processing time gives an ideal objective for scheduling jobs in data centers and battery based devices. An online multiprocessor scheduling multiprocessor with bounded speed (MBS) is proposed in this paper. The objective of MBS is to minimize the importance-based flow time plus energy (IbFt+E), wherein the jobs arrive over time and the job’s sizes are known only at completion time. Every processor can execute at a different speed, to reduce the energy consumption. MBS is using the tradition power function and bounded speed model. The functioning of MBS is evaluated by utilizing potential function analysis against an offline adversary. For processors m ≥ 2, MBS is O(1)-competitive. The working of a set of jobs is simulated to compare MBS with the best known non-clairvoyant scheduling. The comparative analysis shows that the MBS outperforms other algorithms. The competitiveness of MBS is the least to date.

Two methods for processing yield maps from multiple sensors in large vineyards in California

2017 ◽  
Vol 8 (2) ◽  
pp. 530-533 ◽  
Author(s):  
B. Sams ◽  
C. Litchfield ◽  
L. Sanchez ◽  
N. Dokoozlian
Keyword(s):  
Processing Time ◽  
Fruit Weight ◽  
Wine Grape ◽  
Total Processing Time ◽  
Yield Mapping ◽  
Processing Methods ◽  
Multiple Sensors ◽  
Level Method ◽  
Mapping Techniques ◽  
New Processing

Yield mapping techniques have only recently started to be implemented by the Californian wine grape industry, but the advancement has necessitated new processing methods for large vineyards. The process for mapping large blocks harvested with multiple machines has only recently occurred and implies that their yield monitors have to be calibrated and corrected to the same scale. Here we discuss two methods for processing yield maps at the commercial level. Method 1 depends on many calibrations with delivered fruit weight to a winery. Method 2 normalizes raw files automatically can reduce total processing time by up to 90%.

Right Ventricle Segmentation from Heart using Active Contour Model without Edge and Split Plane Decision

2018 ◽  
Vol 7 (3.33) ◽  
pp. 1
Author(s):  
Ho Chul Kang ◽  
. .
Keyword(s):  
Right Ventricle ◽  
Processing Time ◽  
Active Contour Model ◽  
Automatic Segmentation ◽  
Total Processing Time ◽  
Anisotropic Diffusion Filter ◽  
Computational Performance ◽  
Volume Of Interest ◽  
Whole Heart ◽  
Cardiac Diagnosis

In this paper, we propose an automatic segmentation method of right ventricle from computed tomography angiography (CTA) using Chan-Vese model and split plane detection. First, we remove noise in the images by applying anisotropic diffusion filter and extract the whole heart using Otsu Thresholding. Second, the volume of interest (VOI) is detected by Chan-Vese model and morpholotical operation. Third, we divide the heart to left and right region using power watershed. Finally we detect split plane which divide right heart to right ventricle and atrium. We tested our method in ten CT images and they were obtained from a different patient. For the evaluation of the computational performance of the proposed method, we measured the total processing time. The average of total processing time, from first step to third step, was 13.92±1.28 s. We expect for our method to be used in cardiac diagnosis for cardiologist.  

Heating Position Planning in Laser Forming of Single Curved Shapes Based on Probability Convergence

2016 ◽  
Vol 138 (9) ◽  
Author(s):  
Hong Shen ◽  
Yutao Zheng ◽  
Han Wang ◽  
Zhenqiang Yao
Keyword(s):  
Experimental Data ◽  
Inverse Problem ◽  
Minimum Distance ◽  
Processing Time ◽  
Probability Function ◽  
Laser Forming ◽  
Total Processing Time ◽  
Processing Efficiency ◽  
Bending Angle

Inverse problem in laser forming involves the heating position planning and the determination of heating parameters. In this study, the heating positions are optimized in laser forming of single curved shapes based on the processing efficiency. The algorithm uses a probability function to initialize the heating position that is considered to be the bending points. The optimization process is to minimize the total processing time through adjusting the heating positions by considering the boundary conditions of the offset distances, the minimum bending angle, and the minimum distance between two adjacent heating positions. The optimized results are compared with those obtained by the distance-based model as well as the experimental data.

SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES

2005 ◽  
Vol 22 (02) ◽  
pp. 229-237 ◽  
Author(s):  
RUN-ZI LUO ◽  
SHI-JIE SUN
Keyword(s):  
Competitive Ratio ◽  
Completion Time ◽  
Processing Time ◽  
Scheduling Problem ◽  
Uniform Machines ◽  
On Line ◽  
Special Case

In this paper, we investigate a semi-on-line version for a special case of three machines M1, M2, M3 where the processing time of the largest job is known in advance. A speed si(s1 = s2 = 1, 1 ≤ s3 = s) is associated with machine Mi. Our goal is to maximize the C min — the minimum workload of three machines. We give a C min 3 algorithm and prove its competitive ratio is [Formula: see text] and the algorithm is the best possible for 1 ≤ s ≤ 2. We also claim the competitive ratio of algorithm C min 3 is tight.

Sign in / Sign up

Export Citation Format

Share Document