This paper proposes a dynamic adaplive coschednlin model DASIC to take aklvantage of excess available resources in a network of workstations (SOW), Beaidea coachoduling related subtaska dynamically, DASIC can acalo up or down the process space depending upon the number of availoble processors on an NOW. Based on the dynamic idle processor group (TPG), DASIC employs three modules. the coscheduling module, the scalable scheduling module and the load balancing module, and uses six algorithms to achieve scalability, A simplified DASIC was also implemented. and expcrimental remls are prcsented in this paper, which show that it can maximize system utilisation, and achieve task parallelism as much as possible.