57 Hits in 12.0 sec

Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails

Mohamed Haouari, Anis Gharbi
2004 Annals of Operations Research  
In this paper, we investigate new lower bounds for the P=r j ; q j =C max scheduling problem.  ...  A new bin packing based lower bound, as well as several new lifting procedures are derived for this strongly N P-hard problem.  ...  In particular, it arises as a strong relaxation of the Multiprocessor Flow Shop problem (Hoogeveen et al.  ... 
doi:10.1023/b:anor.0000030688.31785.40 fatcat:zyf24rb3hfh7pbv5w7lwhz5lci

Static scheduling algorithms for allocating directed task graphs to multiprocessors

Yu-Kwong Kwok, Ishfaq Ahmad
1999 ACM Computing Surveys  
The PDI method is applied to the job-shop scheduling problem in which a set of independent jobs are scheduled to homogeneous machines. De Falco et al.  ...  The LWB Algorithm We call the algorithm the LWB (Lower Bound) algorithm [37] based on its main principle: it first determines the lower bound start-time for each node, and then identifies a set of critical  ... 
doi:10.1145/344588.344618 fatcat:ipphnrze6febrlqketoc46s65i

Elements of Scheduling [article]

Jan Karel Lenstra, David B. Shmoys
2020 arXiv   pre-print
We continue to receive requests from colleagues who look for a text on the elements of scheduling at an advanced undergraduate or early graduate level.  ...  It was a natural idea to turn the theses into a textbook on scheduling.  ...  We shall encounter the head-body-tail problem in Chapters 13 and 14, where it arises quite naturally as a relaxation of flow shop and job shop scheduling problems.  ... 
arXiv:2001.06005v1 fatcat:5w7dwzh6nrbb7ateihvrac3734

Accelerating scientific discovery through computation and visualization II

J.S. Sims, W.L. George, S.G. Satterfield, H.K. Hung, J.G. Hagedorn, P.M. Ketcham, T.J. Griffin, S.A. Hagstrom, J.C. Franiatte, G.W. Bryant, W. Jaskolski, N.S. Martys (+13 others)
2002 Journal of Research of the National Institute of Standards and Technology  
It describes, through examples, how the Scientific Applications and Visualization Group (SAVG) at NIST has utilized high performance parallel computing, visualization, and machine learning to accelerate  ...  The examples include scientific collaborations in the following areas: (1) High Precision Energies for few electron atomic systems, (2) Flows of suspensions, (3) X-ray absorption, (4) Molecular dynamics  ...  Bob Crosson, Darcy Barnett and Don Koss and the other members of the Enterprise Systems Administration Group for their assistance.  ... 
doi:10.6028/jres.107.019 pmid:27446728 pmcid:PMC4861354 fatcat:ruag2u2zojgy3aorp5xouxoxd4

A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

Yudong Zhang, Shuihua Wang, Genlin Ji
2015 Mathematical Problems in Engineering  
It is hoped that this survey would be beneficial for the researchers studying PSO algorithms.  ...  On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research  ...  The proposed metaheuristic scheme was applied to a flow shop with multiprocessors scheduling problem. GPU Computing.  ... 
doi:10.1155/2015/931256 fatcat:ubc5eywnhzdjllxjaywe4czhnm

14th International Symposium on Mathematical Programming

1990 Mathematical programming  
It is shown that for the success of the variant dom must ful ll a regularity property and that the choice of the normal vectors must meet some demands.Both requirements are ful lled if dom is polyhedral  ...  A v ariation of bundle methods is presented by means of which such a t ype of problems can be solved.In this variation a dynamic polyhedral model of dom is generated by means of normal vectors.In addition  ...  Keywords: heuristics -job shop -parallel machines -scheduling This paper deals with the job-shop problem with parallel machines. The problemcan be formulated as follows.  ... 
doi:10.1007/bf01580875 fatcat:3jtclwmntzgjxkqs5uecombdaa

Subject Index to Volumes 1–75

2001 Information Processing Letters  
improvement problems, 3748 languages, 879, 1449 network, 375, 2820, 3779 flow of control, 178 schemes, 995 flow of data, 1047, 1598 potential, 375 problem, 375, 3724 flow shop, 519, 1180 flow  ...  the insertion sort, 580 Shende, Sunil M., 3801 Sherman, Alan T., 3634 Shiau and Yang, 3662 Shiau, Shyue-Horng,, 3399 , 2567 models of parallel computation, 2562 multiprocessors, 3137 processor design  ...  , 694 rank of a matrix, 3196 order n matrices, 623 tensors, 719 the adjacency matrix of a line graph, 252 rank one matrices, 1164 matrix, 472 rank queries, 1761 r decision trees, 2406 rankable set, 3245  ... 
doi:10.1016/s0020-0190(01)00175-2 fatcat:5y67tfm6yfbblakrus5nnhs73e

Invalidation-Based Protocols for Replicated Datastores [article]

Antonios Katsarakis
2021 arXiv   pre-print
Based on this insight, we draw inspiration from the multiprocessor for high-performance, strongly consistent replication in the datacenter.  ...  In other words, the common operating environment inside a datacenter closely resembles that of a multiprocessor.  ...  However, if a non-tail node attempts to serve a read for which it has seen a write message propagating downstream from head to tail, but has not seen the acknowledgment propagating upstream, then the tail  ... 
arXiv:2112.02405v1 fatcat:toi3wflouvbzngpdfzypw3l4li

Nongradient Methods in Multidisciplinary Design Optimization-Status and Potential

Prabhat Hajela
1999 Journal of Aircraft  
Constraints included in this problem pertain to upper and lower bounds on turning and swirl at stage exit for each of the three stages.  ...  The decimal numbers can be stacked head- to-tail to create a string that represents the total design. Simi- larly, integer numbers” can be used to represent discrete values of design variables.  ... 
doi:10.2514/2.2432 fatcat:a7uwxyqxsnafvmhijgswxdzwje

Flow Shop Scheduling [chapter]

International Handbook on Information Systems  
The type of factory layout in the general case -handled in Chapter 10 -is the job shop; the particular case where each job is processed on a set of machines in the same order is the flow shop.  ...  For convenience, let us assume that any two consecutive tasks of the same job are to be processed on different machines.  ...  The optimal value of a preemptive solution of the one machine problem is mLB2. The next lower bound tries to take into account the heads and tails of different operations in a more efficient way.  ... 
doi:10.1007/978-3-540-32220-7_8 fatcat:lpbh66dg6rchlabnmjhdp5wnli

Using complexity to protect elections

Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2010 Communications of the ACM  
to compiler technology and parallel computing, which have improved the cost-effectiveness of multiprocessor computing.  ...  In both of these systems one considers each pair of candidates and awards one point to the winner in their head-to-head majority-rule contest, and if the head-to-head contest is a tie, in Copeland each  ...  Applicants must send: 1) statements on teaching, research, and interest/qualifications for this position, 2) a copy of their graduate transcript, 3) a curriculum vita, and 4) names and contact information  ... 
doi:10.1145/1839676.1839696 fatcat:hbqpm5boabe3jcpa4jcs7czf6y

