Follow
Vlad Radulescu
Vlad Radulescu
Cuza University
Verified email at info.uaic.ro
Title
Cited by
Cited by
Year
An efficient scheduling algorithm for the multiprocessor platform
S Andrei, AMK Cheng, G Grigoras, V Radulescu
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2010 12th …, 2010
102010
An improved upper-bound algorithm for non-preemptive task scheduling
S Andrei, AMK Cheng, V Radulescu
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2015 17th …, 2015
72015
An efficient scheduling algorithm for the non-preemptive independent multiprocessor platform
Ş Andrei, AMK Cheng, G Grigoraş, V Rădulescu
International Journal of Grid and Utility Computing 3 (4), 215-223, 2012
72012
Estimating the number of processors towards an efficient non-preemptive scheduling algorithm
S Andrei, AMK Cheng, V Radulescu
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2011 13th …, 2011
72011
Two evolutionary approaches to cross-clustering problems
H Luchian, B Paechter, V Radulescu, S Luchian
Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on 2, 1999
51999
Work-in-Progress Abstract: A New Criterion for Job Switching in Semi-Clairvoyant Systems
V Rădulescu, Ş Andrei, AMK Cheng
2021 IEEE 27th International Conference on Embedded and Real-Time Computing …, 2021
32021
A Heuristic-Based Approach for Reducing the Power Consumption of Real-Time Embedded Systems
V Radulescu, S Andrei, AMK Cheng
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2014 16th …, 2014
32014
Toward an Optimal Power-Aware Scheduling Technique
S Andrei, AMK Cheng, V Radulescu, T McNicholl
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2012 14th …, 2012
32012
Resource Bounding for Non-Preemptive Task Scheduling on a Multiprocessor Platform
V Radulescu, S Andrei, AMK Cheng
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2016 18th …, 2016
22016
A new scheduling algorithm for non-preemptive independent tasks on a multi-processor platform
S Andrei, AMK Cheng, V Radulescu, S Alam, S Vadlakonda
ACM SIGBED Review 13 (2), 24-29, 2016
22016
Processor Bounding for an Efficient Non-preemptive Task Scheduling Algorithm
Ş Andrei, AMK Cheng, V Rădulescu
Mathematics in Computer Science, 1-27, 2019
12019
An efficient scheduling algorithm of non-preemptive independent tasks for biomedical systems
S Andrei, AMK Cheng, V Radulescu
New Circuits and Systems Conference (NEWCAS), 2014 IEEE 12th International …, 2014
12014
A synchronization model for automata arrays
V Radulescu
Proceedings of the 27th IASTED International Conference on Modelling …, 2008
12008
Deadlock detection in automata arrays
V Radulescu
Proceedings of the 26th IASTED International Conference on Modelling …, 2007
12007
A NUMA architecture for parallel structures
F Hoza, V Radulescu
Proceedings of the 26th IASTED International Conference on Modelling …, 2007
12007
Designing a New Soft-Hard Task Model for Scheduling Real-Time Systems on a Multiprocessor Platform
Ş Andrei, AMK Cheng, V Rădulescu
2021 23rd International Symposium on Symbolic and Numeric Algorithms for …, 2021
2021
Bounding execution resources for the task scheduling problem in cyber-physical systems
V Rădulescu, Ş Andrei, AMK Cheng
ACM SIGBED Review 15 (4), 20-28, 2018
2018
Using genetic algorithms for the full decompositon of sequential machines
V Radulescu
Proceedings of the 26th IASTED International Conference on Modelling …, 2007
2007
Sisteme de operare: curs universitar: 2004-2005
V Rădulescu
Editura Universităţii" Alexandru Ioan Cuza", 2005
2005
Arhitectura calculatoarelor şi sisteme de operare: 2005-2006
V Rădulescu, H Luchian, A Buburuzan
Editura Universităţii" Alexandru Ioan Cuza", 2005
2005
The system can't perform the operation now. Try again later.
Articles 1–20