A connectionist machine for genetic hillclimbing
A connectionist machine for genetic hillclimbing
Energy efficient indexing on air
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Artificial intelligence: a new synthesis
Artificial intelligence: a new synthesis
A study on channel allocation for data dissemination in mobile computing environments
Mobile Networks and Applications - Special issue: resource management in mobile wireless communication networks
Broadcast protocols to support efficient retrieval from databases by mobile users
ACM Transactions on Database Systems (TODS)
The data broadcast problem with non-uniform transmission times
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
Pushing dependent data in clients-providers-servers systems
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Proceedings of the ninth international conference on Information and knowledge management
SAIU: an efficient cache replacement policy for wireless on-demand broadcasts
Proceedings of the ninth international conference on Information and knowledge management
Handbook of wireless networks and mobile computing
Adaptive Data Delivery in Wireless Communication Environments
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
An efficient cache access protocol in a mobile computing environment
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
An effective, efficient XML data broadcasting method in a mobile wireless network
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Customized newspaper broadcast: data broadcast with dependencies
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
| Hi-index | 0.01 |
The up-link bandwidth in satellite networks and in advanced traffic wireless information system is very limited. A server broadcasts data files provided by different independent providers and accessed by many clients in a round-robin manner. The clients who access these files may have different patterns of access. Some clients may wish to access several files in any order (AND), some wish to access one out of several files (OR), and some clients may access a second file only after accessing another file (IMPLY). The goal of the server is to order the files in a way that minimizes the access time of the clients given some a priori knowledge of their access patterns. An appropriate clients-servers model was recently proposed by Bay-Noy, Naor and Schieber. They formulated three separate problems and proposed an algorithm that evaluates certain number of random permutations and chooses the one whose access time is minimized. In this paper, we formulate a combined AOI (AND-OR-IMPLY) problem, and propose to apply a parallel hill climbing algorithm (to each of the four problems), which begins from certain number of random permutations, and then applies hill climbing technique on each of them until there is no more improvement. The evaluation time of neighboring permutations generated in hill climbing process is optimized, so that it requires O(n) time per permutation instead of O(n2) time required for evaluating access time of a random permutation, where n is the number of files the server broadcasts. Experiments indicate that the parallel hill climbing algorithm is O(n) times faster that random permutations method, both in terms of time needed to evaluate the same number of permutations, and time needed to provide a high quality solution. Thus the improvement is significant for broadcasting large number of files.