TY - CONF T1 - Scheduling multiple data visualization query workloads on a shared memory machine T2 - Parallel and Distributed Processing Symposium., Proceedings International, IPDPS 2002, Abstracts and CD-ROM Y1 - 2002 A1 - Andrade,H. A1 - Kurc, T. A1 - Sussman, Alan A1 - Saltz, J. KW - Atomic force microscopy KW - Biomedical informatics KW - Computer science KW - Data analysis KW - data visualisation KW - Data visualization KW - datasets KW - deductive databases KW - digitized microscopy image browsing KW - directed graph KW - directed graphs KW - dynamic query scheduling model KW - Educational institutions KW - high workloads KW - image database KW - limited resources KW - multiple data visualization query workloads KW - multiple query optimization KW - performance KW - priority queue KW - Processor scheduling KW - Query processing KW - query ranking KW - Relational databases KW - scheduling KW - shared memory machine KW - shared memory systems KW - Virtual Microscope KW - visual databases AB - Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimization techniques to batches of queries, in which portions of datasets as well as intermediate results are maintained in memory to speed up query evaluation. We present a dynamic query scheduling model based on a priority queue implementation using a directed graph and a strategy for ranking queries. We examine the relative performance of several ranking strategies on a shared-memory machine using two different versions of an application, called the Virtual Microscope, for browsing digitized microscopy images JA - Parallel and Distributed Processing Symposium., Proceedings International, IPDPS 2002, Abstracts and CD-ROM PB - IEEE SN - 0-7695-1573-8 M3 - 10.1109/IPDPS.2002.1015482 ER -