Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
SETI@HOME—massively distributed computing for SETI
Computing in Science and Engineering
Tradeoffs in probabilistic packet marking for IP traceback
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fine-Grain Access Control for Securing Shared Resources in Computational Grids
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Efficient Pairing Functions - And Why You Should Care
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
On Scheduling Mesh-Structured Computations for Internet-Based Computing
IEEE Transactions on Computers
Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing
IEEE Transactions on Computers
Flow-net methodology for accountability in wireless networks
IEEE Network: The Magazine of Global Internetworking
Internet computing of tasks with dependencies using unreliable workers
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Accountability and Q-Accountable Logging in Wireless Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.01 |
Web-Based Computing (WBC) is a modality of collaborative computing wherein 驴volunteers驴 register at a website, receiving one (usually compute-intensive) task to compute at each visit and returning the results from that task at the subsequent visit. The security of a WBC project is enhanced if the owner of the website can easily keep track of which 驴volunteer驴 computed which tasks, thereby endowing the project with accountability. We develop a framework for constructing computationally lightweight schemes for endowing WBC projects with accountability. The framework is built around the notion of a directly computed task allocation function (TAF) that reserves a dedicated subset of the website's tasks for each 驴volunteer.驴 We show how TAFs simplify the data structures needed to link 驴volunteers驴 with their tasks, even when 驴volunteers驴 are allowed to join and leave the WBC project dynamically. We then design a methodology for constructing easily computed TAFs that enhance the efficiency of the accountability scheme.