{'fraction_non_alphanumeric': 0.013009540329575022, 'fraction_numerical': 0.0, 'mean_word_length': 5.204301075268817, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Concurrent Multithreaded Scheduling Model for Solving Fibonacci Series on Multicore Architecture

The emergence of multicore technology has led to essential changes in the hardware design of personal computers. These changes are represented by an increased growth of cores per chip. As a matter of fact, this growth has imposed new directions in planning not only in the hardware but also in the software side. This study is about developing new algorithms that make a class of software (Divide and Conquer) more adaptable with multicore architecture. We propose one novel algorithm and one enhanced algorithm that prove their ability to perform concurrent multithreaded scheduling for solving Fibonacci series problem on a multicore environment. To put these algorithms to work, we have designed a hierarchal model that is controlled by these algorithms. The designed model has been simulated successfully through a modelling tool. The modelled design solved several shortcomings in the previous studies. Furthermore, it provides a new and efficient way in load-distribution other than incurring a slight overhead to handle sorting from time to time.