Skip to main content

Rough Set Based Data Mining Tasks Scheduling on Knowledge Grid

  • Conference paper
Advances in Web Intelligence (AWIC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3528))

Included in the following conference series:

  • 1013 Accesses

  • 7 Citations

Abstract

An important aspect of scheduling data mining applications on Grid is the ability to accurately determine estimation of task completion time. In this paper, we present a holistic approach to estimation that uses rough sets theory to determine a similarity template and then compute a runtime estimate using identified similar task. The approach is based on frequencies of attributes appeared in discernibility matrix. Experimental result validates our hypothesis that rough sets provide an intuitively sound solution to the problem of scheduling tasks in Grid environment.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Talia, D., Cannataro, M.: Knowledge grid: An architecture for distributed knowledge discovery. Comm. of the ACM (2002)

    Google Scholar 

  2. Smith, W., Taylor, V., Foster, I.: Using Runtime Predictions to Estimate Queue Wait Times and Improve Scheduler Performance. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1999, IPPS-WS 1999, and SPDP-WS 1999. LNCS, vol. 1659, p. 202. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  3. Hu, X.: Knowledge discovery in databases: An attribute-oriented rough set approach, Ph.D thesis, Regina university (1995)

    Google Scholar 

  4. Starzyk, J., Nelson, D.E., Sturtz, K.: Reduct generation in information systems. Bulletin of international rough set society 3 (1998)

    Google Scholar 

  5. Pal, S.K., Skowron, A.: Rough Fuzzy Hybridization-A new trend in decision-making. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  6. Braun, T.D., Siegel, H.J., Beck, N.: A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems. Journal of Parallel and Distributed Computing (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gao, K., Chen, K., Liu, M., Chen, J. (2005). Rough Set Based Data Mining Tasks Scheduling on Knowledge Grid. In: Szczepaniak, P.S., Kacprzyk, J., Niewiadomski, A. (eds) Advances in Web Intelligence. AWIC 2005. Lecture Notes in Computer Science(), vol 3528. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11495772_24

Download citation

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us

Policies and ethics