Task Partitioning Hybrid Algorithms for Multi-Core Processors

نویسندگان

چکیده

Multi-core Processors Rapidly developing in the world we live and Companies Manufacturers continuous efforts to manufacture faster intelligent chips. The use of multi-core processors has become widespread many areas; therefore, task Partitioning for a hot issue research community. Many types have been done on Task Mapping from various perspectives by researchers. existing partitioning algorithms still negatives, such as low usage processor or not making most cores efficiency processor. However, tasks onto is significant challenge among challenges facing In this paper, solve proposed framework that uses hybrid mix Blocking-Aware Algorithm with First-Fit Decreasing (FFD) algorithm, based each these advantages.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Task Partitioning for Multi-core Network Processors

Network processors (NPs) typically contain multiple concurrent processing cores. State-of-the-art programming techniques for NPs are invariably low-level, requiring programmers to partition code into concurrent tasks early in the design process. This results in programs that are hard to maintain and hard to port to alternative architectures. This paper presents a new approach in which a high-le...

متن کامل

Scheduling Algorithms for Asymmetric Multi-core Processors

— Growing power dissipation due to high performance requirement of processor suggests multicore processor technology, which has become the technology for present and next decade. Research advocates asymmetric multi-core processor system for better utilization of chip real state. However, asymmetric multi core architecture poses a new challenge to operating system scheduler, which traditionally ...

متن کامل

packet reordering algorithms in multi-core network processors

usually in the form of parallel processing with parallel multi-processor systems are designed .for this reason irregular flow may occur with packages. when you're tired and it all comes out in his np (network processors)  system, reset depending on network performance is negatively affected and we delayed to do this, the design of processors working in parallel packet transmission by avoid...

متن کامل

Efficient Breadth-First Search Algorithms for Advanced Multi-core Processors

Multi-core processors are a shift of paradigm in computer architecture that promises a dramatic increase in performance. But multi-core processors also bring an unprecedented level of complexity in algorithmic design and software development. In this paper we describe the challenges involved in designing a breadth-first search (BFS) for advanced multi-core processors. The proposed methodology c...

متن کامل

Hybrid Distributed Shared Memory Space in Multi-core Processors

On multi-core processors, memories are preferably distributed and supporting Distributed Shared Memory (DSM) is essential for the sake of reusing huge amount of legacy code and easy programming. However, the DSM organization imports the inherent overhead of translating virtual memory addresses into physical memory addresses, resulting in negative performance. We observe that, in parallel applic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Information Technologies and Computer Science

سال: 2022

ISSN: ['2736-5492']

DOI: https://doi.org/10.24018/compute.2022.2.6.77