Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Analytical results on the quadtree decomposition of arbitrary rectangles
Pattern Recognition Letters
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
File server scaling with network-attached secure disks
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Adaptive rate-controlled scheduling for multimedia applications
IEEE/ACM Transactions on Networking (TON)
ARC-H: Uniform CPU Scheduling for Heterogeneous Services
ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02
Irregularity in high-dimensional space-filling curves
Distributed and Parallel Databases
| Hi-index | 0.01 |
As multimedia applications grow in complexity, more requirements are imposed on software schedulers. It is not always clear that these schedulers are fair to all aspects of the system, or are controllable, in a measurable way, to favor one aspect of the system over the other. The overall goal of this research is to revolutionize the way schedulers are developed. The scheduling problem is formulated as a multi-dimensional sorting problem. Space-filling curves are used to define a linear order for sorting and scheduling objects that lie in the multi-dimensional space. The characteristics of various space-filling curves are studied for sorting and scheduling purposes. Performance measures are proposed to compare the bias, among other characteristics, of a space-filling curve towards any of its dimensions.