This paper presents a survey about real-time scheduling on multicore computers. We note that in this survey, the workloads of the cores are taken into account while allocating them to an incoming job. There may be a huge core and a tiny core, depending on the job demand. The number of Floating Point and Multiply Accumulating units is higher in large cores and lower in small cores. For complex activities, we can use the large core, and for simple ones, the tiny core. We are able to employ cores more effectively and get dependable results as a result of this core division. The survey presents basic findings about real-time scheduling of multicore processors that are unaffected by the scheduling strategies used. Various scheduling algorithms, including LTF, EDF, and priority scheduling, are employed based on their specific algorithms.