Improving system performance in non-contiguous processor allocation for mesh interconnection networks

Contiguous processor allocation is useful for security and accounting reasons. This is due to the allocated jobs are separated from one another, where each sub-mesh of processors is allocated to an exclusive job request, and the allocated sub-mesh has the same size and shape of the requested job. The size and shape constraint leads to high processor fragmentation. Most recent contiguous allocation strategies suggested for 3D mesh-connected multiconputers try all possible orientations of an allocation request when allocation fails for the requested orientation, which reduces processor fragmentation and hence improves system performance. However, none of them considers all shapes of the request in the process of allocation. To generalize this restricted rotation, we propose, in this paper, a new contiguous allocation strategy for 3D mesh-connected multicomputers, referred to as All Shapes Busy List (ASBL for short), which takes into consideration all possible contiguous request shapes when attempting allocation for a job request. ASBL depends on the list of allocated sub-meshes, in the method suggested in (Bani-Mohammad et al., 2006), for selecting an allocated sub-mesh. The performance of the proposed ASBL allocation strategy has been evaluated considering several important scheduling strategies under a variety of system loads based on different job size distributions. The simulation results have shown that the ASBL allocation strategy improves system performance in terms of parameters such as the average turnaround time of jobs and system utilization under all scheduling strategies considered.

Download Full-text

Corner-Boundary Processor Allocation for 3D Mesh-Connected Multicomputers

International Journal of Cloud Applications and Computing ◽

10.4018/ijcac.2015010101 ◽

2015 ◽

Vol 5 (1) ◽

pp. 1-13 ◽

Cited By ~ 4

Author(s):

Ismail M. Ababneh ◽

Saad Bani-Mohammad ◽

Motasem Al Smadi

Keyword(s):

System Performance ◽

Allocation Strategy ◽

Processor Allocation ◽

Simulation Experiments ◽

3D Mesh ◽

Extensive Simulation ◽

System Utilization ◽

Free List ◽

Simulation Results ◽

Allocation Strategies

This research paper presents a new contiguous allocation strategy for 3D mesh-connected multicomputers. The proposed strategy maintains a list of maximal free sub-meshes and gives priority to allocating corner and boundary free sub-meshes. The goal of corner and boundary allocation is to decrease the number of leftover free sub-meshes and increase their sizes, which is expected to reduce processor fragmentation and improve overall system performance. The proposed strategy, which is referred to as Turning Corner-Boundary Free List (TCBFL) strategy, is compared, using extensive simulation experiments, to several existing allocation strategies for 3D meshes. These are the First-Fit (FF), Turning First-Fit Free List (TFFFL), and Turning Busy List (TBL) allocation strategies. The simulation results show that TCBFL produces average turnaround times and mean system utilization values that are superior to those of previous strategies.

Download Full-text

Performance Analysis and Evaluation of Ternary Optical Computer Based on Asynchronous Multiple Vacations

10.21203/rs.3.rs-995288/v1 ◽

2021 ◽

Author(s):

Wang Xianchao ◽

Wang Xianchuan ◽

Zhang Jie ◽

Ling Man ◽

Hou Dayou ◽

...

Keyword(s):

System Performance ◽

Scheduling Algorithm ◽

Processor Allocation ◽

Simulation Experiments ◽

Analysis And Evaluation ◽

Task Scheduling Algorithm ◽

Computer Based ◽

Optical Computer ◽

Optical Processor ◽

Ternary Optical Computer

Abstract Ternary optical computer(TOC) has become a research hotspot in the field because of the advantages such as inherent parallelism, numerous trits, low power consumption, extendibility, bitwise allocability and dynamical bitwise reconfigurability. Meanwhile, its performance evaluation attracts more and more attentions from potential users and researchers. To model its computing ecology more accurately, this paper first builds a three-staged TOC service model by introducing asynchronous multi-vacations and tandem queueing, and then proposes a task scheduling algorithm and an optical processor allocation algorithm with asynchronous vacations of some small optical processors after dividing equally the entire optical processor into several small optical processors which can be used independently. At the same time, the analytical model was established to obtain important performance indicators such as response time, the number of tasks and utilization of optical processor, based on M/M/1 and M/M/n queuing system with asynchronous multi-vacations. In addition, relevant numerical simulation experiments are conducted. The results illustrate that the number of small optical processors, vacation rate and the number of small optical processors allowed to be on vacation have important effects on the system performance. Compared with synchronous vacation, asynchronous vacation not only ensures the system to obtain better maintenance but also improves the system performance to some degree.

Download Full-text

PROCESSOR ALLOCATION AND JOB SCHEDULING ON 3D MESH INTERCONNECTION NETWORKS

International Journal of Computers and Applications ◽

10.2316/journal.202.2007.3.202-2230 ◽

2007 ◽

Vol 29 (3) ◽

Keyword(s):

Interconnection Networks ◽

Job Scheduling ◽

Processor Allocation ◽

3D Mesh

Download Full-text

ON HIERARCHICAL CONFIGURATION OF DISTRIBUTED SYSTEMS ON MESH AND HYPERCUBE

International Journal of Foundations of Computer Science ◽

10.1142/s0129054104002583 ◽

2004 ◽

Vol 15 (03) ◽

pp. 517-534 ◽

Cited By ~ 4

Author(s):

DAJIN WANG ◽

JIANNONG CAO

Keyword(s):

Distributed Systems ◽

Distributed Computing ◽

Traffic Flow ◽

System Performance ◽

Interconnection Networks ◽

Heuristic Algorithms ◽

Network Routing ◽

Distributed Monitoring ◽

Hierarchical Partition ◽

Distributed Processes

We study hierarchical configuration of distributed systems for achieving optimized system performance. A distributed system consists of a collection of local processes which are distributed over a network of processors, and work in a cooperative manner to fulfill various tasks. A hierarchical approach is to group and organize the distributed processes into a logical hierarchy of multiple levels, so as to coordinate the local computation/control activities to improve the overall system performance. It has been proposed as an effective way to solve various problems in distributed computing, such as distributed monitoring, resource scheduling, and network routing. The optimization problem considered in this paper is concerned with finding an optimal hierarchical partition of the processors, so that the total traffic flow over the network is minimized. The problem in its general form has been known to be NP-hard. Therefore, we just focus on distributed computing jobs which require collecting and processing information from all processors. By limiting levels of the hierarchy to two, we will establish the analytically optimal hierarchical configurations for two popular interconnection networks: mesh and hypercube. Based on analytical results, partitioning algorithms are proposed to achieve minimal communication cost (network traffic flow). We will also present and discuss heuristic algorithms for multiple-level hierarchical partitions.

Download Full-text