Skip to main content

LilyTask: A Task-Oriented Parallel Computation Model

  • Conference paper
Advanced Parallel Processing Technologies (APPT 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2834))

Included in the following conference series:

Abstract

While BSP model is a concise parallel computation model, it has some limitations in functionality and performance. To overcome those limitations, we propose a task-oriented parallel computation model, named LilyTask, while remaining the virtue of conciseness. In LilyTask, tasks are taken as scheduling units in parallel computation, which may directly reflect the decomposition process of original problems. Further more, a task in LilyTask is allowed to generate subtasks of various granularities at runtime, which makes LilyTask very suitable for irregular problems. LilyTask model may also be applied to computational Grid to solve coarse-granularity parallel problems and loosely-coupled problems sets.

This paper is funded by Project 69933020 of the National Natural Science Foundation of China.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fortune, J.W.: Parallelism in Random Access Machines. In: Proc. 10th Ann. ACM Symp. on Theory Computing, pp. 114–118 (1978)

    Google Scholar 

  2. Valiant, L.G.: A Bridging Model for Parallel Computation. Communications of the ACM (August 1990)

    Google Scholar 

  3. Hill, J., McColl, B., Stefanescu, D., Goudreau, M., Lang, K., Rao, S., Suel, T., Tsantilas, T., Bisseling, R.: The BSP Programming Library. Parallel Computing 24, 1947–1980 (1998)

    Article  Google Scholar 

  4. University of Oxford: Oxford BSPlib, http://www.bsp-worldwide.org/implmnts/oxtool/

  5. University of Paderborn: Paderborn BSP-Library, http://www.uni-paderborn.de/~bsp/

  6. Culler, D.E., Karp, R., Patterson, D., Sahay, A., Schauser, K.E., Santos, E., Subramonian, R., Eicken, T.V.: LogP: Towards a Realistic Model of Parallel Computation. In: Proc. 4th ACM Symp. on Principles and Practice of Parallel Programming, pp. 1–12 (1993)

    Google Scholar 

  7. Bilardi, G., Herley, K.T., Pietracaprina, A., Pucci, G., Spirakis, P.: BSP vs LogP. In: Proc. 8th ACM Symp. on Parallel Algorithms and Architectures, pp. 25–32 (1996)

    Google Scholar 

  8. Wang, T., Li, X.: LilyTask: A Task-Oriented Parallel Computation Model (Technical Report, PKU_CS_NET_TR2003008), http://162.105.80.88/crazysite/home/report

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, T., Li, X. (2003). LilyTask: A Task-Oriented Parallel Computation Model. In: Zhou, X., Xu, M., Jähnichen, S., Cao, J. (eds) Advanced Parallel Processing Technologies. APPT 2003. Lecture Notes in Computer Science, vol 2834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39425-9_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39425-9_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20054-3

  • Online ISBN: 978-3-540-39425-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics