This paper considers the performance of a dynamic priority control function (DPCF) of a threshold-based Bernoulli priority jump (TBPJ) scheme. Loss-sensitive and delay-sensitive traffics are applied to a system with a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Loss-sensitive and delay-sensitive traffics represent sound and data, respectively. Under the TBPJ scheme, the first packet of the loss-sensitive traffic buffer goes into the delay-sensitive traffic buffer with Bernoulli probability p according to system states which represent the buffer thresholds and the number of packets waiting for scheduling. Performance analysis shows that TBPJ scheme obtains large performance build-up for the delay-sensitive traffic without performance degradation for the loss-sensitive traffic. TBPJ scheme shows also better performance than that of HOL scheme.