Skip navigation
Home
Browse
Communities
& Collections
Browse Items by:
Issue Date
Author
Title
Subject
Help
Sign on to:
My DSpace
Receive email
updates
Edit Profile
BITS Pilani Institutional Repository
Browsing by Author Mishra, Abhishek
Jump to:
0-9
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
or enter first few letters:
Sort by:
title
issue date
submit date
In order:
Ascending
Descending
Results/Page
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
Authors/Record:
All
1
5
10
15
20
25
30
35
40
45
50
Showing results 1 to 20 of 23
next >
Issue Date
Title
Author(s)
2019-05
Benchmarking the contention aware nature inspired metaheuristic task scheduling algorithms
Mishra, Abhishek
2010-10
A Clustering Heuristic for Multiprocessor Environments Using Computation and Communication Loads of Modules
Mishra, Abhishek
2023-11
A compact formulation for the mdmsop: theoretical and computational time analysis
Mishra, Abhishek
2014-06
Complexity of a problem of energy efficient real-time task scheduling on a multicore processor
Mishra, Abhishek
2018-12
An edge priority-based clustering algorithm for multiprocessor environments
Mishra, Abhishek
2011-04
Energy Efficient Task Scheduling of Sendreceive Task Graphs on Distributed Multicore Processors with Software Controlled Dynamic Voltage Scaling
Mishra, Abhishek
2012-12
Energy efficient voltage scheduling for multi-core processors is an important issue in the context of parallel and distributed computing. Dynamic voltage scaling (DVS) is used to reduce the energy consumption of cores. Nowadays processor vendors are providing software for DVS. We consider a system using a single multi-core processor with software controlled DVS having a finite set of discretely available core speeds. Our contribution to this work is solving a well-known energy efficient voltage scheduling problem on the considered system. The problem that we consider is to find a minimum energy voltage scheduling for a given computational load that has to be completed within a given deadline. First we show that the existing methods to solve this problem on other processor models fail to apply on our processor model. Then we formulate an Integer Program (IP) for the problem.
Mishra, Abhishek
2014-07
Energy efficient voltage scheduling for multi-core processors with software controlled dynamic voltage scaling
Mishra, Abhishek
2024-11
Exploring the performance of genetic algorithm and variable neighborhood search for solving the single depot multiple set orienteering problem: a comparative study
Mishra, Abhishek
2010-09
An extention of edge zeroing heuristic for scheduling precedence constrained task graphs on parallel systems using cluster dependent priority scheme
Mishra, Abhishek
2024-11
Hardness amplification via group theory
Mishra, Abhishek
2014-04
A Monte Carlo algorithm for real time task scheduling on multi-core processors with software controlled dynamic voltage scaling
Mishra, Abhishek
2024
The multi-depot multiple set orienteering problem: an integer linear programming formulation
Mishra, Abhishek
2025-02
New techniques for constructing rare-case hard functions
Mishra, Abhishek
2015
On Spectra of Corona Graphs
Mishra, Abhishek
2022
The Orienteering Problem: A Review of Variants and Solution Approaches
Mishra, Abhishek
2020-09
Performance Evaluation of Simulated Annealing-Based Task Scheduling Algorithms
Mishra, Abhishek
2012
A Randomized Scheduling Algorithm For Multiprocessor Environments
Mishra, Abhishek
2016
A Randomized Scheduling Algorithm for Multiprocessor Environments Using Local Search
Mishra, Abhishek
2021
A Simulated Annealing based Energy Efficient Task Scheduling Algorithm for Multi-core Processors
Mishra, Abhishek