SBM is a highly efficient synchronization mechanism supporting parallelism on operation level parallel. Based on SBM，we deeply studied the algorithms of node scheduling and barrier placement，and propose an efficient plan for exploiting parallism on operation level. We use a direct graph G(N，A) to describe the dependence among instructions, sort nodes with node's critical path as key words，describe an assignment algorithm that assign the nodes to each processor. Meanwhile，we describe a barrier placement algorithm that inserts the barrier instruction between two dependent instructions if necessary.