Comparative Performance Evaluation of Non-Contiguous Allocation Algorithms in 2D Mesh-Connected Multicomputers

No abstract is available for this paper.

• Publication year

  2010

• Venue

  2010 10th IEEE International Conference on Computer and Information Technology

• Publication date

  2010-06-29

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/CIT.2010.490
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Comparative evaluation of contiguous allocation strategies on 3D mesh multicomputers

  2009influential reference
• Availability-based noncontiguous processor allocation policies for 2D mesh-connected multicomputers

  2008influential reference
• An efficient non-contiguous processor allocation strategy for 2D mesh connected multicomputers

  2007influential reference
• A new processor allocation strategy using ESS (expanding square strategy)

  2006influential reference
• An efficient free-list submesh allocation scheme for two-dimensional mesh-connected multicomputers

  2006cited by this paper
• Processor Allocation in Mesh Multiprocessors Using a Hybrid Method

  2006influential reference
• An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead

  1999cited by this paper
• Performance Improvement of Allocation Schemes for Mesh-Connected Computers

  1998influential reference
• Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers

  1997influential reference
• Minimizing Message-Passing Contention in Fragmentation-Free Processor Allocation

  1997cited by this paper
• Allocating Precise Submeshes in Mesh Connected Systems

  1994influential reference
• Efficient Processor Allocation Strategie for Mesh-Connected Parallel Computers

  1992cited by this paper
• A Two-Dimensional Buddy System for Dynamic Resource Allocation in a Partitionable Mesh Connected System

  1991cited by this paper
• iWarp: a 100-MOPS, LIW microprocessor for multicomputers

  1991cited by this paper
• A two dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system

  1990influential reference

• An Efficient All Shapes Busy List Processor Allocation Algorithm for 3D Mesh Multicomputers

  2017cites this paper
• All shapes busy list contiguous allocation strategy for 3D mesh multicomputers

  2016cites this paper
• The Effect of Real Workloads and Synthetic Workloads on the Performance of Job Scheduling for Non-Contiguous Allocation in 2D Mesh Multicomputers

  2015cites this paper
• A New Compacting Non-Contiguous Processor Allocation Algorithm for 2D Mesh Multicomputers

  2015cites this paper
• An Approach of Finding Maximal Submeshes for Task Allocation Algorithms in Mesh Structures

  2014cites this paper
• Submesh allocation in 2D-mesh multicomputers: partitioning at the longest dimension of requests

  2013cites this paper
• Comparison of Allocation Algorithms in Mesh Oriented Structures for Different Scheduling Techniques

  2012cites this paper
• Non-contiguous processor allocation in the mesh-connected multicomputers using compaction

  2012cites this paper
• On the performance of job scheduling for noncontiguous allocation in 2D mesh-connected multicomputers

  2012cites this paper