User-defined schedulers for real-time concurrent objects

Joakim Bjørk, Frank S. de Boer, Einar Broch Johnsen, Rudolf Schlatte, S. Lizeth Tapia Tarifa
2012 Innovations in Systems and Software Engineering  
The increasing popularity of virtualized services and cloud computing, offering elastic and scalable computing resources challenges software engineering methods by asking a number of new questions: How  ...  This thesis proposes a methodology for the modeling and analysis of object-oriented distributed applications that are able to adapt to changes in client traffic, so that they can keep desired levels of  ...  Bruce Berriman and Ewa Deelman for helping us with additional details of the Montage case study.  ... 
doi:10.1007/s11334-012-0184-5 fatcat:tt2rgrdgubdobm2mq5kwtq2xkm

Eastern Cardiothoracic Surgical Society 55th Annual Meeting

2018 Innovations (Philadelphia): technology and techniques in cardiothoracic and vascular surgery  
Lysolipid has only one acyl chain, arranging the molecule into a conical shape with a relatively large head group compared to its single hydrocarbon tail.  ...  It has been hypothesized that, in flight, its flattened body acts as a wing, while the tail provides flight control.  ... 
doi:10.1097/imi.0000000000000471 fatcat:m7dkilztybhelp2q6upbwkkyle

New Atlantis revisited: Akademgorodok, the Siberian city of science

1998 ChoiceReviews  
MARS was intended to achieve simultaneous parallel processing of different fragments of one and the same problem, so-called parallel programming.  ...  on computer architecture, languages, and programs for fourth-and fifth-generation parallel computer systems in the Computer Center.  ...  The institute' s deputy director, Rudolf Salganik, headed the laboratory of nucleic acids and worked on nuclease antivirus preparations for the treatment of certain serious viruses in man, bees, and silkworms  ... 
doi:10.5860/choice.35-3826 fatcat:gmfmx3c6qja75giys4lweboxfu

Hints and Principles for Computer System Design [article]

Butler Lampson
2021 arXiv   pre-print
It also gives some principles for system design that are more than just hints, and many examples of how to apply the ideas.  ...  This new long version of my 1983 paper suggests the goals you might have for your system -- Simple, Timely, Efficient, Adaptable, Dependable, Yummy (STEADY) -- and techniques for achieving them -- Approximate  ...  R7 Fragmenting bounds the variation in latency, and it also reduces head-of-line blocking: small jobs stuck behind big ones.  ... 
arXiv:2011.02455v3 fatcat:jolyz5lknjdbpjpxjcrx5rh6fa
« Previous Showing results 1 — 15 out of 57 results