This paper presents some ideas for efficiently allocating resources to enhance the performance of gang scheduling. We first introduce a job re-packing scheme. In this scheme we try to rearrange the order of job execution on their originally allocated processors in a scheduling round to combine small fragments of available processors from different time slots together to form a larger and more u...

CDMA interconnect is a new interconnect mechanism for SoC design. This paper presents how a multiprocessor system can benefit from the use of concurrent data transfers: CDMA interconnect has been adopted to implement the shared bus of a multiprocessor system. Unlike the conventional TDMA bus-based multiprocessor system that shows degradation in performance as the number of processing cores incr...

Modern multiprocessor architectures have exacerbated problems of coordinating access to shared data, in particular as regards to the possibility of deadlock. For example semaphores, one of the most basic synchronization primitives, present difficulties. Djikstra defined semaphores to solve the problem of mutual exclusion. Practical implementation of the concept has, however, produced semaphores...

In the paper the problem of mathematical properties of B-operations and weak WB-operations introduced by the author for interpretation of connectives “and”, “or”, and “also” in fuzzy rules is considered. In previous author’s papers some interesting properties of fuzzy systems with these operations were shown. These operations are weaker than triangular norms used commonly for a fuzzy system des...

We present DagPS, a scheduler that improves cluster utilization and job completion times by packing tasks with multi-resource requirements and inter-dependencies. While the underlying scheduling problem is intractable in general, DagPS is nearly optimal on the job DAGs that appear in production clusters at a large enterprise. Our key insight is that carefully handling the long-running tasks and...

A semaphore is a data structure designed to track how many units of some resource are available. It also provides operations to increase or decrease the number, representing the creation or the consumption of that resource, respectively. A process that wishes to consume one unit of the resource, when none are available, will be blocked until one new unit of the resource is created. Semaphores a...

Unified collaborative symmetries have led to many natural advances, including semaphores and e-commerce. Here, we verify the understanding of wide-area networks, which embodies the important principles of operating systems. Ash, our new methodology for RAID, is the solution to all of these grand challenges.

Regression Testing is exclusively executed to guarantee the desirable functionality of existing software after pursuing quite a few amendments or variations in it. Perhaps, it testifies the quality of the modified software by concealing the regressions or software bugs in both functional and non-functional applications of the system. In fact, the maintenance of test suite is enormous as it nece...

A natural encoding of synchronous message exchange with direct wait-control is proved to be equivalent in a distributed environment to a refinement which uses semaphores to implement wait control. The proof uses a most general scheduler, which is left as abstract and assumed to satisfy a few realistic, explicitly stated assumptions. We hope to provide a scheme that can be implemented by current...

Objective: To evaluate the performance of two open-source real-time operating systems (RTOSs), Keil RTX5 and FreeRTOS. Besides, a comparison between them has been also established based on four timing metrics: task switching time, pre-emption semaphore shuffling inter-task messaging latency. All tests have performed an STM32F429 discovery board Cortex-M4 MCUs. Methods: measure metrics, ARM cycl...