Workforce Issues in the Greater Boston Health Care Industry: Implications for Work and Family

Interviews with more than 40 leaders in the Boston area health care industry have identified a range of broadly-felt critical problems. This document synthesizes these problems and places them in the context of work and family issues implicit in the organization of health care workplaces. It concludes with questions about possible ways to address such issues. The defining circumstance for the health care industry nationally as well as regionally at present is an extraordinary reorganization, not yet fully negotiated, in the provision and financing of health care. Hoped-for controls on increased costs of medical care – specifically the widespread replacement of indemnity insurance by market-based managed care and business models of operation--have fallen far short of their promise. Pressures to limit expenditures have produced dispiriting conditions for the entire healthcare workforce, from technicians and aides to nurses and physicians. Under such strains, relations between managers and workers providing care are uneasy, ranging from determined efforts to maintain respectful cooperation to adversarial negotiation. Taken together, the interviews identify five key issues affecting a broad cross-section of occupational groups, albeit in different ways: Staffing shortages of various kinds throughout the health care workforce create problems for managers and workers and also for the quality of patient care. Long work hours and inflexible schedules place pressure on virtually every part of the healthcare workforce, including physicians. Degraded and unsupportive working conditions, often the result of workplace "deskilling" and "speed up," undercut previous modes of clinical practice. Lack of opportunities for training and advancement exacerbate workforce problems in an industry where occupational categories and terms of work are in a constant state of flux. Professional and employee voices are insufficiently heard in conditions of rapid institutional reorganization and consolidation. Interviewees describe multiple impacts of these issues--on the operation of health care workplaces, on the well being of the health care workforce, and on the quality of patient care. Also apparent in the interviews, but not clearly named and defined, is the impact of these issues on the ability of workers to attend well to the needs of their families--and the reciprocal impact of workers' family tensions on workplace performance. In other words, the same things that affect patient care also affect families, and vice versa. Some workers describe feeling both guilty about raising their own family issues when their patients' needs are at stake, and resentful about the exploitation of these feelings by administrators making workplace policy. The different institutions making up the health care system have responded to their most pressing issues with a variety of specific stratagems but few that address the complexities connecting relations between work and family. The MIT Workplace Center proposes a collaborative exploration of next steps to probe these complications and to identify possible locations within the health care system for workplace experimentation with outcomes benefiting all parties.

On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs

A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper provides two algorithms, one serial and one parallel, to maintain series-parallel (SP) relationships "on the fly" for fork-join multithreaded programs. The serial SP-order algorithm runs in O(1) amortized time per operation. In contrast, the previously best algorithm requires a time per operation that is proportional to Tarjan’s functional inverse of Ackermann’s function. SP-order employs an order-maintenance data structure that allows us to implement a more efficient "English-Hebrew" labeling scheme than was used in earlier race detectors, which immediately yields an improved determinacy-race detector. In particular, any fork-join program running in T₁ time on a single processor can be checked on the fly for determinacy races in O(T₁) time. Corresponding improved bounds can also be obtained for more sophisticated data-race detectors, for example, those that use locks. By combining SP-order with Feng and Leiserson’s serial SP-bags algorithm, we obtain a parallel SP-maintenance algorithm, called SP-hybrid. Suppose that a fork-join program has n threads, T₁ work, and a critical-path length of T[subscript ∞]. When executed on P processors, we prove that SP-hybrid runs in O((T₁/P + PT[subscript ∞]) lg n) expected time. To understand this bound, consider that the original program obtains linear speed-up over a 1-processor execution when P = O(T₁/T[subscript ∞]). In contrast, SP-hybrid obtains linear speed-up when P = O(√T₁/T[subscript ∞]), but the work is increased by a factor of O(lg n).