For implementing conditional concurrent rewriting on distribu­ted memory machines / we have designed a transformation of conditional term rewriting systems to unconditional rewriting systems. The transformation provides a terminating rewriting system that simulates in a correct and complete way the application of the initial conditional rewrite system / which is assumed to be decreasing and confluent. Furthermore / this allows to define a model for the implementation of conditional concurrent rewriting using a fine-grained parallelism on terms and based on term hypergraph rewriting. Finally / we present first experimental results based on our implementation \reco of conditional concurrent rewriting and show that significant speed-ups can be obtained when computing normal forms of terms.