The majority of the studies conducted in scheduling real-time imprecise transactions mostly concentrate on ?at transaction models. In this paper, we apply this technique to distributed real-time nested transaction models. We consider that nested transaction is a collection of both essential and non-essential subtransactions. We propose a realtime Imprecise Concurrency Control Protocol (ICCP) that resolves the con?icts in favor of the essential subtransactions. For the lending of data-item, we have used the