scientific article
From MaRDI portal
Publication:3994933
zbMath0679.68056MaRDI QIDQ3994933
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
optimizationNP-completeapproximation algorithmstask schedulingscheduling algorithmsparallel programprogram partitioningmultiprocessor cost modelprogram graphical representationSISAL single- assignment language
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of operating systems (68N25)
Related Items
Locality-aware task scheduling for homogeneous parallel computing systems, Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays, Methods of resource management in problem-oriented computing environment, Performance bounds for column-block partitioning of parallel Gaussian elimination and Gauss-Jordan methods, Parallel Machine Scheduling with Uncertain Communication Delays, A COMPARISON STUDY OF HEURISTICS FOR MAPPING PARALLEL ALGORITHMS TO MESSAGE-PASSING MULTIPROCESSORS, Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules, An experimental evaluation of local search heuristics for graph partitioning, On-line scheduling of parallel jobs, Parallelising large irregular programs: An experience with Naira, How to pack directed acyclic graphs into small blocks, Extending IC-scheduling via the sweep algorithm, COMPILE-TIME ANALYSIS AND OPTIMIZATION OF EXPLICITLY PARALLEL PROGRAMS*, SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS, Communication Contention Reduction in Joint Scheduling for Optical Grid Computing, Scheduling with uncertainties on new computing platforms, Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems, Automatic implementation of affine iterative algorithms: Design flow and communication synthesis, Reducing Rollbacks Through Partitioning in PCS Parallel Simulation, Clustering and scheduling method based on task duplication, Resource allocation algorithm for light communication grid-based workflows within an SLA context, Optimal and heuristic solution methods for a multiprocessor machine scheduling problem, MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS, Scheduling inverse trees under the communication model of the LogP-machine, Robust scheduling of metaprograms, Two-way dominant sequence clustering for processor scheduling
