Production and Stabilization of Real-Time Task Schedules
Journal of the ACM (JACM)
An Estimate of the Store Size Necessary for Dynamic Storage Allocation
Journal of the ACM (JACM)
Operating Systems Theory
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Heuristic programming applied to scheduling problems
Heuristic programming applied to scheduling problems
A n5/2 algorithm for maximum matchings in bipartite
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Establishing lower bounds on algorithms: a survey
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Guided self-scheduling: A practical scheduling scheme for parallel supercomputers
IEEE Transactions on Computers
A Survey of Some Theoretical Aspects of Multiprocessing
ACM Computing Surveys (CSUR)
Performance of Evolutionary Approaches for Parallel Task Scheduling under Different Representations
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Conventional and Multirecombinative Evolutionary Algorithms for the Parallel Task Scheduling Problem
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Preemptive Multiprocessor Scheduling Anomalies
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules
IEEE Transactions on Computers
Multidimensional bin packing algorithms
IBM Journal of Research and Development
Scheduling as a graph transformation
IBM Journal of Research and Development
Computation of lower bounds for multiprocessor schedules
IBM Journal of Research and Development
Parametric Packing of Selfish Items and the Subset Sum Algorithm
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Modified subset sum heuristics for bin packing
Information Processing Letters
NP-complete scheduling problems
Journal of Computer and System Sciences
Neighborhood search algorithms for guaranteeingoptimal traveling salesman tours must be inefficient
Journal of Computer and System Sciences
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Power in unity: forming teams in large-scale community systems
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
A model of computation for MapReduce
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
Scheduling jobs on grid processors
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Online team formation in social networks
Proceedings of the 21st international conference on World Wide Web
Online variable-sized bin packing with conflicts
Discrete Optimization
Worst-case analysis of the subset sum algorithm for bin packing
Operations Research Letters
| Hi-index | 0.01 |
It has been known for some time that certain rather general models of multiprocessing systems frequently exhibit behavior which could be termed "anomalous," e.g., an increase in the number of processors of the system can cause an increase in the time used to complete a job. In order to fully realize the potential benefits afforded by parallel processing, it becomes important to understand the underlying causes of this behavior and the extent to which the resulting system performance may be degraded.