Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-18263-6_20
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Semi-Online Preemptive Scheduling: One Algorithm for All Variants

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2010English

C&en Jobs Online

Chemical and Engineering News
Chemical Engineering
2015English

Competitive Dynamic Multiprocessor Allocation for Parallel Applications

Parallel Processing Letters
HardwareTheoretical Computer ScienceArchitectureSoftware
1997English

Competitive Algorithms for an Online Rent or Buy Problem With Variable Demand

SIAM Undergraduate Research Online
2014English

A Fully Preemptive Multiprocessor Semaphore Protocol for Latency-Sensitive Real-Time Applications

2013English

Scheduling Multiprocessor Tasks With Genetic Algorithms

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
1999English

Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
2009English

Approximation Algorithms for the Multiprocessor Open Shop Scheduling Problem

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
1999English

Competitive Helping in Online Giving

Current Biology
GeneticsMolecular BiologyBiochemistryBiological SciencesNeuroscienceAgricultural
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy