drm_sched_entity_get_free_sched(struct drm_sched_entity *entity)
 {
        struct drm_sched_rq *rq = NULL;
-       unsigned int min_score = UINT_MAX, num_score;
+       unsigned int min_jobs = UINT_MAX, num_jobs;
        int i;
 
        for (i = 0; i < entity->num_sched_list; ++i) {
                        continue;
                }
 
-               num_score = atomic_read(&sched->score);
-               if (num_score < min_score) {
-                       min_score = num_score;
+               num_jobs = atomic_read(&sched->num_jobs);
+               if (num_jobs < min_jobs) {
+                       min_jobs = num_jobs;
                        rq = &entity->sched_list[i]->sched_rq[entity->priority];
                }
        }
        bool first;
 
        trace_drm_sched_job(sched_job, entity);
-       atomic_inc(&entity->rq->sched->score);
+       atomic_inc(&entity->rq->sched->num_jobs);
        WRITE_ONCE(entity->last_user, current->group_leader);
        first = spsc_queue_push(&entity->job_queue, &sched_job->queue_node);
 
 
        if (!list_empty(&entity->list))
                return;
        spin_lock(&rq->lock);
-       atomic_inc(&rq->sched->score);
        list_add_tail(&entity->list, &rq->entities);
        spin_unlock(&rq->lock);
 }
        if (list_empty(&entity->list))
                return;
        spin_lock(&rq->lock);
-       atomic_dec(&rq->sched->score);
        list_del_init(&entity->list);
        if (rq->current_entity == entity)
                rq->current_entity = NULL;
        struct drm_gpu_scheduler *sched = s_fence->sched;
 
        atomic_dec(&sched->hw_rq_count);
-       atomic_dec(&sched->score);
+       atomic_dec(&sched->num_jobs);
 
        trace_drm_sched_process_job(s_fence);
 
        spin_lock_init(&sched->job_list_lock);
        atomic_set(&sched->hw_rq_count, 0);
        INIT_DELAYED_WORK(&sched->work_tdr, drm_sched_job_timedout);
-       atomic_set(&sched->score, 0);
+       atomic_set(&sched->num_jobs, 0);
        atomic64_set(&sched->job_id_count, 0);
 
        /* Each scheduler will run on a seperate kernel thread */
 
  * @job_list_lock: lock to protect the ring_mirror_list.
  * @hang_limit: once the hangs by a job crosses this limit then it is marked
  *              guilty and it will be considered for scheduling further.
- * @score: score to help loadbalancer pick a idle sched
+ * @num_jobs: the number of jobs in queue in the scheduler
  * @ready: marks if the underlying HW is ready to work
  * @free_guilty: A hit to time out handler to free the guilty job.
  *
        struct list_head                ring_mirror_list;
        spinlock_t                      job_list_lock;
        int                             hang_limit;
-       atomic_t                        score;
-       bool                            ready;
+       atomic_t                        num_jobs;
+       bool                    ready;
        bool                            free_guilty;
 };