Follow
Ioana Banicescu
Ioana Banicescu
Professor of Computer Science, Mississippi State University
Verified email at cse.msstate.edu - Homepage
Title
Cited by
Cited by
Year
On the scalability of dynamic scheduling scientific applications with adaptive weighted factoring
I Banicescu, V Velusamy, J Devaprasad
Cluster Computing 6, 215-226, 2003
1182003
Balancing processor loads and exploiting data locality in N-body simulations
I Banicescu, S Flynn Hummel
Proceedings of the 1995 ACM/IEEE conference on supercomputing, 43-es, 1995
1151995
Performance of scheduling scientific applications with adaptive weighted factoring
I Banicescu, V Velusamy
Parallel and Distributed Processing Symposium, International 1, 791,792,793 …, 2001
1052001
Load balancing highly irregular computations with the adaptive factoring
I Banicescu, V Velusamy
Proceedings 16th International Parallel and Distributed Processing Symposium …, 2002
1012002
Adaptive factoring: A dynamic scheduling method tuned to the rate of weight changes
I Banicescu, Z Liu
Proc. of the High Performance Computing Symposium, 122-129, 2000
902000
Explainable intrusion detection systems (x-ids): A survey of current methods, challenges, and opportunities
S Neupane, J Ables, W Anderson, S Mittal, S Rahimi, I Banicescu, ...
IEEE Access 10, 112392-112415, 2022
822022
Dynamic load balancing with adaptive factoring methods in scientific applications
RL Cariño, I Banicescu
The Journal of Supercomputing 44 (1), 41-63, 2008
792008
A load balancing tool for distributed parallel loops
RL Cariño, I Banicescu
Cluster Computing 8, 313-321, 2005
442005
A novel dynamic load balancing library for cluster computing
M Balasubramaniam, K Barker, I Banicescu, N Chrisochoides, JP Pabico, ...
Third international symposium on parallel and distributed computing/third …, 2004
402004
Addressing the stochastic nature of scientific computations via dynamic loop scheduling
I Banicescu, RL Carino
Electronic Transactions on Numerical Analysis 21, 66-80, 2005
382005
Experiences with fractiling in n-body simulations
I Banicescu, R Lu
Proceedings of High Performance Computing 98, 121-126, 1998
341998
A hybrid model-free approach for the near-optimal intrusion response control of non-stationary systems
S Iannucci, V Cardellini, OD Barba, I Banicescu
Future Generation Computer Systems 109, 111-124, 2020
332020
Load balancing and data locality via fractiling: An experimental study
SF Hummel, I Banicescu, CT Wang, J Wein
Languages, Compilers and Run-Time Systems for Scalable Computers, 85-98, 1996
331996
An approach for realistically simulating the performance of scientific applications on high performance computing systems
A Mohammed, A Eleliemy, FM Ciorba, F Kasielke, I Banicescu
Future Generation Computer Systems 111, 617-633, 2020
302020
Towards an autonomic performance management approach for a cloud broker environment using a decomposition–coordination based methodology
R Mehrotra, S Srivastava, I Banicescu, S Abdelwahed
Future Generation Computer Systems 54, 195-205, 2016
272016
Towards the robustness of dynamic loop scheduling on large-scale heterogeneous distributed systems
I Banicescu, FM Ciorba, RL Carino
2009 Eighth International Symposium on Parallel and Distributed Computing …, 2009
272009
A comparison of graph-based synthetic data generators for benchmarking next-generation intrusion detection systems
S Iannucci, HA Kholidy, AD Ghimire, R Jia, S Abdelwahed, I Banicescu
2017 IEEE International Conference on Cluster Computing (CLUSTER), 278-289, 2017
252017
Design and implementation of a novel dynamic load balancing library for cluster computing
I Banicescu, RL Cariño, JP Pabico, M Balasubramaniam
Parallel Computing 31 (7), 736-756, 2005
242005
Dynamic scheduling parallel loops with variable iterate execution times
RL Carino, I Banicescu
Parallel and Distributed Processing Symposium, International 2, 8 pp-8 pp, 2002
232002
Load balancing and data locality in the parallelization of the fast multipole algorithm
I Banicescu
Polytechnic University, 1996
231996
The system can't perform the operation now. Try again later.
Articles 1–20