akeshma Goto Github PK

infographics

Infographics related to HTML, CSS, JavaScript.

ionic-app

Created with StackBlitz ⚡️

ionic-firebase-starter-app

Ionic 4 firebase CRUD tutorial to learn how to create a firebase application to perform Authentication and all CRUD operations in an ionic 4 application. You can use this FREE Ionic Firebase Starter App as a base to create your Ionic App with Firebase backend :)

iot-for-beginners

12 Weeks, 24 Lessons, IoT for All!

learn-cpp

Codecademy | Learn C++

learning-angular--third-edition

multitasking-realtime-arduino-system

This simple project shows how Arduino can be used with a Real-Time OS. The project is designed to show how Arduino can be integrated with a Real-Time operating system and how to use hardware and software components. It's a simple and fun project for those who have a basic level of programming and knowledge of basic hardware components.

phoneapp

ionic 5 project App

pi-hole

A black hole for Internet advertisements

process-scheduling-algorithms

C implementation of different process scheduling algorithms

project_mern_memories

This is a code repository for the corresponding video tutorial. Using React, Node.js, Express & MongoDB you'll learn how to build a Full Stack MERN Application - from start to finish. The App is called "Memories" and it is a simple social media app that allows users to post interesting events that happened in their lives.

python-intro

A set of Python exercises led by hints in comments - suitable for beginner / intermediate level

real-time-scheduling-algorithms

RT, DT, WCET, Test cases

responsive-web-site-by-akeshma

Created with StackBlitz ⚡️

sched-deadline-archive

An implementation of the popular Earliest Deadline First (EDF) scheduling algorithm or the Linux kernel. It is still experimental code, and it is still continuously being improved, but it already is a fully-working solution for supporting typical real-time applications in GNU/Linux environments.

smart_home

sys-prog-examples

Simple C programs demonstrating different aspects of programming on Linux.

task-scheduler-for-embeded-system

Background :An embedded system is a computer system performing dedicated functions within a larger mechanical or electrical system. Embedded systems range from portable devices such as Google Glasses, to large stationary installations like traffic lights, factory controllers, and complex systems like hybrid vehicles, and avionic. Typically, the software of an embedded system consists of a set of tasks (threads) with timing constraints. Typical timing constraints are release times and deadlines. A release time specifies the earliest time a task can start, and a deadline is the latest time by which a task needs to finish. One major goal of embedded system design is to find a feasible schedule for the task set such that all the timing constraints are satisfied. Task scheduler We assume that the hardware platform of the target embedded systems is a single processor with m identical cores, Core1, Core2, …, Corem. The task set V={v1, v2, …, vn} consists of n independent, non-pre-emptible tasks. A non-pre-emptible task cannot be pre-empted by another task during its execution, i.e., it runs to completion without being interrupted. Each task vi (i=1, 2, …, n) has four attributes: a unique task name vi, an execution time ci, a release time ri, and a deadline di (di>ri). All the execution times, the release times and deadlines are non-negative integers. You need to design a task scheduler and implement it in C. Your task scheduler uses EDF (Earliest Deadline First) heuristic to find a feasible schedule for a task set. A schedule of a task set specifies when each task starts and on which core it is executed. A feasible schedule is a schedule satisfying all the release time and deadline constraints. The problem of finding a feasible schedule for this task scheduling problem is NP-complete. It is widely believed that an NP-complete problem has no polynomial-time algorithm. However, nobody can prove it. First, we introduce two definitions: scheduling point and ready task. • A scheduling point is a time point at which a task can be scheduled on a core, In other words, a scheduling point is either the release time or the completion time of a task. • A task vi (i=1, 2, …, n) is ready at a time t if tri holds. The EDF scheduling heuristic works as follows: • At each scheduling point ti (titi+1, i=1, 2, …), among all the ready tasks, find a task with the smallest deadline, and schedule it on an idle core such that its start time is minimized. Ties are broken arbitrarily. Since this task scheduling problem is NP-complete, the EDF heuristic is not guaranteed to find a feasible schedule even if a feasible schedule exists.

tetris

Implementation of Tetris in C.

ts-stats

Gives statistics about your TypeScript files

wch32_macos

Easy instructions and examples for build and flash programs for WCH32 series RISC-V MCUs on Apple Silicon Mac.

web-platform-jquery-by-akeshma

Created with StackBlitz ⚡️

wyliodrinstudio

Wyliodrin STUDIO